Composition of cryptographic protocols in a probabilistic polynomial-time process calculus

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

Volumn 2761, Issue , 2003, Pages 327-349

  Mateus, P ^a   Mitchell, J ^b   Scedrov, A ^c  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b Stanford University   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Composition theorem; Computational security; Cryptographic protocols; Probabilistic process calculus

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION; TURING MACHINES;

COMPOSITION THEOREM; COMPOSITIONALITY; COMPUTATIONAL SECURITY; CRYPTOGRAPHIC PROTOCOLS; OBLIVIOUS TRANSFER; PROBABILISTIC POLYNOMIAL TIME; PROBABILISTIC PROCESS; PROCESS CALCULI;

CALCULATIONS;

EID: 35248861970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_22     Document Type: Article

References (30)

1. M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi-calculus. Information and Computation, 143:1-70, 1999.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
3. M. Backes, C. Jacobi, and B. Pfitzmann. Deriving cryptographically sound implementations using composition and formally verified bisimulation. In Formal Methods Europe, volume 2931 of Lecture Notes in Computer Science, pages 310-329. Springer-Verlag, 2002.
4. M. Backes, B. Pfitzmann, and M. Waidner. Universally composable cryptographic library. Manuscript available on eprint.iacr.org as 2003/015, 2003.
5. D. Beaver. Foundations of secure interactive computing. In Crypto'91, volume 576 of Lecture Notes in Computer Science, pages 377-391. Springer-Verlag, 1991.
6. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75-122, 1991.
7. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42-nd Annual Symposium on Foundations of Computer Science (FOCS), pages 136-145. IEEE Press, 2001. Full paper available at eprint.iacr.org as 2000/067.
8. R. Canetti and H. Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. In Eurocrypt'01, volume 2045 of Lecture Notes in Computer Science, pages 453-474. Springer-Verlag, 2001.
9. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In 34-th ACM Symposium on Theory of Computing, pages 484-503, 2002. Full paper available at eprint.iacr.org as 2002/140.
10. D. Dolev and A. Yao. On the security of public-key protocols. In Proc. 22-nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 350-357, 1981.
11. T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31:469-472, 1985.
12. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
13. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge Univ. Press, 2001.
14. ∼oded.
15. S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Crypto'90, volume 537 of Lecture Notes in Computer Science, pages 77-93. Springer-Verlag, 1990.
16. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time framework for protocol analysis. In M. Reiter, editor, 5-th ACM Conferece on Computer and Communication Security, pages 112-121. ACM Press, 1998.
17. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security analysis. In Formal Methods in the Development of Computing Systems, volume 1708 of Lecture Notes in Computer Science, pages 776-793. Spriger-Verlag, 1999.
18. N. Lynch. Distributed Algorithms. Morgan Kaufman, 1996.
19. P. Mateus, A. Pacheco, J. Pinto, A. Sernadas, and C. Sernadas. Probabilistic situation calculus. Annals of Mathematics and Artificial Intelligence, 32(1):393-431, 2001.
20. S. Micali and P. Rogaway. Secure computation. In Crypto'91, volume 576 of Lecture Notes in Computer Science, pages 392-404. Springer-Verlag, 1991.
21. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
22. J. Mitchell, M. Mitchell, and A. Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In 39-th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 725-733. IEEE Computer Society Press, 1998.
23. J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for analysis of cryptographic protocols. Electronic Notes in Theoretical Computer Science, 45, 2001.
24. R. Needham and M. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-9, 1978.
25. B. Pfitzmann, M. Schunter, and M. Waidner. Cryptographic security of reactive systems. Electronic Notes in Theoretical Computer Science, 32, 2000.
26. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In 7-th ACM Conference on Computer and Communications Security, pages 245-254. ACM Press, 2000.
27. M. Rabin. How to exchange secrets by oblivious transfer. Tech. memo TR-81, Aiken Computation Laboratory, Harvard U., 1981.
28. A. W. Roscoe. Modelling and verifying key-exchange protocols using CSP and FDR. In 8-th IEEE Computer Security Foundations Workshop (CSFW). IEEE Computer Society Press, 1995.
29. S. Schneider. Security properties and CSP. In IEEE Symposium Security and Privacy, 1996.
30. A. Yao. Theory and applications of trapdoor functions. In 23-rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 80-91. IEEE Press, 1982.