Game analysis of abuse-free contract signing

Proceedings of the Computer Security Foundations Workshop

Volumn 2002-January, Issue , 2002, Pages 206-220

  Kremer, S ^a   Raskin, J F ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Computer security; Conferences; Electronic commerce; Electronic mail; Forward contracts; Logic; Protocols; Waste materials

Indexed keywords

ELECTRONIC COMMERCE; ELECTRONIC MAIL; FORMAL LOGIC; FORMAL VERIFICATION; NETWORK PROTOCOLS; SECURITY OF DATA; SECURITY SYSTEMS; WASTES;

ALTERNATING TIME TEMPORAL LOGIC; ALTERNATING TRANSITION SYSTEM; BALANCE PROPERTY; CONFERENCES; CONTRACT-SIGNING PROTOCOLS; FORWARD CONTRACT; LOGIC; VERIFICATION METHOD;

FORMAL METHODS;

EID: 84948779843     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2002.1021817     Document Type: Conference Paper

References (22)

1. R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 100-109. IEEE Computer Society Press, 1997.
2. R. Alur, T. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran. MOCHA: modularity in model checking. In A. Hu and M. Vardi, editors, CAV 98: Computer-aided Verification, Lecture Notes in Computer Science 1427, pages 521-525. Springer-Verlag, 1998.
3. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In T. Matsumoto, editor, 4th ACM Conference on Computer and Communications Security, pages 6, 8-17, Zurich, Switzerland, Apr. 1997. ACM Press.
4. N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 86-99, Oakland, CA, May 1998. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press.
5. C. Boyd and P. Kearney. Exploring fair exchange protocols using specification animation. In The Third International Workshop on Information Security - ISW2000, Lecture Notes in Computer Science, pages 209-223, Australia, Dec. 2000. Springer-Verlag.
6. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society of London, 426(1871):233-271, Dec. 1989.
7. R. Chadha, M. Kanovich, and A. Scedrov. Inductive methods and contract-signing protocols. In P. Samarati, editor, 8-th ACM Conference on Computer and Communications Security, pages 176-185. ACM Press, Nov. 2001.
8. S. Even and Y. Yacobi. Relations among public key signature systems. Technical Report 175, Technion, Haifa, Israel, Mar. 1980.
9. J. A. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. In Advances in Cryptology: Proceedings of Crypto'99, volume 1666 of Lecture Notes in Computer Science, pages 449-466. Springer-Verlag, 1999.
10. T. Henzinger, R. Manjumdar, F. Mang, and J.-F. Raskin. Abstract interpretation of game properties. In SAS 2000: Intertional Symposium on Static Analysis, Lecture Notes in Computer Science, pages 220-239. Springer-Verlag, 2000.
11. S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. Larsen and M. Nielsen, editors, Concurrency Theory - Concur 2001, volume 2154 of Lecture Notes in Computer Science, pages 551-565, Aalborg, Denmark, Aug. 2001. Springer-Verlag.
12. G. Lowe. An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters, 56(3):131-133, Nov. 1995.
13. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Lecture Notes in Computer Science, 1055:147-157, 1996.
14. C. A. Meadows. Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches. Lecture Notes in Computer Science, 1146:351-365, 1996.
15. S. Micali. Certified E-mail with invisible post offices. Available from author; an invited presentation at the RSA '97 conference, 1997.
16. L. C. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th Computer Security Foundations Workshop, pages 70-83. IEEE Computer Society Press, June 1997.
17. S. Schneider. Formal analysis of a non-repudiation protocol. In Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW '98), pages 54-65, Washington - Brussels - Tokyo, June 1998. IEEE.
18. V. Shmatikov and J. Mitchell. Analysis of a fair exchange protocol. In Symposium on Network and Distributed Systems Security (NDSS '00), pages 119-128, San Diego, CA, Feb. 2000. Internet Society.
19. V. Shmatikov and J. Mitchell. Analysis of abuse-free contract signing. In Financial Cryptography '00, volume 1962 of Lecture Notes in Computer Science, pages 174-191, Anguilla, British West Indies, Feb. 2000. Springer-Verlag.
20. V. Shmatikov and J. Mitchell. Finite-state analysis of two contract signing protocols. Special issue of Theoretical Computer Science on security, 2001.
21. J. Zhou and D. Gollmann. Towards verification of non-repudiation protocols. In Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, pages 370-380, Canberra, Australia, Sept. 1998. Springer.
22. Y. Zhou and D. Gollmann. An efficient non-repudiation protocol. In Proceedings of The 10th Computer Security Foundations Workshop, pages 126-132. IEEE Computer Society Press, 1997.