{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T14:42:33Z","timestamp":1745678553931},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611868"},{"type":"electronic","value":"9783540683391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_11","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"119-130","source":"Crossref","is-referenced-by-count":7,"title":["Equivocable Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-47555-9_24","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 92 Proceedings","author":"D. Beaver","year":"1993","unstructured":"D. Beaver. \u201cHow to Break a\u2019 secure\u2019 Oblivious Transfer Protocol.\u201d Advances in Cryptology \u2014 Eurocrypt\u2019 92 Proceedings, Springer-Verlag LNCS 658, 1993, 285\u2013296."},{"unstructured":"D. Beaver. \u201cAdaptively Secure Encryption.\u201d Penn State Univ. Tech Report PSU-CSE-96-031, February 7, 1996.","key":"11_CR2"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 92 Proceedings","author":"D. Beaver","year":"1993","unstructured":"D. Beaver, S. Haber. \u201cCryptographic Protocols Provably Secure Against Dynamic Adversaries.\u201d Advances in Cryptology \u2014 Eurocrypt\u2019 92 Proceedings, Springer-Verlag LNCS 658, 1993, 307\u2013323."},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 89 Proceedings","author":"M. Bellare","year":"1990","unstructured":"M. Bellare, S. Micali. \u201cNon-Interactive Oblivious Transfer and Applications.\u201d Advances in Cryptology \u2014 Crypto\u2019 89 Proceedings, Springer-Verlag LNCS 435, 1990, 547\u2013557."},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","first-page":"234","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 86 Proceedings","author":"G. Brassard","year":"1987","unstructured":"G. Brassard, C. Cr\u00e9peau, J. Robert. \u201cAll or Nothing Disclosure of Secrets.\u201d Advances in Cryptology \u2014 Crypto\u2019 86 Proceedings, Springer-Verlag LNCS 263, 1987, 234\u2013238."},{"doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, J. Robert. \u201cInformation Theoretic Reductions among Disclosure Problems.\u201d Proceedings of the 27 th FOCS, IEEE, 1986, 168\u2013173.","key":"11_CR6","DOI":"10.1109\/SFCS.1986.26"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau. \u201cMinimum Disclosure Proofs of Knowledge.\u201d J. Comput. Systems Sci. 37, 1988, 156\u2013189.","journal-title":"J. Comput. Systems Sci."},{"doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor. \u201cAdaptively Secure Multiparty Computation.\u201d To appear, Proceedings of the 28 th STOC, ACM, 1996.","key":"11_CR8","DOI":"10.1145\/237814.238015"},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 87 Proceedings","author":"C. Cr\u00e9peau","year":"1988","unstructured":"C. Cr\u00e9peau. \u201cEquivalence Between Two Flavours of Oblivious Transfers.\u201d Advances in Cryptology \u2014 Crypto\u2019 87 Proceedings, Springer-Verlag LNCS 293, 1988, 350\u2013354."},{"key":"11_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-46877-3_4","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 91 Proceedings","author":"B. Boer den","year":"1991","unstructured":"B. den Boer. \u201cOblivious Transfer Protecting Secrecy.\u201d Advances in Cryptology \u2014 Eurocrypt\u2019 91 Proceedings, Springer-Verlag LNCS 547, 1991, 31\u201345."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M. Hellman. \u201cNew Directions in Cryptography.\u201d IEEE Transactions on Information Theory IT-22, November 1976, 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel. \u201cA Randomized Protocol for Signing Contracts.\u201d Comm. of the ACM 28:6, 1985, 637\u2013647. (Early version: Proceedings of Crypto 1982, Springer-Verlag, 1983, 205\u2013210.)","journal-title":"Comm. of the ACM"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali. \u201cProbabilistic Encryption.\u201d J. Comput. Systems Sci. 28, 1984, 270\u2013299.","journal-title":"J. Comput. Systems Sci."},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff. \u201cThe Knowledge Complexity of Interactive Proof Systems.\u201d SIAM J. on Computing 18:1, 1989, 186\u2013208.","journal-title":"SIAM J. on Computing"},{"issue":"10","key":"11_CR15","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1049\/el:19900416","volume":"26","author":"L. Harn","year":"1990","unstructured":"L. Harn, H. Lin. \u201cNoninteractive Oblivious Transfer.\u201d Electronics Letters 26:10, May 1990, 635\u2013636.","journal-title":"Electronics Letters"},{"doi-asserted-by":"crossref","unstructured":"J. Kilian, S. Micali, R. Ostrovsky. \u201cMinimum Resource Zero-Knowledge Proofs.\u201d Proceedings of the 30 th FOCS, IEEE, 1989, 1989, 474\u2013479.","key":"11_CR16","DOI":"10.1109\/SFCS.1989.63521"},{"unstructured":"M.O. Rabin. \u201cHow to Exchange Secrets by Oblivious Transfer.\u201d TR-81, Harvard, 1981.","key":"11_CR17"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, L. Adleman. \u201cA Method for Obtaining Digital Signatures and Public Key Cryptosystems.\u201d Communications of the ACM 21:2, 1978, 120\u2013126.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:33:00Z","timestamp":1556739180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}