{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:55:08Z","timestamp":1783788908079,"version":"3.55.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T00:00:00Z","timestamp":1289260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00145-010-9092-8","type":"journal-article","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T17:46:33Z","timestamp":1289238393000},"page":"158-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":77,"title":["Smooth Projective Hashing and Two-Message Oblivious Transfer"],"prefix":"10.1007","volume":"25","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,9]]},"reference":[{"key":"9092_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201901","author":"W. Aiello","year":"2001","unstructured":"W. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: How to sell digital goods, in Advances in Cryptology\u2014EUROCRYPT\u201901. Lecture Notes in Computer Science, vol. 2045 (Springer, Berlin, 2001), pp. 119\u2013135"},{"key":"9092_CR2","first-page":"493","volume-title":"FOCS\u201998","author":"C. Cachin","year":"1998","unstructured":"C. Cachin, C. Cr\u00e9peau, J. Marcil, Oblivious transfer with a memory-bounded receiver, in FOCS\u201998 (IEEE Press, New York, 1998), pp. 493\u2013502"},{"key":"9092_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology\u2014CRYPTO\u201903","author":"J. Camenisch","year":"2003","unstructured":"J. Camenisch, V. Shoup, Practical verifiable encryption and decryption of discrete logarithms, in Advances in Cryptology\u2014CRYPTO\u201903. Lecture Notes in Computer Science, vol. 2729 (Springer, Berlin, 2003), pp. 126\u2013144. Long version available on-line from the Cryptology ePrint Archive, report 2002\/161 (version 20030825:120805), \n                    http:\/\/eprint.iacr.org\/2002\/161"},{"key":"9092_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/11426639_24","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201905","author":"R. Canetti","year":"2005","unstructured":"R. Canetti, S. Halevi, J. Katz, Y. Lindell, P.D. MacKenzie, Universally composable password-based key exchange, in Advances in Cryptology\u2014EUROCRYPT\u201905. Lecture Notes in Computer Science, vol.\u00a03494 (Springer, Berlin, 2005), pp. 404\u2013421"},{"key":"9092_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology\u2014CRYPTO\u201998","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in Advances in Cryptology\u2014CRYPTO\u201998. Lecture Notes in Computer Science, vol.\u00a01462 (Springer, Berlin, 1998), pp. 13\u201325"},{"key":"9092_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201902","author":"R. Cramer","year":"2002","unstructured":"R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in Advances in Cryptology\u2014EUROCRYPT\u201902. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 45\u201364. Long version available as ECCC TR01-072 (Revision\u00a02), \n                    http:\/\/www.eccc.uni-trier.de\/report\/2001\/072\/"},{"key":"9092_CR7","series-title":"Lecture Notes in Computer Science","first-page":"350","volume-title":"Advances in Cryptology\u2014CRYPTO\u201987","author":"C. Cr\u00e9peau","year":"1987","unstructured":"C. Cr\u00e9peau, Equivalence between two flavours of oblivious transfers, in Advances in Cryptology\u2014CRYPTO\u201987. Lecture Notes in Computer Science, vol. 293 (Springer, Berlin, 1987), pp. 350\u2013354"},{"key":"9092_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-24638-1_25","volume-title":"Theory of Cryptography\u2014TCC\u201904","author":"Y.Z. Ding","year":"2004","unstructured":"Y.Z. Ding, D. Harnik, A. Rosen, R. Shaltiel, Constant-round oblivious transfer in the bounded storage model, in Theory of Cryptography\u2014TCC\u201904. Lecture Notes in Computer Science, vol. 2951 (Springer, Berlin, 2004), pp. 446\u2013472"},{"issue":"6","key":"9092_CR9","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM\n                           28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9092_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/3-540-39200-9_33","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201903","author":"R. Gennaro","year":"2003","unstructured":"R. Gennaro, Y. Lindell, A framework for password-based authenticated key exchange, in Advances in Cryptology\u2014EUROCRYPT\u201903. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 524\u2013543. Full version available on the ePrint archive, \n                    http:\/\/eprint.iacr.org\/2003\/032\/"},{"issue":"2","key":"9092_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci.\n                           28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9092_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing\u2014STOC\u201987","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing\u2014STOC\u201987 (ACM, New York, 1987), pp. 218\u2013229"},{"issue":"2","key":"9092_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/PL00003821","volume":"12","author":"S. Halevi","year":"1999","unstructured":"S. Halevi, Efficient commitment schemes with bounded sender and unbounded receiver. J. Cryptol.\n                           12(2), 77\u201390 (1999)","journal-title":"J. Cryptol."},{"issue":"1","key":"9092_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1613676.1613679","volume":"57","author":"J. Katz","year":"2009","unstructured":"J. Katz, R. Ostrovsky, M. Yung, Efficient and secure authenticated key exchange using weak passwords. J. ACM\n                           57(1), 78\u2013116 (2009)","journal-title":"J. ACM"},{"key":"9092_CR15","first-page":"30","volume-title":"STOC\u201988","author":"J. Kilian","year":"1988","unstructured":"J. Kilian, Founding cryptography on oblivious transfer, in STOC\u201988 (ACM, New York, 1988), pp. 30\u201331"},{"key":"9092_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"SAC\u201901","author":"B. M\u00f6ller","year":"2001","unstructured":"B. M\u00f6ller, Algorithms for multi-exponentiation, in SAC\u201901. Lecture Notes in Computer Science, vol.\u00a02259 (Springer, Berlin, 2001), pp. 165\u2013180"},{"key":"9092_CR17","first-page":"448","volume-title":"SODA\u201901","author":"M. Naor","year":"2001","unstructured":"M. Naor, B. Pinkas, Efficient oblivious transfer protocols, in SODA\u201901 (ACM, New York, 2001), pp.\u00a0448\u2013457"},{"issue":"1","key":"9092_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"N. Nisan, D. Zuckerman, Randomness is linear in space. J. Comput. Syst. Sci.\n                           52(1), 43\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"9092_CR19","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201999","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in Advances in Cryptology\u2014EUROCRYPT\u201999. Lecture Notes in Computer Science, vol. 1562 (Springer, Berlin, 1999), pp. 223\u2013238"},{"key":"9092_CR20","unstructured":"M.O. Rabin, How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard, 1981"},{"key":"9092_CR21","first-page":"162","volume-title":"FOCS\u201986","author":"A.C.-C. Yao","year":"1986","unstructured":"A.C.-C. Yao, How to generate and exchange secrets, in FOCS\u201986 (IEEE Press, New York, 1986), pp.\u00a0162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9092-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-010-9092-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9092-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9092-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:49:20Z","timestamp":1586335760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-010-9092-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9092"],"URL":"https:\/\/doi.org\/10.1007\/s00145-010-9092-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,9]]},"assertion":[{"value":"30 October 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}