{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:34:38Z","timestamp":1777455278929,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602217","type":"print"},{"value":"9783540447504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_9","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:39:53Z","timestamp":1187253593000},"page":"110-123","source":"Crossref","is-referenced-by-count":93,"title":["Committed Oblivious Transfer and Private Multi-Party Computation"],"prefix":"10.1007","author":[{"given":"Claude","family":"Cr\u00e9peau","sequence":"first","affiliation":[]},{"given":"Jeroen","family":"van de Graaf","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Tapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"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, J.-M. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, Vol. 17, No.2, 1988, pp. 210\u2013229.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"C.H. Bennett, G. Brassard, C. Cr\u00e9peau, M.-H. Skubiszewska, Practical Quantum Oblivious Transfer, Advances in Cryptology \u2014 CRYPTO\u201991, Springer-Verlag, 1992, pp. 351\u2013366.","DOI":"10.1007\/3-540-46766-1_29"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, R. Jozsa, D. Langlois, A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties, 34th IEEE Symposium on Foundation of Computer Science, 1993, pp. 362\u2013371.","DOI":"10.1109\/SFCS.1993.366851"},{"key":"9_CR4","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, Universal Classes of hash function, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, I. Damg\u00e5rd and J. van de Graaf, Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result, Advances in Cryptology \u2014 CRYPTO\u201987, Springer-Verlag, 1988, pp. 87\u2013119.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleve, Controlled Gradual Disclosure Schemes for Random Bits and Their Applications, Advances in Cryptology \u2014 CRYPTO\u201989, Springer-Verlag, 1991, pp. 573\u2013590.","DOI":"10.1007\/0-387-34805-0_50"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, Equivalence Between Two Flavours of Oblivious Transfer, Advances in Cryptology \u2014 CRYPTO\u201987, Springer-Verlag, 1988, pp. 350\u2013354.","DOI":"10.1007\/3-540-48184-2_30"},{"key":"9_CR8","unstructured":"Cr\u00e9peau, C., Verifiable Disclosure of Secrets and Applications, Advances in Cryptology \u2014 Eurocrypt\u201989, Springer-Verlag, 1990, pp. 181\u2013191."},{"key":"9_CR9","unstructured":"C. Cr\u00e9peau, Correct and Private Reductions Among Oblivious Transfers, Ph.D. thesis, MIT, 1990."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, Quantum Oblivious Transfer, Journal of Modern Optics, vol. 41, No. 12, 1994.","DOI":"10.1080\/09500349414552291"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, J. Kilian, Achieving Oblivious Transfer Using Weakened Security Assumptions, 29th IEEE Symposium on Foundation of Computer Science, 1988, pp. 42\u201352.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"9_CR12","unstructured":"C. Cr\u00e9peau, Cryptographic protocol based on noisy channel, in preparation, 1995."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM, Vol 28, 1985, pp. 637\u2013647.","journal-title":"Communications of the ACM"},{"key":"9_CR14","unstructured":"Forney, G. D., Concatenated Codes, The M.I.T. Press, 1966."},{"key":"9_CR15","volume-title":"Complexity and security of distributed protocols","author":"M. Franklin","year":"1993","unstructured":"M. Franklin, Complexity and security of distributed protocols, Ph. D. thesis, Computer Science Department of Columbia University, New York, 1993."},{"key":"9_CR16","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, 19th ACM Symposium on Theory of Computing, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, R. Vainish, How to solve any protocol problem \u2014 an efficiency improvement, Advances in Cryptology \u2014 CRYPTO\u201987, Springer-Verlag, 1988, pp. 73\u201386.","DOI":"10.1007\/3-540-48184-2_6"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, L. Levin, Fair computation of general functions in presence of moral majority, Advances in Cryptology \u2014 CRYPTO\u201990, Springer-Verlag, 1991, pp. 77\u201393.","DOI":"10.1007\/3-540-38424-3_6"},{"key":"9_CR19","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":"9_CR20","unstructured":"J. Kilian, Uses of Randomness in Algorithms and Protocols, MIT Press, 1990."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"J. Kilian, A note on efficient zero-knowledge proofs and arguments, 24th ACM Symposium on Theory of Computation, 1992, pp. 723\u2013732.","DOI":"10.1145\/129712.129782"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"J. Kilian, On the complexity of bounded-interaction and noninteractive zero-knowledge proofs, 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 466\u2013477.","DOI":"10.1109\/SFCS.1994.365744"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, S. Micali, R. Ostrovski, Reducibility and completeness in multiparty private computations, 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 478\u2013489.","DOI":"10.1109\/SFCS.1994.365743"},{"key":"9_CR24","unstructured":"F. J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"M. Naor, Bit Commitment using Pseudo-Randomness, Advances in Cryptology \u2014 CRYPTO\u201989, Springer-Verlag, 1989, pp. 128\u2013136.","DOI":"10.1007\/0-387-34805-0_13"},{"key":"9_CR26","unstructured":"M. Rabin, How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"D. Spielman, Linear-Time Encodable and Decodable Error-Correcting Codes, 27th ACM Symposium on Theory of Computing, 1995, pp. 388\u2013397.","DOI":"10.1145\/225058.225165"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:31:45Z","timestamp":1737372705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}