Probabilistic bisimulation and equivalence for security analysis of network protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2987, Issue , 2004, Pages 468-483

  Ramanathan, Ajith ^a   Mitchell, John ^a   Scedrov, Andre ^b   Teague, Vanessa ^a  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; CRYPTOGRAPHY; NETWORK PROTOCOLS; POLYNOMIAL APPROXIMATION; SEMANTICS;

DECISION DIFFIE-HELLMAN; EQUATIONAL REASONING; OBSERVATIONAL EQUIVALENCES; PROBABILISTIC BISIMULATIONS; PROBABILISTIC POLYNOMIAL TIME; PROTOCOL SECURITY; SECURITY ANALYSIS; SECURITY PROPERTIES;

NETWORK SECURITY;

EID: 35048876713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_33     Document Type: Article

References (30)

1. ABADI, M., AND FOURNET, C. Mobile values, new names, and secure communication. In 28th ACM Symposium on Principles of Programming Languages (2001), pp. 104-115.
2. ABADI, M., AND GORDON, A. D. A calculus for cryptographic protocols: the spi calculus. Information and Computation 143 (1999), 1-70. Expanded version available as SRC Research Report 149 (January 1998).
3. ATALLAH, M. J., Ed. Algorithms and Theory of Computation Handbook. CRC Press LLC, 1999, ch. 24, pp. 19-28.
4. BELLANTONI, S. Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992.
5. BONEH, D. The decision Diffie-Hellman problem. Proceedings of the Third Algorithmic Number Theory Symposium 1423 (1998), 48-63.
6. BURROWS, M., ABADI, M., AND NEEDHAM, R. A logic of authentication. Proceedings of the Royal Society, Series A 426, 1871 (1989), 233-271.
7. Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8, 1 (February 1990), 18-36.
8. CANETTI, R. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symp. on the Foundations of Computer Science (2001), IEEE. Full version available at http://eprint.iacr.org/2000/ 067/.
9. DIFFIE, W., AND HELLMAN, M. E. New directions in cryptography. IEEE Transactions on Information Theory 22 (November 1976), 644-654.
10. DOLEV, D., AND YAO, A. C.-C. On the security of public-key protocols. In Proc. 22nd Annual IEEE Symp. Foundations of Computer Science (1981), pp. 350-357.
11. DURGIN, N. A., MITCHELL, J. C., AND PAVLOVIC, D. A compositional logic for protocol correctness. In 14th IEEE Computer Security Foundations Workshop (Cape Breton, Nova Scotia, Canada, June 2001).
12. EL GAMAL, T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31 (1985), 469-472.
13. GOLDREICH, O. The Foundations of Cryptography, vol. 1. Cambridge University Press, June 2001.
14. 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.
15. GOLDWASSER, S., AND 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/.
16. GOLDWASSER, S., AND MICALI, S. Probabilistic encryption. Journal of Computer and System Sciences 28, 1 (1984), 270-299. Previous version in STOC 1982.
17. HOFMANN, M. Type Systems for Polynomial-Time Computation. Habilitation Thesis, Darmstadt; see www.dcs.ed.ac.uk/home/mxh/papers.html, 1999.
18. HUTH, M., AND KWIATKOWSKA, M. Z. Quantitative analysis and model checking. In LICS '97 (1997), pp. 111-122.
19. LINCOLN, P. D., MITCHELL, J. C., MITCHELL, M., AND SCEDROV, A. A probabilistic poly-time framework for protocol analysis. In Proc. 5th ACM Conference on Computer and Communications Security (San Francisco, California, 1998), M. K. Reiter, Ed., ACM Press, pp. 112-121.
20. MATEUS, P., MITCHELL, J. C., AND SCEDROV, A. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In 14th International Conference on Concurrency Theory (Marseille, France, 2003), R. M. Amadio and D. Lugiez, Eds., vol. 2761 of Lecture Notes in Computer Science, Springer-Verlag, pp. 327-349.
21. MILNER, R. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
22. MITCHELL, J. C., MITCHELL, M., AND 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, 1998), IEEE, pp. 725-733.
23. MITCHELL, J. C., RAMANATHAN, A., SCEDROV, A., AND TEAGUE, V. A probabilistic polynomial-time calculus for the analysis of cryptographic protocols (preliminary report). In 17th Annual Conference on the Mathematical Foundations of Programming Semantics, Arhus, Denmark, May, 2001 (2001), S. Brookes and M. Mislove, Eds., vol. 45, Electronic notes in Theoretical Computer Science.
24. NEEDHAM, R., AND SCHROEDER, M. Using encryption for authentication in large networks of computers. Communications of the ACM 21, 12 (1978), 993-999.
25. PAULSON, L. C. Mechanized proofs for a recursive authentication protocol. In 10th IEEE Computer Security Foundations Workshop (1997), pp. 84-95.
26. PFITZMANN, B., AND WAIDNER, M. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy (Washington, 2001), pp. 184-200.
27. RAMANATHAN, A., MITCHELL, J. C., SCEDROV, A., AND TEAGUE, V. A probabilistic polynomial-time calculus for the analysis of cryptographic protocols. ftp://ftp.cis.upenn.edu/pub/papers/scedrov/ppc-2004-long.{ps,pdf}, 2004.
28. SCHNEIDER, S. Security properties and CSP. In IEEE Symposium on Security and Privacy (Oakland, California, 1996).
29. VAN GLABBEEK, R. J., SMOLKA, S. A., AND STEFFEN, B. Reactive, generative, and stratified models of probabilistic processes. International Journal on Information and Computation 121, 1 (August 1995).
30. YAO, A. C.-C. Theory and applications of trapdoor functions. In IEEE Foundations of Computer Science (1982), pp. 80-91.