On the relationships between models in protocol verification

Information and Computation

Volumn 206, Issue 2-4, 2008, Pages 291-311

  Mödersheim, Sebastian ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Abstraction; Formal verification; Security protocols

Indexed keywords

ABSTRACTING; APPROXIMATION THEORY; AUTHENTICATION; MATHEMATICAL MODELS; VERIFICATION;

FORMAL VERIFICATION; PAULSON'S APPROACH; SECURITY PROTOCOLS;

NETWORK PROTOCOLS;

EID: 40149098057     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.07.006     Document Type: Article

References (30)

1. A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò, L. Vigneron, The AVISPA tool for the automated validation of internet security protocols and applications, in: CAV'05, 2005, pp. 281-285.
2. G. Denker, J. Millen, CAPSL intermediate language, in: Formal Methods and Security Protocols, 1999, pp. 1-10.
3. Meseguer J., and Thati P. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Journal of Higher-Order and Symbolic Computation 20 1-2 (2005) 123-160
4. Paulson L.C. The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6 1 (1998) 85-128
5. Cervesato I., Durgin N., Lincoln P.D., Mitchell J.C., and Scedrov A. A comparison between strand spaces and multiset rewriting for security protocol analysis. Proceedings of ISSS 2002. LNCS 2609 (2003), Springer-Verlag 356-383
6. Abadi M., and Blanchet B. Analyzing security protocols with secrecy types and logic programs. Journal of the ACM 52 1 (2005) 102-146
7. Cortier V. Security properties: two agents are sufficient. Proceedings of ESOP'2003. LNCS 2618 (2003), Springer-Verlag 99-113
8. Blanchet B. An efficient cryptographic protocol verifier based on prolog rules. CSFW'01 (2001), IEEE Computer Society Press 82-96
9. Y. Boichut, P.-C. Héam, O. Kouchnarenko, F. Oehl, Improvements on the Genet and Klay technique to automatically verify security protocols, in: Automated Verification of Infinite-State Systems (AVIS'04), 2004, pp. 1-11.
10. Bozga L., Lakhnech Y., and Perin M. Pattern-based abstraction for verifying secrecy in protocols. International Journal on Software Tools for Technology Transfer 8 1 (2006) 57-76
11. Broadfoot P., Lowe G., and Roscoe A. Automating data independence. Esorics 2000. LNCS 1895 (2000), Springer-Verlag 175-190
12. Y. Chevalier, L. Vigneron, Automated unbounded verification of security protocols, in: CAV'02, LNCS 2404, 2002, pp. 324-337.
13. Genet T., and Klay F. Rewriting for cryptographic protocol verification. CADE'00. LNCS 1831 (2000), Springer-Verlag 271-290
14. C. Weidenbach, Towards an automatic analysis of security protocols, in: CADE'99, LNCS 1632, Berlin, 1999, pp. 378-382.
15. Blanchet B. Security protocols: from linear to classical logic by abstract interpretation. Information Processing Letters 95 5 (2005) 473-479
16. Oehl F., Gécé G., Kouchnarenko O., and Sinclair D. Automatic approximation for the verification of cryptographic protocols. Formal Aspects of Security (FASec'02). LNCS 2629 (2002), Springer-Verlag 33-48
17. Dolev D., and Yao A. On the security of public-key protocols. IEEE Transactions on Information Theory 2 29 (1983) 198-207
18. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press
19. P. Aczel, An introduction to inductive definitions, in: Handbook of Mathematical Logic, 1977, pp. 739-782.
20. Bella G., Massacci F., and Paulson L.C. Verifying the set registration protocols. IEEE Journal on Selected Areas in Communications 21 1 (2003) 77-87
21. Millen J.K., and Shmatikov V. Constraint solving for bounded-process cryptographic protocol analysis. CCS'01 (2001), ACM Press 166-175
22. G. Lowe, A hierarchy of authentication specifications, in: CSFW'97, 1997, pp. 31-43.
23. N. Asokan, V. Shoup, M. Waidner, Asynchronous protocols for optimistic fair exchange, in: Proceedings of the IEEE Symposium on Research in Security and Privacy, 1998, pp. 86-99.
24. P. Hankes Drielsma, S. Mödersheim, The ASW protocol revisited: a unified view, in: ARSPA 2004, 2005, pp. 141-156.
25. Cousot P. Abstract interpretation. Symposium on Models of Programming Languages and Computation, ACM Computing Surveys 28 2 (1996) 324-328
26. J. Heather, S. Schneider, Towards automatic verification of authentication protocols on an unbounded network, in: CSFW 2000, 2000, pp. 132-143.
27. Cremers C.J.F., Mauw S., and de Vink E.P. Injective synchronisation: an extension of the authentication hierarchy. Theoretical Computer Science 367 1 (2006) 139-161
28. Syverson P., and Meadows C. A formal language for cryptographic protocol requirements. Special issue of Designs. Codes and Cryptography 7 1-2 (1996) 27-59
29. Woo T., and Lam S. A lesson on authenticated protocol design. Operating Systems Review 28 (1997) 24-37
30. Clarke E., Fehnker A., Han Z., Krogh B., Ouaknine J., Stursberg O., and Theobald M. Abstraction and counterexample-guided refinement in model checking of hybrid systems. International Journal of Foundations of Computer Science 14 4 (2003) 583-604