An intruder model for verifying liveness in security protocols

Proceedings of the Fourth ACM Workshop on Formal Methods in Security Engineering, FMSE'06. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06

Volumn , Issue , 2006, Pages 23-32

  Cederquist, Jan ^a   Dashti, Mohammad Torabi ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Dolev Yao intruder; Intruder models; Liveness properties; Security protocols

Indexed keywords

BOOLEAN ALGEBRA; MATHEMATICAL MODELS; NETWORK PROTOCOLS; TIME DELAY;

DOLEV-YAO INTRUDER; INTRUDER MODELS; LIVENESS PROPERTIES; SECURITY PROTOCOLS;

NETWORK SECURITY;

EID: 34547372939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180337.1180340     Document Type: Article

References (37)

1. M. Abadi and B. Blanchet. Computer-assisted verification of a protocol for certified email. In SAS '03, volume 2694 of LNCS, pages 316-335, 2003.
2. M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Trans. Software Eng., 22(1):6-15, 1996.
3. B. Alpern and F. Schneider. Defining liveness. Technical Report TR 85-650, Dept. of Computer Science, Cornell University, October 1984.
4. N. Asokan. Fairness in electronic commerce. PhD thesis, Univ. Waterloo, 1998.
5. N. Asokan and P. Ginzboorg. Key agreement in ad hoc networks. Computer Communications, 23(17):1627-1637, 2000.
6. N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In IEEE Symp. on Security and Privacy. IEEE CS, 1998.
7. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE J. Selected Areas in Communications, 18(4):593-610, 2000.
8. A. Basu, B. Charron-Bost, and S. Toueg. Simulating reliable links with unreliable links in the presence of process crashes. In WDAG '96, volume 1151 of LNCS, pages 105-122. Springer, 1996.
9. G. Bella and L. C. Paulson. Mechanical proofs about a non-repudiation protocol. In TPHOL'01, volume 2152 of LNCS, pages 91-104. Springer, 2001.
10. J. Bergstra and J. Klop. Algebra of communicating processes with abstraction. Theor. Comput. Sci., 37:77-121, 1985.
11. J. Cederquist, R. Corin, and M. Torabi Dashti. On the quest for impartiality: Design and analysis of a fair non-repudiation protocol. In ICICS'05, volume 3783 of LNCS, pages 27 - 39. Springer, 2005.
12. J. Cederquist and M. Dashti. Formal analysis of a fair payment protocol. In Formal Aspect of Security and Trust, volume 173 of IFIP, pages 41-54. Springer, 2004.
13. I. Cervesato. The Dolev-Yao intruder is the most powerful attacker. In LICS'01. IEEE Computer Society Press, 16-19 June 2001.
14. Y. Chevalier and L. Vigneron. Automated unbounded verification of security protocols. In CAV '02, volume 2404 of LNCS, pages 324-337. Springer, 2002.
15. H. Comon and V. Shmatikov. Is it possible to decide whether a cryptographic protocol is secure or not? J. of Telecommunications and Information Technology, 4:3-13, 2002.
16. D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans, on Information Theory, IT-29(2):198-208, 1983.
17. E. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of theoretical computer science (vol. B): formal models and semantics, pages 995-1072. MIT Press, 1990.
18. E. Emerson and C-L. Lei. Temporal reasoning under generalized fairness constraints. In STACS '86, pages 21-36. Springer-Verlag, 1985.
19. R. Engelschall. URL rewriting engine. Apache HTTP Server Version 1.3.
20. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, 1985.
21. N. Francez. Fairness. Springer, 1986.
22. J. F. Groóte and A. Ponse. The syntax and semantics of μCRL. In Algebra of Communicating Processes, Workshops in Computing Series, pages 26-62. Springer, 1995.
23. S. Gürgens, C. Rudolph, and H. Vogt. On the security of fair non-repudiation protocols. In ISC '03, volume 2851 of LNCS, pages 193-207, 2003.
24. J. Heather, G. Lowe, and S. Schneider. How to prevent type flaw attacks on security protocols. J. Computer Security, 11(2):217-244, 2003.
25. C. A. R. Hoare. Communicating sequential processes. Commun. ACM, 21(8):666-677, 1978.
26. D. Kahler and R. Küsters. Constraint solving for contract-signing protocols. In CONCUR '05, volume 3653 of LNCS, pages 233-247. Springer, 2005.
27. S. Kremer, O. Markowitch, and J. Zhou. An intensive survey of non-repudiation protocols. Computer Communications, 25(17):1606-1621, November 2002.
28. S. Kremer and J. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In CONCUR '01, volume 2154 of LNCS, pages 551-565. Springer, 2001.
29. R. Mateescu and M. Sighireanu. Efficient on-the-fly model-checking for regular alternation-free mu-calculus. Sei. Comput. Program., 46(3):255-281, 2003.
30. C. Meadows. Formal methods for cryptographic protocol analysis: Emerging issues and trends. IEEE J. Selected Areas in Communication, 21(2):44-54, 2003.
31. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. J. ACM, 42(2):458-487, 1995.
32. L. Paulson. The inductive approach to verifying cryptographic protocols. J. Computer Security, 6(1-2):85-128, 1998.
33. A. Pnueli. a temporal logic of concurrent programs. Theor. Comput. Sci., 13:45 - 60, 1981.
34. V. Shmatikov and J. Mitchell. Finite-state analysis of two contract signing protocols. Theor. Comput. Sci., 283(2):419-450, 2002.
35. H. Vogt. Asynchronous optimistic fair exchange based on revocable items. In Financial Cryptography, volume 2742 of LNCS, pages 208-222. Springer, 2003.
36. H. Vogt, H. Pagnia, and F. Gärtner. Using smart cards for fair exchange. In WELCOM '01, volume 2232 of LNCS, pages 101-113. Springer, 2001.
37. J. Zhou, R. Deng, and F. Bao. Evolution of fair non-repudiation with TTP. In ACISP '99, volume 1587 of LNCS, pages 258-269. Springer, 1999.