Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols

1. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: 28th ACM Symposium on Principles of Programming Languages, pp. 104–115 (2001)

   Google Scholar 

2. Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. Information and Computation 143, 1–70 (1999); Expanded version available as SRC Research Report 149 (January 1998)

   Google Scholar 

3. Atallah, M.J. (ed.): Algorithms and Theory of Computation Handbook, ch. 24, pp. 19–28. CRC Press LLC, Boca Raton (1999)

   Google Scholar 

4. Bellantoni, S.: Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto (1992)

   Google Scholar 

5. Boneh, D.: The decision Diffie-Hellman problem. In: Proceedings of the Third Algorithmic Number Theory Symposium, vol. 1423, pp. 48–63 (1998)

   Google Scholar 

6. Burrows, M., Abadi, M., Needham, R.: A logic of authentication. Proceedings of the Royal Society, Series A 426, 1871, 233–271 (1989); Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8(1), 18–36 (February 1990)

   Google Scholar 

7. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symp. on the Foundations of Computer Science, IEEE, Los Alamitos (2001), Full version available at http://eprint.iacr.org/2000/067/

8. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22, 644–654 (1976)

   Article  MATH  MathSciNet  Google Scholar 

9. Dolev, D., Yao, A.C.-C.: On the security of public-key protocols. In: Proc. 22nd Annual IEEE Symp. Foundations of Computer Science, pp. 350–357 (1981)

   Google Scholar 

10. Durgin, N.A., Mitchell, J.C., Pavlovic, D.: A compositional logic for protocol correctness. In: 14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada (June 2001)

    Google Scholar 

11. El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)

    Article  MATH  Google Scholar 

12. Goldreich, O.: The Foundations of Cryptography, vol. 1. Cambridge University Press, Cambridge (June 2001)

    Google Scholar 

13. Goldreich, O.: The Foundations of Cryptography, vol. 2 (June 2003), Manuscript under preparation; latest version available at http://www.wisdom.weizmann.ac.il/~oded/foc-vol2.html

14. Goldwasser, S., Bellare, M.: Lecture Notes on Cryptography (2003), Lecture notes for a class taught by the authors at MIT (1996–2001); available online at http://www.cs.nyu.edu/courses/fall01/G22.3033-003/

15. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270–299 (1984), Previous version in STOC 1982

    Google Scholar 

16. Hofmann, M.: Type Systems for Polynomial-Time Computation. Habilitation Thesis, Darmstadt, see www.dcs.ed.ac.uk/home/mxh/papers.html (1999)

17. Huth, M., Kwiatkowska, M.Z.: Quantitative analysis and model checking. In: LICS 1997, pp. 111–122 (1997)

    Google Scholar 

18. Lincoln, P.D., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: Reiter, M.K. (ed.) Proc. 5th ACM Conference on Computer and Communications Security, San Francisco, California, pp. 112–121. ACM Press, New York (1998)

    Chapter  Google Scholar 

19. Mateus, P., Mitchell, J.C., Scedrov, A.: Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 327–349. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

20. Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

21. Mitchell, J.C., Mitchell, M., Scedrov, A.: A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In: Proc. 39th Annual IEEE Symposium on the Foundations of Computer Science, Palo Alto, California, pp. 725–733. IEEE, Los Alamitos (1998)

    Google Scholar 

22. Mitchell, J.C., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time calculus for the analysis of cryptographic protocols (preliminary report). In: Brookes, S., Mislove, M. (eds.) 17th Annual Conference on the Mathematical Foundations of Programming Semantics, Arhus, Denmark, May 2001. Electronic notes in Theoretical Computer Science, vol. 45 (2001)

    Google Scholar 

23. Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM 21 12, 993–999 (1978)

    Article  Google Scholar 

24. Paulson, L.C.: Mechanized proofs for a recursive authentication protocol. In: 10th IEEE Computer Security Foundations Workshop, pp. 84–95 (1997)

    Google Scholar 

25. Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Security and Privacy, Washington, pp. 184–200 (2001)

    Google Scholar 

26. Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: A probabilistic polynomial-time calculus for the analysis of cryptographic protocols (2004), ftp://ftp.cis.upenn.edu/pub/papers/scedrov/ppc-2004-long.ps,pdf

27. Schneider, S.: Security properties and CSP. In: IEEE Symposium on Security and Privacy, Oakland, California (1996)

    Google Scholar 

28. van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. International Journal on Information and Computation 121(1) (August 1995)

    Google Scholar 

29. Yao, A.C.-C.: Theory and applications of trapdoor functions. IEEE Foundations of Computer Science, 80–91 (1982)

    Google Scholar 

Download references