{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:08:11Z","timestamp":1772021291402,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424970","type":"print"},{"value":"9783540446859","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44685-0_37","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:16:21Z","timestamp":1186726581000},"page":"551-565","source":"Crossref","is-referenced-by-count":38,"title":["A Game-Based Verification of Non-repudiation and Fair Exchange Protocols"],"prefix":"10.1007","author":[{"given":"Steve","family":"Kremer","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,22]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013109. IEEE Computer Society Press, 1997.","DOI":"10.1109\/SFCS.1997.646098"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"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\u201317, Zurich, Switzerland, Apr. 1997. ACM Press.","DOI":"10.1145\/266420.266426"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"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\u201399, Oakland, CA, May 1998. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press.","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"37_CR4","series-title":"Lect Notes Comput Sci","volume-title":"The Third International Workshop on Information Security-ISW2000","author":"C. Boyd","year":"2000","unstructured":"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, Australia, Dec. 2000. Springer-Verlag."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"M. Burrows, M. Abadi, and R. Needham. A logic of authentication, from proceedings of the royal society, volume 426, number 1871, 1989. In William Stallings, Practical Cryptography for Data Internetworks, IEEE Computer Society Press, 1996. 1996.","DOI":"10.1098\/rspa.1989.0125"},{"key":"37_CR6","series-title":"Lect Notes Comput Sci","volume-title":"SAS 2000: Intertional Symposium on Static Analysis","author":"T. Henzinger","year":"2000","unstructured":"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. Springer-Verlag, 2000."},{"key":"37_CR7","first-page":"139","volume-title":"21th Symp. on Information Theory in the Benelux","author":"S. Kremer","year":"2000","unstructured":"S. Kremer and O. Markowitch. Optimistic non-repudiable information exchange. In J. Biemond, editor, 21th Symp. on Information Theory in the Benelux, pages 139\u2013146. Werkgemeenschap Informatieen Communicatietheorie, Enschede, may 2000."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. Technical Report 451, ULB, 2001.","DOI":"10.1007\/3-540-44685-0_37"},{"key":"37_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Lecture Notes in Computer Science, 1055:147\u2013157, 1996."},{"key":"37_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of The 3rd International Conference on Information Security and Cryptology (ICISC 2000)","author":"O. Markowitch","year":"2000","unstructured":"O. Markowitch and S. Kremer. A multi-party optimistic non-repudiation protocol. In D. Won, editor, Proceedings of The 3rd International Conference on Information Security and Cryptology (ICISC 2000), volume 2015 of Lecture Notes in Computer Science, Seoul, Korea, 2000. Springer-Verlag."},{"key":"37_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-61770-1_46","volume-title":"Computer Security \u2014 ESORICS 96","author":"C. A. Meadows","year":"1996","unstructured":"C. A. Meadows. Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches. Lecture Notes in Computer Science, 1146:351\u2013365, 1996."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"L. C. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th Computer Security Foundations Workshop, pages 70\u201383. IEEE Computer Society Press, June 1997.","DOI":"10.1109\/CSFW.1997.596788"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"S. Schneider. Formal analysis of a non-repudiation protocol. In Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW\u2019 98), pages 54\u201365, Washington-Brussels-Tokyo, June 1998. IEEE.","DOI":"10.1109\/CSFW.1998.683155"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"V. Shmatikov and J. Mitchell. Analysis of abuse-free contract signing. In Financial Cryptography\u2019 00, Anguilla, 2000.","DOI":"10.1007\/3-540-45472-1_13"},{"key":"37_CR15","unstructured":"J. Zhou and D. Gollmann. Towards verification of non-repudiation protocols. In Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, pages 370\u2013380, Canberra, Australia, Sept. 1998. Springer."},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Y. Zhou and D. Gollmann. An efficient non-repudiation protocol. In PCSFW: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.","DOI":"10.1109\/CSFW.1997.596801"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2001 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44685-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:47Z","timestamp":1556734307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44685-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424970","9783540446859"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44685-0_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}