Automatic proof of strong secrecy for security protocols

Proceedings - IEEE Symposium on Security and Privacy

Volumn 2004, Issue , 2004, Pages 86-100

  Blanchet, Bruno ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PROTOCOLS; SECRECY; SECURITY PROTOCOLS;

ALGORITHMS; COMPUTER PRIVACY; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SECURITY OF DATA; SEMANTICS; THEOREM PROVING;

CRYPTOGRAPHY;

EID: 3543058869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECPRI.2004.1301317     Document Type: Conference Paper

References (44)

1. M. Abadi. Secrecy by Typing in Security Protocols. In Theoretical Aspects of Computer Software, volume 1281 of LNCS, pages 611-638. Springer, 1997.
2. M. Abadi. Security Protocols and their Properties. In Foundations of Secure Computation, NATO Science Series, pages 39-60. IOS Press, 2000. Volume for the 20th International Summer School on Foundations of Secure Computation, held in Marktoberdorf, Germany (1999).
3. M. Abadi and B. Blanchet. Analyzing Security Protocols with Secrecy Types and Logic Programs. In 29th ACM Symposium on Principles of Programming Languages (POPL'02), pages 33-44, Jan. 2002.
4. M. Abadi, B. Blanchet, and C. Fournet. Just Fast Keying in the Pi Calculus. In Programming Languages and Systems: 13th European Symposium on Programming (ESOP'04), LNCS. Springer, Mar. 2004.
5. M. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 104-115, Jan. 2001.
6. M. Abadi and A. D. Gordon. A Bisimulation Method for Cryptographic Protocols. Nordic Journal of Computing, 5(4):267-303, Winter 1998.
7. M. Abadi and A. D. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1): 1-70, Jan. 1999.
8. M. Abadi and J. Jürjens. Formal Eavesdropping and its Computational Interpretation. In Theoretical Aspects of Computer Software (TACS'01), volume 2215 of LNCS, pages 82-94. Springer, Oct. 2001.
9. M. Abadi and R. Needham. Prudent Engineering Practice for Cryptographic Protocols. IEEE Transactions on Software Engineering, 22(1):6-15, Jan. 1996.
10. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). In First IFIP International Conference on Theoretical Computer Science, volume 1872 of LNCS, pages 3-22. Springer, Aug. 2000.
11. W. Aiello, S. Bellovin, M. Blaze, R. Canetti, J. Ionnidis, A. Keromytis, and O. Reingold. Efficient, DoS-resistant, Secure Key Exchange for Internet Protocols. In ACM Conference on Computer and Communications Security (CCS'02), pages 48-58. ACM, Nov. 2002.
12. M. Backes and B. Pfitzmann. Computational probabilistic non-interference. In 7th European Symposium on Research in Computer Security (ESORICS '02), volume 2502 of LNCS, pages 1-23. Springer, Oct. 2002.
13. M. Backes and B. Pfitzmann. Intransitive Non-Interference for Cryptographic Purposes. In 24th IEEE Symposium on Security and Privacy, pages 140-152. IEEE, May 2003.
14. M. Backes, B. Pfitzmann, and M. Waidner. A Composable Cryptographic Library with Nested Operations. In 10th ACM conference on Computer and communication security (CCS'03), pages 220-230. ACM, Oct. 2003.
15. B. Blanchet. An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In 14th IEEE Computer Security Foundations Workshop (CSFW-14), pages 82-96, June 2001.
16. B. Blanchet. From Secrecy to Authenticity in Security Protocols. In 9th International Static Analysis Symposium (SAS'02), volume 2477 of LNCS, pages 342-359. Springer, Sept. 2002.
17. B. Blanchet and A. Podelski. Verification of Cryptographic Protocols: Tagging Enforces Termination. In Foundations of Software Science and Computation Structures (FoS-SaCS'03), volume 2620 of LNCS, pages 136-152. Springer, Apr. 2003.
18. M. Boreale, R. De Nicola, and R. Pugliese. Proof Techniques for Cryptographic Processes. SIAM Journal on Computing, 31(3):947-986, 2002.
19. J. Borgström and U. Nestmann. On Bisimulations for the Spi Calculus. In Algebraic Methodology and Software Technology: 9th International Conference, AMAST 2002, volume 2422 of LNCS, pages 287-303. Springer, Sept. 2002.
20. M. Bugliesi, A. Ceccato, and S. Rossi. Non-Interference Proof Techniques for the Analysis of Cryptographic Protocols. In Workshop on Issues in the Theory of Security (WITS'03), pages 42-51, Apr. 2003.
21. M. Burrows, M. Abadi, and R. Needham. A Logic of Authentication. Proceedings of the Royal Society of London A, 426:233-271, 1989.
22. E. Cohen. Proving Protocols Safe from Guessing. In Foundations of Computer Security, July 2002.
23. R. Conn, S. Malladi, J. Alves-Foss, and S. Etalle. Guess What? Here is a New Tool that Finds some New Guessing Attacks. In Workshop on Issues in the Theory of Security (WITS'03), Apr. 2003.
24. M. Dam and P. Giambiagi. Confidentiality for Mobile Code: The Case of a Simple Payment Protocol. In 13th IEEE Computer Security Foundations Workshop (CSFW-13), pages 233-244, July 2000.
25. R. A. DeMillo, N. A. Lynch, and M. J. Merritt. Cryptographic Protocols. In 14th ACM Symposium on Theory of Computing, pages 383-400. ACM, May 1982.
26. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(12): 198-208, Mar. 1983.
27. L. Durante, R. Sisto, and A. Valenzano. A State-Exploration Technique for Spi-Calculus Testing-Equivalence Verification. In Formal Techniques for Distributed System Development, FORTE/PSTV, volume 183 of IFIP Conference Proceedings, pages 155-170. Kluwer, Oct. 2000.
28. R. Focardi and R. Gorrieri. The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties. IEEE Transactions on Software Engineering, 23(9):550-571, Sept. 1997.
29. R. Focardi, R. Gorrieri, and F. Martinelli. Non Interference for the Analysis of Cryptographic Protocols. In Automata, Languages and Programming, 27th International Colloquium, ICALP'00, volume 1853 of LNCS, pages 354372. Springer, July 2000.
30. P. Giambiagi and M. Dam. On the Secure Implementation of Security Protocols. In Programming Languages and Systems: 12th European Symposium on Programming (ESOP'03), volume 2618 of LNCS, pages 144-158. Springer, Apr. 2003.
31. S. Goldwasser and S. Micali. Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. In 14th Annual ACM Symposium on Theory of Computing, pages 365-377. ACM, May 1982.
32. H. Krawczyk. SKEME: A Versatile Secure Key Exchange Mechanism for Internet. In Internet Society Symposium on Network and Distributed Systems Security, Feb. 1996. Available at http://bilbo.isu.edu/ sndss/sndss96.html.
33. P. Laud. Handling Encryption in an Analysis for Secure Information Flow. In Programming Languages and Systems, 12th European Symposium on Programming, ESOP'03, volume 2618 of LNCS, pages 159-173. Springer, Apr. 2003.
34. G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of ZJVCS, pages 147-166. Springer, 1996.
35. G. Lowe. Analyzing Protocols Subject to Guessing Attacks. In Workshop on Issues in the Theory of Security (WITS'02), Jan. 2002.
36. F. Martinelli, M. Petrocchi, and A. Vaccarelli. Analysing EMSS with Compositional Proof Rules for Noninterference. In Workshop on Issues in the Theory of Security (WITS'03), pages 52-53, Apr. 2003.
37. A. C. Myers and B. Liskov. Complete, Safe Information Flow with Decentralized Labels. In IEEE Symposium on Security and Privacy, pages 186-197, May 1998.
38. D. Otway and O. Rees. Efficient and Timely Mutual Authentication. Operating Systems Review, 21(1):8-10, 1987.
39. L. C. Paulson. The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security, 6(1-2):85-128, 1998.
40. A. Sabelfeld and A. C. Myers. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, Jan. 2003.
41. E. Sumii and B. C. Pierce. Logical Relations for Encryption. In 14th IEEE Computer Security Foundations Workshop (CSFW-14), pages 256-269, June 2001.
42. E. Sumii and B.C. Pierce. A Bisimulation for Dynamic Sealing. In 31st ACM Symposium on Principles of Programming Languages (POPL'04), pages 161-172, Jan. 2004.
43. D. Volpano, C. Irvine, and G. Smith. A Sound Type System for Secure How Analysis. Journal of Computer Security, 4:167-187, 1996.
44. S. Zdanccwic and A. Myers. Robust Declassification. In 14th IEEE Computer Security Foundations Workshop (CSFW14), pages 15-23, June 2001.