{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:40Z","timestamp":1725493540048},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_73","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"898-911","source":"Crossref","is-referenced-by-count":20,"title":["Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds"],"prefix":"10.1007","author":[{"given":"Birgit","family":"Baum-Waidner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"B. Baum-Waidner: Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds (long version including the detailed proofs); IACR Cryptology ePrint Archive 2001, May 2001, http:\/\/www.\/\/eprint.iacr.org\/","DOI":"10.1007\/3-540-48224-5_73"},{"key":"73_CR2","unstructured":"N. Asokan, B. Baum-Waidner, M. Schunter, M. Waidner: Optimistic Synchronous Multi-Party Contract Signing; IBM Research Report RZ 3089 (#93135), Z\u00fcrich, December 1998."},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, M. Waidner: Optimistic Protocols for Multi-Party Fair Exchange; IBM Research Report RZ 2892, Z\u00fcrich, November 1996.","DOI":"10.1145\/266420.266426"},{"key":"73_CR4","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, M. Waidner: Optimistic Protocols for Fair Exchange; 4th ACM Conf. on Computer and Communications Security, Z\u00fcrich, April 1997, 6\u201317.","DOI":"10.1145\/266420.266426"},{"key":"73_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"Eurocrypt\u2019 98","author":"N. Asokan","year":"1998","unstructured":"N. Asokan. V. Shoup, M. Waidner: Optimistic Fair Exchange of Digital Signatures; Eurocrypt\u2019 98, LNCS 1403, Springer-Verlag, Berlin 1998, 591\u2013606."},{"key":"73_CR6","unstructured":"B. Baum-Waidner, M. Waidner: Asynchronous Optimistic Multi-Party Contract Signing; IBM Research Report RZ3078 (#93124), Z\u00fcrich, November 1998."},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"B. Baum-Waidner, M. Waidner: Round-optimal and Abuse-free Optimistic Multi-Party Contract Signing; ICALP 2000, June 00, Geneve.","DOI":"10.1007\/3-540-45022-X_44"},{"issue":"\/1","key":"73_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"M. Ben-Or, O. Goldreich, S. Micali, R. L. Rivest: A Fair Protocol for Signing Contracts; IEEE Transactions on Information Theory 36\/1 (1990) 40\u201346.","journal-title":"IEEE Transactions on Information Theory"},{"key":"73_CR9","volume-title":"Three Applications of the Oblivious Transfer","author":"M. Blum","year":"1981","unstructured":"M. Blum: Three Applications of the Oblivious Transfer; Department of Electrical Engineering and Computer Sciences, University of California at Berkley, September 18, 1981."},{"key":"73_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Crypto\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, V. Shoup: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack; Crypto\u2019 98, LNCS 1462, Springer-Verlag, Berlin 1998, 13\u201325."},{"key":"73_CR11","first-page":"542","volume-title":"23rd Symposium on Theory of Computing (STOC) 1991","author":"D. Dolev","year":"1991","unstructured":"D. Dolev, C. Dwork, M. Naor: Non-Malleable Cryptography; 23rd Symposium on Theory of Computing (STOC) 1991, ACM, New York 1991, 542\u2013552."},{"key":"73_CR12","series-title":"Technical Report","volume-title":"Relations Among Public Key Signature Systems","author":"S. Even","year":"1980","unstructured":"S. Even, Y. Yacobi: Relations Among Public Key Signature Systems; Technical Report Nr. 175, Computer Science Department, Technion, Haifa, Israel, 1980."},{"key":"73_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-48405-1_29","volume-title":"Crypto\u2019 99","author":"J. Garay","year":"1999","unstructured":"J. Garay, M. Jakobsson, P. MacKenzie: Abuse-free Optimistic Contract Signing; Crypto\u2019 99, LNCS 1666, Springer-Verlag, Berlin 1999, 449\u2013466."},{"key":"73_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-48169-9_11","volume-title":"Intern. Symp. on Distr. Comput. (DISC\u2019 99)","author":"J. Garay","year":"1999","unstructured":"J. Garay, P. MacKenzie: Abuse-free Multi-party Contract Signing; Intern. Symp. on Distr. Comput. (DISC\u2019 99), LNCS 1693, Springer-Verlag, Berlin 1999, 151\u2013165."},{"issue":"\/2","key":"73_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks; SIAM J. Comput. 17\/2 (1988) 281\u2013308.","journal-title":"SIAM J. Comput."},{"key":"73_CR16","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"A. Menezes, P. van Oorschot, S. Vanstone: Handbook of Applied Cryptography; CRC Press, Boca Raton 1997."},{"key":"73_CR17","unstructured":"S. Micali: Certified E-Mail with Invisible Post Offices; 1997 RSA Conference."},{"key":"73_CR18","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, M. Schunter, M. Waidner: Optimal Efficiency of Optimistic Contract Signing; ACM PODC\u2019 98, Puerto Vallarta 1998, 113\u2013122.","DOI":"10.1145\/277697.277717"},{"key":"73_CR19","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27\/","author":"M. Rabin","year":"1983","unstructured":"M. Rabin: Transaction Protection by Beacons; Journal of Computer and System Sciences 27\/ (1983) 256\u2013267.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:28:09Z","timestamp":1556922489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_73","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}