Cryptographically sound implementations for communicating processes (extended abstract)

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

Volumn 4052 LNCS, Issue , 2006, Pages 83-94

  Adão, Pedro ^a   Fournet, Cédric ^b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; FORMAL LANGUAGES; INFORMATION THEORY; POLYNOMIALS; SECURITY SYSTEMS;

COMMUNICATING PROCESSES; DISTRIBUTED PROGRAMS; PUBLIC NETWORK;

CRYPTOGRAPHY;

EID: 33746364838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_8     Document Type: Conference Paper

References (18)

1. M. Abadi and C. Fournet. Private authentication. Theoretical Computer Science, 322(3):427-476, 2004. Special issue on Foundations of Wide Area Network Computing.
2. M. Abadi, C. Fournet, and G. Gonthier. Authentication primitives and their compilation. In POPL 2000, pages 302-315. ACM, 2000.
3. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. Information and Computation, 174(1):37-83, 2002.
4. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The Spi Calculus. Information and Computation, 148(1): 1-70, 1999.
5. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
6. P. Adão and C. Fournet. Cryptographically sound implementations for communicating processes. Technical report MSR-TR-2006-49. Microsoft Research, 2006.
7. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In CSFW-17, pages 204-218. IEEE, 2004.
8. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In CCS 2003, pages 220-230. ACM, 2003.
9. M. Backes, B. Pfitzmann, and M. Waidner. Symmetric authentication within a simulatable cryptographic library. International Journal of Information Security, 4(3):135-154, 2005.
10. B. Blanchet, M. Abadi, and C. Fournet. Automated verification of selected equivalences for security protocols. In LICS 2005, pages 331-340. IEEE, 2005.
11. R. Canetti and H. Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. In EUROCRYPT 2001, LNCS 2045, pages 453-474. Springer, 2001.
12. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and Systems Sciences, 28(2):270-299, 1984.
13. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal on Computing, 17(2):281-308, 1988.
14. P. Laud. Secrecy types for a simulatable cryptographic library. In CCS 2005, pages 26-35. ACM, 2005.
15. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In CCS 1998, pages 112-121. ACM, 1998.
16. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In TCC 2004, LNCS 2951, pages 133-151. Springer, 2004.
17. J. C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for the analysis of cryptographic protocols. Theoretical Computer Science, 2006.
18. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO'91, LNCS 576, pages 433-444. Springer, 1991.