Protocol Composition Logic (PCL)

Electronic Notes in Theoretical Computer Science

Volumn 172, Issue , 2007, Pages 311-358

  Datta, Anupam ^a   Derek, Ante ^a   Mitchell, John C ^a   Roy, Arnab ^a  

^a Stanford University   (United States)

Author keywords

composition; logic; Security protocol analysis

Indexed keywords

SECURITY PROTOCOL ANALYSIS; SYMMETRIC KEY CRYPTOGRAPHY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; LOGIC DESIGN; MESSAGE PASSING; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

FORMAL LOGIC;

EID: 33847655213     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.012     Document Type: Article

References (77)

1. Abadi, M. and C. Fournet, 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. A calculus for cryptographic protocols: the spi calculus. Information and Computation 148 (1999) 1-70 expanded version available as SRC Research Report 149 (January 1998)
3. Armando A., Basin D.A., Boichut Y., Chevalier Y., Compagna L., Cuéllar J., Drielsma P.H., Héam P.-C., Kouchnarenko O., Mantovani J., Mödersheim S., von Oheimb D., Rusinowitch M., Santiago J., Turuani M., Viganò L., and Vigneron L. The AVISPA tool for the automated validation of internet security protocols and applications. Computer Aided Verification, Proceedings. 17th International Conference, CAV 2005. Lecture Notes in Computer Science 3576 (2005) 281-285
4. Auty M., and Lowe G. A calculus for security protocol development. Submitted for publication (2006). URL. http://web.comlab.ox.ac.uk/oucl/work/gavin.lowe/Papers/synthesis.pdf
5. Backes, M., A. Datta, A. Derek, J.C. Mitchell and M. Turuani, Compositional analysis of contract signing protocols, in: Proceedings of 18th IEEE Computer Security Foundations Workshop (2005)
6. Beauxis, R. and C. Palamidessi, On the asynchronous nature of the asynchronous π-calculus (2006), manuscript
7. Bella, G. and L.C. Paulson, Kerberos version IV: Inductive analysis of the secrecy goals, in: J.-J. Quisquater, editor, Proceedings of the 5th European Symposium on Research in Computer Security (1998), pp. 361-375
8. Bellare, M. and P. Rogaway, Entity authentication and key distribution, in: Advances in Cryprtology - Crypto '93 Proceedings, pp. 232-249
9. Berry G., and Boudol G. The chemical abstract machine. Theoretical Computer Science 96 (1992) 217-248
10. Blanchet, B., An Efficient Cryptographic Protocol Verifier Based on Prolog Rules, in: 14th IEEE Computer Security Foundations Workshop (CSFW-14) (2001), pp. 82-96
11. Borisov, N., I. Goldberg and D. Wagner, Intercepting mobile communications: the insecurity of 802.11, in: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, 2001, pp. 180-189.
12. Boyd C., and Mathuria A. Protocols for Authentication and Key Establishment (2003), Springer-Verlag
13. Burrows M., Abadi M., and Needham R. A logic of authentication. ACM Transactions on Computer Systems 8 (1990) 18-36
14. Butler, F., I. Cervesato, A. Jaggard, A. Scedrov and C. Walstad, Formal analysis of Kerberos 5 (2006), Theoretical Computer Science, in press
15. Butler F., Cervesato I., Jaggard A.D., and Scedrov A. Verifying confidentiality and authentication in kerberos 5. Software Security - Theories and Systems. Second Mext-NSF-JSPS International Symposium, ISSS 2003. Lecture Notes in Computer Science 3233 (2003) 1-24
16. Canetti R. Universally composable security: A new paradigm for cryptographic protocols. Proc. 42nd IEEE Symp. on the Foundations of Computer Science, IEEE, 2001, full version available at. http://eprint.iacr.org/2000/067/
17. Canetti R., Meadows C., and Syverson P. Environmental requirements for authentication protocols. Proceedings of Software Security - Theories and Systems. Mext-NSF-JSPS International Symposium, ISSS. LNCS vol. 2609 (2003) 339-355
18. Cervesato, I., A. Jaggard, A. Scedrov, J.-K. Tsay and C. Walstad, Breaking and fixing public-key kerberos, Technical report. URL ftp://ftp.cis.upenn.edu/pub/papers/scedrov/pkinit.pdf
19. Cervesato, I., A. Jaggard, A. Scedrov, J.-K. Tsay and C. Walstad, Breaking and fixing public-key Kerberos, in: Proc. 11-th Asian Computing Science Conference (ASIAN'06), Springer LNCS, to appear, 2006, preliminary report on http://eprint.iacr.org/2006/009
20. Datta, A., A. Derek, J.C. Mitchell and D. Pavlovic, A derivation system for security protocols and its logical formalization, in: Proceedings of 16th IEEE Computer Security Foundations Workshop (2003), pp. 109-125
21. Datta, A., A. Derek, J.C. Mitchell and D. Pavlovic, Secure protocol composition (extended abstract), in: Proceedings of ACM Workshop on Formal Methods in Security Engineering, 2003, pp. 11-23
22. Datta, A., A. Derek, J.C. Mitchell and D. Pavlovic, Abstraction and refinement in protocol derivation, in: Proceedings of 17th IEEE Computer Security Foundations Workshop (2004), pp. 30-45
23. Datta, A., A. Derek, J.C. Mitchell and D. Pavlovic, Secure protocol composition, in: Proceedings of 19th Annual Conference on Mathematical Foundations of Programming Semantics (2004)
24. Datta A., Derek A., Mitchell J.C., and Pavlovic D. A derivation system and compositional logic for security protocols. Journal of Computer Security 13 (2005) 423-482
25. Datta A., Derek A., Mitchell J.C., Shmatikov V., and Turuani M. Probabilistic polynomial-time semantics for a protocol security logic. Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP '05). Lecture Notes in Computer Science (2005) 16-29
26. Datta, A., A. Derek, J.C. Mitchell and B. Warinschi, Computationally sound compositional logic for key exchange protocols, in: Proceedings of 19th IEEE Computer Security Foundations Workshop (2006), pp. 321-334
27. Diffie W., Oorschot P.C.V., and Wiener M.J. Authentication and authenticated key exchanges. Designs, Codes and Cryptography 2 (1992) 107-125
28. Dolev D., and Yao A. On the security of public-key protocols. IEEE Transactions on Information Theory 2 (1983)
29. Durgin, N., J.C. Mitchell and D. Pavlovic, A compositional logic for protocol correctness, in: Proceedings of 14th IEEE Computer Security Foundations Workshop (2001), pp. 241-255
30. Durgin N., Mitchell J.C., and Pavlovic D. A compositional logic for proving security properties of protocols. Journal of Computer Security 11 (2003) 677-721
31. Fábrega F.J.T., Herzog J.C., and Guttman J.D. Strand spaces: Why is a security protocol correct?. Proceedings of the 1998 IEEE Symposium on Security and Privacy (1998) 160-171
32. Gong L., Needham R., and Yahalom R. Reasoning About Belief in Cryptographic Protocols. In: Cooper D., and Lunt T. (Eds). Proceedings 1990 IEEE Symposium on Research in Security and Privacy (1990) 234-248
33. Gong L., and Syverson P. Fail-stop protocols: An approach to designing secure protocols. Dependable Computing for Critical Applications 5 (1998) 79-100
34. Guttman, J.D. and F.J.T. Fábrega, Protocol independence through disjoint encryption, in: Proceedings of 13th IEEE Computer Security Foundations Workshop (2000), pp. 24-34
35. Harel D., Kozen D., and Tiuryn J. Dynamic Logic. Foundations of Computing (2000), MIT Press
36. Harkins, D. and D. Carrel, The Internet Key Exchange (IKE) (1998), rFC 2409
37. He C., and Mitchell J.C. Security analysis and improvements for IEEE 802.11i. Proceedings of the Network and Distributed System Security Symposium. NDSS 2005 (2005)
38. He, C., M. Sundararajan, A. Datta, A. Derek and J.C. Mitchell, A modular correctness proof of IEEE 802.11i and TLS, in: CCS '05: Proceedings of the 12th ACM conference on Computer and communications security, 2005, pp. 2-15
39. Heintze N., and Tygar J.D. A model for secure protocols and their composition. IEEE Transactions on Software Engineering 22 (1996) 16-30
40. Hoare C.A.R. An axiomatic basis for computer programming. Communications of the ACM 12 (1969) 576-580
41. Hoare C.A.R. Communicating sequential processes. Commun. ACM 21 (1978) 666-677
42. Kelsey, J., B. Schneier and D. Wagner, Protocol interactions and the chosen protocol attack, in: Proceedings of the International Workshop on Security Protocols, 1997
43. Kohl, J. and B. Neuman, The Kerberos network authentication service (version 5), IETF RFC 1510 (1993)
44. Lincoln P.D., Mitchell J.C., Mitchell M., and Scedrov A. Probabilistic polynomial-time equivalence and security protocols. Formal Methods World Congress, vol. I. Lecture Notes in Computer Science 1708 (1999) 776-793
45. Lowe, G., Some new attacks upon security protocols, in: Proceedings of 9th IEEE Computer Security Foundations Workshop (1996), pp. 162-169
46. Lynch, N., I/O automata models and proofs for shared-key communication systems, in: Proceedings of 12th IEEE Computer Security Foundations Workshop (1999), pp. 14-29
47. Manna Z., and Pnueli A. Temporal Verification of Reactive Systems: Safety (1995), Springer-Verlag
48. Mantel, H., On the Composition of Secure Systems, in: Proceedings of the IEEE Symposium on Security and Privacy (2002), pp. 88-101
49. McCullough, D., Noninterference and the composability of security properties, in: Proceedings of the IEEE Symposium on Security and Privacy (1988), pp. 177-186
50. McCullough D. A hookup theorem for multilevel security. IEEE Transactions on Software Engineering 16 (1990) 563-568
51. McLean, J., Security models and information flow, in: Proceedings of the IEEE Symposium on Security and Privacy (1990)
52. McLean J. A general theory of composition for a class of "possibilistic" properties. IEEE Transactions on Software Engineering 22 (1996) 53-67
53. Meadows C. The NRL protocol analyzer: An overview. Journal of Logic Programming 26 (1996) 113-131
54. Meadows, C., Analysis of the Internet Key Exchange protocol using the NRL protocol analyzer, in: Proceedings of the IEEE Symposium on Security and Privacy (1998)
55. Meadows C. Open issues in formal methods for cryptographic protocol analysis. Proceedings of DISCEX 2000 (2000) 237-250
56. Meadows C., and Pavlovic D. Deriving, attacking and defending the GDOI protocol. Computer Security - ESORICS 2004, Proceedings. 9th European Symposium on Research Computer Security. Lecture Notes in Computer Science 3193 (2004) 53-72
57. Milner R. A Calculus of Communicating Systems (1982), Springer-Verlag
58. Misra J., and Chandy K.M. Proofs of networks of processes. IEEE Transactions on Software Engineering 7 (1981) 417-426
59. Mitchell, J., M. Mitchell and U. Stern, Automated analysis of cryptographic protocols using Murφ{symbol}, in: Proc. IEEE Symp. Security and Privacy, 1997, pp. 141-151
60. Mitchell, J.C., V. Shmatikov and U. Stern, Finite-state analysis of ssl 3.0, in: Proceedings of the Seventh USENIX Security Symposium, 1998, pp. 201-216
61. Needham R., and Schroeder M. Using encryption for authentication in large networks of computers. Communications of the ACM 21 (1978) 993-999
62. Nilsson N.J. Probabilistic logic. Artificial Intelligence 28 (1986) 71-87
63. Paulson, L., Mechanized proofs for a recursive authentication protocol, in: Proceedings of 10th IEEE Computer Security Foundations Workshop, 1997, pp. 84-95
64. Paulson, L., Proving properties of security protocols by induction, in: Proceedings of 10th IEEE Computer Security Foundations Workshop, 1997, pp. 70-83
65. Ramanathan A., Mitchell J.C., Scedrov A., and Teague V. Probabilistic bisimulation and equivalence for security analysis of network protocols. Foundations of Software Science and Computation Structures, Proceedings. 7th International Conference, FOSSACS 2004. Lecture Notes in Computer Science 2987 (2004) 468-483
66. Roscoe, A.W., Modelling and verifying key-exchange protocols using CSP and FDR, in: 8th IEEE Computer Security Foundations Workshop (1995), pp. 98-107
67. Roy, A., A. Datta, A. Derek and J.C. Mitchell, Inductive proof method for computational secrecy (2006), manuscript
68. Roy, A., A. Datta, A. Derek, J.C. Mitchell and J.-P. Seifert, Secrecy analysis in protocol composition logic. (2006), to appear in Proceedings of 11th Annual Asian Computing Science Conference, December 2006
69. Ryan P., Schneider S., Goldsmith M., Lowe G., and Roscoe B. Modelling and Analysis of Security Protocols (2001), Addison-Wesley
70. Schneider, S., Security properties and CSP, in: IEEE Symp. Security and Privacy, 1996
71. Schneider S. Verifying authentication protocols with csp. IEEE Transactions on Software Engineering (1998) 741-758
72. Song, D., Athena: a new efficient automatic checker for security protocol analysis, in: Proceedings of 12th IEEE Computer Security Foundations Workshop (1999), pp. 192-202
73. Syverson, P. and P. van Oorschot, On unifying some cryptographic protocol logics, in: Proceedings of 7th IEEE Computer Security Foundations Workshop, 1994, pp. 14-29
74. Thayer, F.J., J.C. Herzog and J.D. Guttman, Mixed strand spaces, in: Proceedings of 12th IEEE Computer Security Foundations Workshop (1999), pp. 72-82
75. "Verified by Visa" security program. Internet Resource. URL. https://usa.visa.com/personal/security/vbv/
76. Wagner, D. and B. Schneier, Analysis of the ssl 3.0 protocol, in: Proceedings of the 2nd USENIX Workshop on Electronic Commerce, 1996
77. Woo, T.Y.C. and S.C. Lam, A semantic model for authentication protocols, in: Proceedings IEEE Symposium on Research in Security and Privacy, 1993