{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:37:42Z","timestamp":1774892262351,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645184","type":"print"},{"value":"9783540697954","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054156","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T05:13:04Z","timestamp":1153977184000},"page":"591-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":197,"title":["Optimistic fair exchange of digital signatures"],"prefix":"10.1007","author":[{"given":"N.","family":"Asokan","sequence":"first","affiliation":[]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Waidner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In 4th ACM Conference on Computer and Communication Security, pages 6\u201317, 1997.","DOI":"10.1145\/266420.266426"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of dig-ital signatures. IBM Research Report RZ 2973, available on-line at www.cs.wisc.edu\/~shoup, 1997.","DOI":"10.1007\/BFb0054156"},{"key":"44_CR3","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proc. IEEE Symp. on Research in Security and Privacy, 1998. Available on-line at www.cs.wisc.edu\/~shoup."},{"key":"44_CR4","unstructured":"M. Bellare and S. Goldwasser. Encapsulated key escrow. Preprint, 1996."},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for design-ing efficient protocols. In First ACM Conference on Computer and Communica-tions Security, 1993.","DOI":"10.1145\/168588.168596"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology\u2014Crypto '94, pages 92\u2013111, 1994.","DOI":"10.1007\/BFb0053428"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"S. Brands. Untraceable off-line cash in wallets with observers. In Advances in Cryptology-Crypto '93, pages 302\u2013318, 1993.","DOI":"10.1007\/3-540-48329-2_26"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/0167-4048(90)90114-9","volume":"9","author":"H. B\u00fcrk","year":"1990","unstructured":"H. B\u00fcrk and A. Pfitzmann. Value exchange systems enabling security and unob-servability. Computers and Security, 9:715\u2013721, 1990.","journal-title":"Computers and Security"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum and T. Pederson. Wallet databases with observers. In Advances in Cryptology-Crypto '92, pages 89\u2013105, 1992.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"44_CR10","unstructured":"B. Cox, J. D. Tygar, and M. Sirbu. NetBill security and transaction protocol. In First USENIX Workshop on Electronic Commerce, pages 77\u201388, 1995."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"R. H. Deng, L. Gong, A. A. Lazar, and W. Wang. Practical protocols for certified electronic mail. J. of Network and Systems Management, 4(3), 1996.","DOI":"10.1007\/BF02139147"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology\u2014Crypto '86, pages 186\u2013194, 1986.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"M. K. Franklin and M. K. Reiter. Verifiable signature sharing. In Advances in Cryptology-Eurocrypt '95, pages 50\u201363, 1995.","DOI":"10.1007\/3-540-49264-X_5"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"M. K. Franklin and M. K. Reiter. Fair exchange with a semi-trusted third party. In 4th ACM Conference on Computer and Communications Security, pages 1\u20135, 1997.","DOI":"10.1145\/266420.266424"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"L. Guillou and J. Quisquater. A \u201cparadoxical\u201d identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology-Crypto '88, pages 216\u2013231, 1988.","DOI":"10.1007\/0-387-34799-2_16"},{"key":"44_CR16","unstructured":"D. W. Kravitz. Digital signature algorithm, 1993. U. S. Patent No. 5,231,668."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-Crypto '94, pages 95\u2013107, 1994.","DOI":"10.1007\/3-540-48658-5_11"},{"key":"44_CR18","unstructured":"S. Micali. Certified e-mail with invisible post offices. Unpublished manuscript, 1997 (presented at the 1997 RSA Security Conference)."},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"H. Ong and C. Schnorr. Fast signature generation with a Fiat Shamir-like scheme. In Advances in Cryptology-Eurocrypt '90, pages 432\u2013440, 1990.","DOI":"10.1007\/3-540-46877-3_38"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology-Crypto '91, pages 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, pages 120\u2013126, 1978.","DOI":"10.1145\/359340.359342"},{"key":"44_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"C. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4:161\u2013174, 1991.","journal-title":"J. Cryptology"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-Eurocrypt '97, 1997.","DOI":"10.1007\/3-540-69053-0_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:44:45Z","timestamp":1578494685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054156"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0054156","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}