{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:05:32Z","timestamp":1742385932494},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_24","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T19:23:49Z","timestamp":1186601029000},"page":"285-296","source":"Crossref","is-referenced-by-count":12,"title":["How to Break a \u201cSecure\u201d Oblivious Transfer Protocol"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Security, Fault Tolerance, and Communication Complexity in Distributed Systems","author":"D. Beaver","year":"1990","unstructured":"D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. PhD Thesis, Harvard University, Cambridge, 1990."},{"key":"24_CR2","unstructured":"D. Beaver. \u201cFormal Definitions for Secure Distributed Protocols.\u201d Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.)."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver. \u201cFoundations of Secure Interactive Computing.\u201d Proceedings of Crypto 1991, 377\u2013391.","DOI":"10.1007\/3-540-46766-1_31"},{"key":"24_CR4","unstructured":"D. Beaver. \u201cThe Security of Protocols Executed in Parallel.\u201d In preparation."},{"key":"24_CR5","unstructured":"D. Beaver. \u201cEfficient and Provably Secure Oblivious Transfer.\u201d Manuscript, 1992."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Goldwasser. \u201cMultiparty Computation with Faulty Majority.\u201d Proceedings of the 30 th FOCS, IEEE, 1989, 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"24_CR7","unstructured":"D. Beaver, S. Haber. \u201cCryptographic Protocols Provably Secure Against Dynamic Adversaries.\u201d Eurocrypt 1992."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway. \u201cThe Round Complexity of Secure Protocols.\u201d Proceedings of the 22 st STOC, ACM, 1990, 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"C. Bennett, G. Brassard, C. Cr\u00e9peau, M. Skubiszewska. \u201cPractical Quantum Oblivious Transfer.\u201d Proceedings of Crypto 1991, 351\u2013366.","DOI":"10.1007\/3-540-46766-1_29"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1983","unstructured":"M. Blum. \u201cHow to Exchange (Secret) Keys.\u201d ACM Trans. Comput. Sys. 1:2, May, 1983, 175\u2013193.","journal-title":"ACM Trans. Comput. Sys."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"B. den Boer. \u201cOblivious Transfer Protecting Secrecy.\u201d Proc. of Eurocrypt 1991, 31\u201345.","DOI":"10.1007\/3-540-46877-3_4"},{"key":"24_CR12","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. System Sci. 37 (1988), 156\u2013189.","journal-title":"J. Comput. System Sci."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e8peau. \u201cNon-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond.\u201d Proceedings of the 27 th FOCS, IEEE, 1986, 188\u2013195.","DOI":"10.1109\/SFCS.1986.33"},{"issue":"1","key":"24_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. Comput. 18:1 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"J. Kilian. \u201cFounding Cryptography on Oblivious Transfer.\u201d Proceedings of the 20 th STOC, ACM, 1988, 20\u201329.","DOI":"10.1145\/62212.62215"},{"key":"24_CR16","unstructured":"S. Micali, P. Rogaway. \u201cSecure Computation.\u201d Proc. of Crypto 1991, page 9.8 [sic], and incomplete preliminary version distributed at conference."},{"key":"24_CR17","unstructured":"M. Rabin. \u201cHow to Exchange Secrets by Oblivious Transfer.\u201d TR-81, Harvard, 1981."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"A. Yao. \u201cProtocols for Secure Computations.\u201d Proceedings of the 23 rd FOCS, IEEE, 1982, 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:57Z","timestamp":1605629637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_24","relation":{},"subject":[]}}