{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:50Z","timestamp":1725488690222},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540546207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46416-6_9","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:02:07Z","timestamp":1186423327000},"page":"106-113","source":"Crossref","is-referenced-by-count":18,"title":["On the Reversibility of Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Claude","family":"Cr\u00e9peau","sequence":"first","affiliation":[]},{"given":"Mikl\u00f3s","family":"S\u00e1ntha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM J. Computing, 17(2):210\u2013229, April 1988.","journal-title":"SIAM J. Computing"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau. Quantum bit commitment and coin tossing protocols. In S. Vanstone, editor, Advances in Cryptology: Proceedings of Crypto\u2019 90, Springer-Verlag, 1991. to appear.","DOI":"10.1007\/3-540-38424-3_4"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, and J.-M. Robert. Information theoretic reductions among disclosure problems. In 27th Symp. of Found. of Computer Sci., pages 168\u2013173, IEEE, 1986.","DOI":"10.1109\/SFCS.1986.26"},{"key":"9_CR4","first-page":"396","volume-title":"Proceedings of the 26th IEEE Symposium on Foundations of Computer Science","author":"B. Chor","year":"1985","unstructured":"B. Chor, O. Goldreich, J. Hastad, J. Friedmann, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 396\u2013407, IEEE, Portland, 1985."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01874387","volume":"1","author":"V. Chvatal","year":"1984","unstructured":"V. Chvatal. Probabilistic methods in graph theory. Annals of Operations Research, 1:171\u2013182, 1984.","journal-title":"Annals of Operations Research"},{"key":"9_CR6","unstructured":"C. Cr\u00e9peau and S. Micali. Secure two-party protocols. 1991. in preparation."},{"key":"9_CR7","unstructured":"C. Cr\u00e9peau. Correct and Private Reductions among Oblivious Transfers. PhD thesis, Department of Elec. Eng. and Computer Science, Massachusetts Institute of Technology, 1990. Supervised by Silvio Micali."},{"key":"9_CR8","unstructured":"C. Cr\u00e9peau and M. S\u00e1ntha. Efficient reductions among oblivious transfer protocols. submitted to STOC 91."},{"key":"9_CR9","first-page":"205","volume-title":"Proceedings CRYPTO 82","author":"S. Even","year":"1983","unstructured":"S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proceedings CRYPTO 82, pages 205\u2013210, Plenum Press, New York, 1983."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich and R. Vainish. How to solve any protocol problem-an efficiency improvement (extended abstract). In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto\u2019 87, pages 73\u201386. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-48184-2_6"},{"key":"9_CR11","unstructured":"F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977."},{"key":"9_CR12","unstructured":"R. Ostrovsky, R. Venkatesan, and M. Yung. On the complexity of asymmetric games. In Proceedings of Sequences\u2019 91, 1991. to appear. This work was first presented at the DIMACS workshop on cryptography, October 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46416-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:40Z","timestamp":1605647500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46416-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540546207"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46416-6_9","relation":{},"subject":[]}}