A Probabilistic polynomial-time calculus for analysis of cryptographic protocols: (Preliminary report)

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 280-310

  Mitchell, J ^a   Ramanathan, A ^a   Scedrov, A ^b   Teague, V ^a  

^a Stanford University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; DIFFERENTIATION (CALCULUS); NETWORK PROTOCOLS; POLYNOMIALS; SECURITY OF DATA; STATISTICAL TESTS;

BOOLEAN TESTS; CRYPTOGRAPHIC CONCEPTS; CRYPTOGRAPHIC PROTOCOLS; NONDETERMINISM;

COMPUTER SYSTEMS PROGRAMMING;

EID: 1442267753     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80968-X     Document Type: Conference Paper

References (39)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In 28th ACM Symposium on Principles of Programming Languages, pages 104-115, 2001.
2. M. Abadi and A. Gordon. A bisimulation method for cryptographic protocol. In Proc. ESOP'98, Springer Lecture Notes in Computer Science, 1998.
3. M. Abadi and A. Gordon. 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).
4. M. Abadi, and J. Jürjens. Formal eavesdropping and its computational interpretation. In Proc. 4-th International Symposium on Theoretical Aspects of Computer Software (TACS2001), Tohoku University, Sendai, Japan, 2001. Springer LNCS.
5. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). In IFIP International Conference on Theoretical Computer Science, Sendai, Japan, 2000. Full paper to appear in J. of Cryptology.
6. Atallah M.J. Algorithms and Theory of Computation Handbook. 1999;19-28 CRC Press LLC
7. S. Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992.
8. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society, Series A, 426(1871):233-271, 1989
9. Also appeared as SRC Research Report 39 and
10. in a shortened form, in ACM Transactions on Computer Systems 8, 1 (February 1990), 18-36.
11. R. Canetti. A unified framework for analyzing security of protocols. Cryptology ePrint Archive: Report 2000/067; see http://eprint.iacr.org/2000/067/ , 2000.
12. Cervesato I., Durgin N.A., Lincoln P.D., Mitchell J.C., Scedrov A. A metanotation for protocol analysis. 12-th IEEE Computer Security Foundations Workshop. 1999;IEEE Computer Society Press
13. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography (extended abstract). In Proc. 23rd Annual ACM Symposium on the Theory of Computing, pages 542-552, 1991.
14. D. Dolev and A. Yao. On the security of public-key protocols. In Proc. 22nd Annual IEEE Symp. Foundations of Computer Science, pages 350-357, 1981.
15. Durgin N.A., Mitchell J.C., Pavlovic D. A compositional logic for protocol correctness. IEEE Computer Security Foundations Workshop. 2001
16. ElGamal T. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory. IT-31:1985;469-472
17. R. Gennaro. An improved pseudo-random generator based on discrete log. In Proc. CRYPTO 2000, pages 469-481. Springer LNCS 1880, 2000. Revised version available on www.research.ibm.com/people/r/rosario/.
18. Goldreich O. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. 1999;Springer Verlag
19. O. Goldreich. The Foundations of Cryptography - A Book in Preparation. Available on www.wisdom.weizmann.ac.il/~oded/foc-book.html, 2000.
20. Goldwasser S., Micali S. Probabilistic encryption. J. Computer and System Sciences. 28:1984;281-308
21. M. Hofmann. Type systems for polynomial-time computation. Habilitation thesis, Darmstadt, 1999; see www.dcs.ed.ac.uk/home/mxh/papers.html, 1999.
22. Kemmerer R., Meadows C., Millen J. Three systems for cryptographic protocol analysis. J. Cryptology. 7:(2):1994;79-130
23. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Information and Computation. 94:(1):1991;1-28
24. Lincoln P.D., Mitchell J.C., Mitchell M., Scedrov A. Probabilistic polynomial-time equivalence and security protocols. Wing J.M., Woodcock J., Davies J. Formal Methods World Congress. Vol. I:1999;776-793 Springer LNCS 1708, Toulouse, France
25. P.D. Lincoln, M. Mitchell, J.C. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In M.K. Reiter, editor, Proc. 5-th ACM Conference on Computer and Communications Security, pages 112-121, San Francisco, California, 1998. ACM Press.
26. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR. In 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, 1996.
27. Luby M. Pseudorandomness and Cryptographic. Applications Princeton Computer Science Notes :1996;Princeton University Press
28. C. Meadows. Analyzing the Needham-Schroeder public-key protocol: a comparison of two approaches. In Proc. European Symposium On Research In Computer Security. Springer Verlag, 1996.
29. Milner R. Communication and Concurrency. 1989;Prentice Hall
30. J.C. Mitchell, M. Mitchell, and A. Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In Proc. 39-th Annual IEEE Symposium on Foundations of Computer Science, pages 725-733, Palo Alto, California, 1998. IEEE Computer Society Press.
31. J.C. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using Muru. In Proc. IEEE Symp. Security and Privacy, pages 141-151, 1997.
32. Needham R., Schroeder M. Using encryption for authentication in large networks of computers. Communications of the ACM. 21:(12):1978;993-999
33. Paulson L.C. Mechanized proofs for a recursive authentication protocol. 10th IEEE Computer Security Foundations Workshop. 1997;84-95
34. Paulson L.C. Proving properties of security protocols by induction. 10th IEEE Computer Security Foundations Workshop. 1997;70-83
35. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In 7-th ACM Conference on Computer and Communications Security, Athens, November 2000, pages 245-254. ACM Press, 2000. Preliminary version: IBM Research Report RZ 3234 (# 93280) 06/12/00, IBM Research Division, Zürich, June 2000.
36. A. W. Roscoe. Modelling and verifying key-exchange protocols using CSP and FDR. In CSFW VIII, page 98. IEEE Computer Soc Press, 1995.
37. Schneider S. Security properties and CSP. IEEE Symp. Security and Privacy. 1996
38. van Glabbeek R.J., Smolka S.A., Steffen B. Reactive, generative and stratified models of probabilistic processes. Information and Computation. 121:(1):1995;59-80
39. Yao A. Theory and applications of trapdoor functions. IEEE Foundations of Computer Science. 1982;80-91