{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:07:06Z","timestamp":1776942426065,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_29","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T11:03:27Z","timestamp":1186830207000},"page":"351-366","source":"Crossref","is-referenced-by-count":97,"title":["Practical Quantum Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Charles H.","family":"Bennett","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Brassard","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Cr\u00e9peau","sequence":"additional","affiliation":[]},{"given":"Marie-H\u00e9l\u00e8ne","family":"Skubiszewska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Bennett, C. H., F. Bessette, G. Brassard, L. Salvail and J. Smolin, \u201cExperimental quantum cryptography\u201d, Advances in Cryptology \u2014 Eurocrypt\u2019 90 Proceedings, April 1990, Springer-Verlag, pp. 253\u2013265.","DOI":"10.1007\/3-540-46877-3_23"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bennett, C. H., F. Bessette, G. Brassard, L. Salvail and J. Smolin, \u201cExperimental quantum cryptography\u201d, Journal of Cryptology, Vol. 5, no. 1, 1992, to appear.","DOI":"10.1007\/BF00191318"},{"key":"29_CR3","unstructured":"Bennett, C. H. and G. Brassard, \u201cQuantum cryptography: Public key distribution and coin tossing\u201d, Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India, December 1984, pp. 175\u2013179."},{"key":"29_CR4","unstructured":"Bennett, C. H., G. Brassard and S. Breidbart, \u201cQuantum cryptography II: How to re-use a one-time pad safely even if P = NP\u201d, unpublished manuscript available from the authors, November 1982."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Bennett, C. H., G. Brassard, S. Breidbart and S. Wiesner, \u201cQuantum cryptography, or unforgeable subway tokens\u201d, Advances in Cryptology: Proceedings of Crypto\u2019 82, August 1982, Plenum Press, pp. 267\u2013275.","DOI":"10.1007\/978-1-4757-0602-4_26"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Bennett, C. H., G. Brassard and J.-M. Robert, \u201cHow to reduce your enemy\u2019s information\u201d, Advances in Cryptology \u2014 Crypto\u2019 85 Proceedings, August 1985, Springer-Verlag, pp. 468\u2013476.","DOI":"10.1007\/3-540-39799-X_37"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"Bennett, C. H., G. Brassard and J.-M. Robert, \u201cPrivacy amplification by public discussion\u201d, SIAM Journal on Computing, Vol. 17, no. 2, April 1988, pp. 210\u2013229.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR8","unstructured":"Brassard, G. and C. Cr\u00e9peau, \u201cQuantum bit commitment and coin tossing protocols\u201d, Advances in Cryptology \u2014 Crypto\u2019 90 Proceedings, August 1990, Springer-Verlag, to appear."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Brassard, G., C. Cr\u00e9peau and J.-M. Robert, \u201cInformation theoretic reductions among disclosure problems\u201d, Proceedings of 27th IEEE Symposium on the Foundations of Computer Science, October 1986, pp. 168\u2013173.","DOI":"10.1109\/SFCS.1986.26"},{"key":"29_CR10","unstructured":"Brassard, G. and M. Yung, \u201cOne-way group actions\u201d, Advances in Cryptology \u2014 Crypto\u2019 90 Proceedings, August 1990, Springer-Verlag, to appear."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., \u201cEquivalence between two flavours of oblivious transfers (abstract)\u201d, Advances in Cryptology: Proceedings of Crypto\u2019 87, August 1987, Springer-Verlag, pp. 350\u2013354.","DOI":"10.1007\/3-540-48184-2_30"},{"key":"29_CR12","unstructured":"Cr\u00e9peau, C., \u201cVerifiable disclosure of secrets and application\u201d, Advances in Cryptology: Proceedings of Eurocrypt\u2019 89, April 1989, Springer-Verlag, pp. 181\u2013191."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C. and J. Kilian, \u201cAchieving oblivious transfer using weakened security assumptions\u201d, Proceedings of 29th IEEE Symposium on the Foundations of Computer Science, October 1988, pp. 42\u201352.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"29_CR14","unstructured":"Deutsch, D., \u201cQuantum communication thwarts eavesdroppers\u201d, New Scientist, 9 December 1989, pp. 25\u201326."},{"key":"29_CR15","first-page":"790","volume":"233","author":"A. Ekert","year":"1991","unstructured":"Ekert, A., \u201cLa m\u00e9canique quantique au secours des agents secrets\u201d, La recherche, No. 233, June 1991, pp. 790\u2013791.","journal-title":"La recherche"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Even, S., O. Goldreich and A. Lempel, \u201cA randomized protocol for signing contracts\u201d, Advances in Cryptology: Proceedings of Crypto\u2019 82, August 1982, Plenum Press, pp. 205\u2013210.","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"29_CR17","unstructured":"Forney, G. D., Concatenated Codes, The M.I.T. Press, 1966."},{"issue":"7599","key":"29_CR18","first-page":"81","volume":"311","author":"A. Gottlieb","year":"1989","unstructured":"Gottlieb, A., \u201cConjugal secrets \u2014 The untappable quantum telephone\u201d, The Economist, Vol. 311, no. 7599, 22 April 1989, p. 81.","journal-title":"The Economist"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., \u201cPseudo-random generation under uniform assumptions\u201d, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 1990, pp. 395\u2013440.","DOI":"10.1145\/100216.100270"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., L. A. Levin and M. Luby, \u201cPseudo-random generation from one-way functions\u201d, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R. and S. Rudich, \u201cLimits on the provable consequences of one-way permutations\u201d, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 1989, pp. 44\u201361.","DOI":"10.1145\/73007.73012"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Kilian, J., \u201cFounding cryptography on oblivious transfer\u201d, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 1988, pp. 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"29_CR23","unstructured":"MacWilliams, F. J. and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977."},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., \u201cBit commitment using pseudo-randomness\u201d, Advances in Cryptology \u2014 Crypto\u2019 89 Proceedings, August 1989, Springer-Verlag, pp. 128\u2013136. To appear in Journal of Cryptology, Vol. 4, no. 2, 1991.","DOI":"10.1007\/0-387-34805-0_13"},{"key":"29_CR25","unstructured":"Naor, M., R. Ostrovsky, R. Venkatesan and M. Yung, \u201cPerfect zero-knowledge arguments for NP can be based on general complexity assumptions\u201d, Manuscript available from the authors, 1991."},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"342","DOI":"10.2307\/3974219","volume":"137","author":"I. Peterson","year":"1990","unstructured":"Peterson, I., \u201cBits of uncertainty: Quantum security\u201d, Science News, Vol. 137, 2 June 1990, pp. 342\u2013343.","journal-title":"Science News"},{"key":"29_CR27","unstructured":"Rabin, M. O., \u201cHow to exchange secrets by oblivious transfer\u201d, Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"29_CR28","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1038\/353384a0","volume":"353","author":"I. Stewart","year":"1991","unstructured":"Stewart, I., \u201cSchr\u00f6dinger\u2019s catflap\u201d, News and Views, Nature, Vol. 353. 3 October 1991, pp. 384\u2013385.","journal-title":"News and Views"},{"issue":"5","key":"29_CR29","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1038\/scientificamerican0589-28b","volume":"260","author":"P. Wallich","year":"1989","unstructured":"Wallich, P., \u201cQuantum cryptography\u201d, Scientific American, Vol. 260, no. 5, May 1989, pp. 28\u201330.","journal-title":"Scientific American"},{"issue":"1","key":"29_CR30","first-page":"78","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"Wiesner, S., \u201cConjugate coding\u201d, manuscript written circa 1970, unpublished until it appeared in Sigact News, Vol. 15, no. 1, 1983, pp. 78\u201388.","journal-title":"Conjugate coding"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:48:42Z","timestamp":1619556522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_29","relation":{},"subject":[]}}