{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:34:46Z","timestamp":1769268886137,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540629757","type":"print"},{"value":"9783540690535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_21","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:24:05Z","timestamp":1186363445000},"page":"306-317","source":"Crossref","is-referenced-by-count":82,"title":["Efficient Cryptographic Protocols Based on Noisy Channels"],"prefix":"10.1007","author":[{"given":"Claude","family":"Cr\u00e9peau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"issue":"6","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C.H. Bennett","year":"1995","unstructured":"C.H. Bennett, G. Brassard, C. Cr\u00e9peau, and U.M. Maurer. Generalized Privacy Amplification. IEEE Transaction on Information Theory, Volume 41, Number 6, November 1995, pp. 1915\u20131923.","journal-title":"IEEE Transaction on Information Theory"},{"key":"21_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-46766-1_29","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 91","author":"C. H. Bennett","year":"1992","unstructured":"C. H. Bennett, G. Brassard, C. Cr\u00e9peau, and M.-H. Skubiszewska. Practical quantum oblivious transfer. In Advances in Cryptology: Proceedings of Crypto\u2019 91, Lecture Notes in Computer Science, Vol. 576, pages 351\u2013366. Springer-Verlag, 1992."},{"key":"21_CR3","unstructured":"M. Blum. Coin flipping by telephone. In Proceedings of IEEE Spring Computer Conference, pages 133\u2013137. IEEE, 1982."},{"key":"21_CR4","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, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156\u2013189, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, R. Jozsa and D. Langlois, \u201cA quantum bit commitment scheme provably unbreakable by both parties,\u201d Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 362\u2013371.","DOI":"10.1109\/SFCS.1993.366851"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman, \u201cUniversal classes of hash functions\u201d, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau. Equivalence between two flavours of oblivious transfers (abstract). In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto\u2019 87, pages 350\u2013354, Springer-Verlag, 1988.","DOI":"10.1007\/3-540-48184-2_30"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, J. van de Graaf and A. Tapp. Committed Oblivious Transfer and Private Multi-Party Computations. Advances in Cryptology: Proceedings of Crypto\u2019 95, August 1995, pp. 110\u2013123.","DOI":"10.1007\/3-540-44750-4_9"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In 29 th Symposium on Foundations of Computer Science, pages 42\u201352. IEEE, 1988.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"21_CR10","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":"21_CR11","unstructured":"Forney, G. D., Concatenated Codes, The M.I.T. Press, 1966."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, or: A completeness theorem for protocols with honest majority In Proc. 19th ACM Symposium on Theory of Computing, pages 218\u2013229, ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity, or All languages in % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbd9wDYLwzYbItLDharyavP1wz % ZbItLDhis9wBH5garqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaabeqaam % aaeaqbaaGcbaWefv3ySLgznfgDOfdarCqr1ngBPrginfgDObYtUvga % iyaacqWFneVtcqWFpepuaaa!47FD! $$ \\mathcal{N}\\mathcal{P} $$ have zero-knowledge proof systems. Journal of the ACM, 38:691\u2013729, 1991.","journal-title":"Journal of the ACM"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J. Kilian, Founding cryptography on Oblivious transfer, 20th ACM Symposium on Theory of Computation, 1988, pp. 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"21_CR15","unstructured":"F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977."},{"key":"21_CR16","unstructured":"M.O. Rabin, How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"21_CR17","unstructured":"A. R\u00e9nyi, Probability Theory, North Holland, 1970."},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"S. Wiesner. Conjugate coding. SIGACT News, 15(1):78\u201388, 1983. Manuscript written circa 1970, unpublished until it appeared in SIGACT News.","journal-title":"SIGACT News"},{"issue":"8","key":"21_CR19","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"A. D. Wyner","year":"1975","unstructured":"A. D. Wyner, \u201cThe wire-tap channel\u201d, Bell System Technical Journal, Vol. 54, no. 8, 1975, pp. 1355\u20131387.","journal-title":"Bell System Technical Journal"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A. C.-C., \u201cProtocols for secure computations\u201d, In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, November 1982, pp. 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:19:47Z","timestamp":1737346787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]}}}