Formal prototyping in early stages of protocol design

Proceedings of the 2005 Workshop on Issues in the Theory of Security, WITS '05

Volumn , Issue , 2005, Pages 67-80

  Goodloe, Alwyn ^a   Gunter, Carl A ^b   Stehr, Mark Oliver ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN ITERATION; EXECUTABLE SPECIFICATIONS; PROTOCOL DESIGN; PROTOTYPE IMPLEMENTATIONS; PROTOTYPING; SECURITY ASSOCIATION; SECURITY PROTOCOLS; SIMULATION-BASED; SUCCESSIVE ITERATION;

DESIGN; FORMAL LOGIC; FORMAL METHODS; NETWORK SECURITY; SOFTWARE PROTOTYPING; THEOREM PROVING;

NETWORK PROTOCOLS;

EID: 77953980529     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1045405.1045413     Document Type: Conference Paper

References (31)

1. M. Abadi, B. Blanchet, and C. Fournet. Just Fast Keying in the Pi Calculus. In D. Schmidt, editor, The European Symposium on Programming (ESOP), Lecture Notes inComputer Science 2618. Springer-Verlag, 2004.
2. M. Abadi and A. Gordan. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1):1-70, 1999.
3. W. Aiello, S. Bellovin, M. Blaze, R. Caetti, J. Ioannidis, A. Keromytis, and O. Reingold. Just Fast Keying: Key Aggrement in a Hostile Internet. ACM Transactions of Information System Security, 7(2):242-273, 2004.
4. K. Bhargavan, C. A. Gunter, M. Kim, I. Lee, D. Obradovic, O. Sokolsky, and M. Viswanathan. Verisim: Formal analysis of network simulations. In M. J. Harrold, editor, ISSTA 00 Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis, pages 2-13, Portland, OR, August 2000. ACM.
5. K. Bhargavan, C. A. Gunter, M. Kim, I. Lee, D. Obradovic, O. Sokolsky, and M. Viswanathan. Verisim: Formal analysis of network simulations. IEEE Transactions on Software Engineering, 28(2):129-145, February 2002.
6. K. Bhargavan, C. A. Gunter, and D. Obradovic. Routing information protocol in HOL/SPIN. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 53-72, Portland, Oregon, August 2000. Springer-Verlag.
7. K. Bhargavan, D. Obradovic, and C. A. Gunter. Formal verification of standards for distance vector routing protocols. Journal of the ACM, 49(4):538-576, July 2002.
8. B. Blanchet. From Secrecy to Authencity in Security Protocols. In 9th International Static Analysis Symposium (SAS'02), Lecture Notes In Computer Science 2477, pages 342-359. Springer-Verlag, 2002.
9. B. Blanchet. Automatic Proof of Strong Secrecy for Security Protocols. In IEEE Symposium on Security and Privacy, pages 86-100, 2004.
10. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and Proof in Membership Equational Logic. Theoretical Computer Science, 236:35-132, 2000.
11. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
12. E. Clark, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
13. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. A Tutorial on Maude. http://maude.csl.sri.com, March 2000.
14. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187-243, 2002.
15. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual. June 2003, http://maude.cs.uiuc. edu.
16. G. Denker, J. Meseguer, and C.Talctt. Protocol Specification and Analysis in Maude. In Proc. of Workshop on Formal Methods and Security Protocols, 1998.
17. S. Gutierrez-Nolasco, N. Venkatasubramanian, M. Stehr, and C. Talcott. Exploring Adaptability of Secure Group Communication. University of California Technical Report, 2004.
18. T. Hiller, P. Walsh, X. Chen, M. Munson, G. Dommety, S. Sivalingham, B. Lim, P. McCann, H. Shiino, B. Hirschman, S. Manning, R. Hsu, R. Hsu, M. Lipford, P. Calhoun, C. Lo, E. Jaques, E. Campbell, Y. Xu, S. Baba, T. Ayaki, T. Seki, and A. Hammed. CDMA2000 Wireless Data Reqirements for AAA. RFC 3141, IETF, 2001.
19. G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
20. C. Kaufman. Internet Key Exchange(IKE V2) Protocol. RFC 2407, IETF, 2004.
21. S. Kent and R. Atkinson. Security Architecture for the Internet Protocol. RFC 2401, IETF, 1998.
22. M. Koutsopoulou, A. Kaloxylos, A. Alonistioti, L. Merakos, and K. Kawamura. Charging, Accounting, and Biling Management Schemes in Mobile Telecommuncations Networks and the Internet. IEEE Communications Surveys, 6(1), 2004.
23. G. Lowe. An Attack on the Needham-Schroeder Public-Key Auntentication Protocol. Information Processing Letters, 56(3):131-133, 1995.
24. K. McMillan. The SMV Manual. November 2000, http://www-2.cs.cmu.edu/ ~modelcheck/smv.html.
25. C. Meadows. The NRL Protocol Analyzer: An Overview. Journal of Logic Programming, 1994.
26. A. J. Menezs, P. C. van Oorchot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
27. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73-155, 1992.
28. L. Paulson. The Inductive Approach to Verifying Cryptographic Protocols. J. Computer Security, 6:85-128, 1998.
29. L. Paulson. Inductive Analysis of the Internet Protocol TLS. ACM Transactions on Computer and System Security, 2(3):332-351, 1999.
30. C. Rigney. RADIUS Accounting. RFC 2866, IETF, 2000.
31. P. Ryan and S. Schneider. Modeling and Analysis of Security Protocols. Addison-Wesley, 2001.