{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:27:29Z","timestamp":1725539249165},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048456"},{"type":"electronic","value":"9783642048463"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04846-3_8","type":"book-chapter","created":{"date-parts":[[2009,10,15]],"date-time":"2009-10-15T06:29:53Z","timestamp":1255588193000},"page":"110-124","source":"Crossref","is-referenced-by-count":0,"title":["Reducing Complexity Assumptions for Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"K. Y.","family":"Cheong","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Koshiba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BFb0055735","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Halevi, S., Sahai, A., Vadhan, S.P.: Many-to-one trapdoor functions and their relation to public-key cryptosystems. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 283\u2013299. Springer, Heidelberg (1998)"},{"issue":"6","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"Brassard, G., Cr\u00e9peau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory\u00a042(6), 1769\u20131780 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-002-0146-4","volume":"16","author":"G. Brassard","year":"2003","unstructured":"Brassard, G., Cr\u00e9peau, C., Wolf, S.: Oblivious transfers and privacy amplification. Journal of Cryptology\u00a016(4), 219\u2013237 (2003)","journal-title":"Journal of Cryptology"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"Carter, J., Wegman, M.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Simple, black-box constructions of adaptively secure protocols. In: Theory of Cryptography Conference 2009. LNCS, vol.\u00a05444, pp. 387\u2013402 (2009)","DOI":"10.1007\/978-3-642-00457-5_23"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology - CRYPTO 1887","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11761679_13","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Cr\u00e9peau","year":"2006","unstructured":"Cr\u00e9peau, C., Savvides, G.: Optimal reductions between oblivious transfers using interactive hashing. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 201\u2013221. Springer, Heidelberg (2006)"},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O.: A\u00a0Lempel: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: Proc. 41st IEEE Symposium on Foundations of Computer Science, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"8_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol II. Cambridge University Press, Cambridge (2004)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proc. 21st ACM Symposium on Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Proc. 19th ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/978-3-540-24638-1_22","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2004","unstructured":"Haitner, I.: Implementing oblivious transfer using collection of dense trapdoor permutations. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 394\u2013409. Springer, Heidelberg (2004)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-78524-8_23","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2008","unstructured":"Haitner, I.: Semi-honest to malicious oblivious transfer\u2014the black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 412\u2013426. Springer, Heidelberg (2008)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/11426639_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"I. Haitner","year":"2005","unstructured":"Haitner, I., Horvitz, O., Katz, J., Koo, C.-Y., Morselli, R., Shaltiel, R.: Reducing complexity assumptions for statistically-hiding commitment. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 58\u201377. Springer, Heidelberg (2005)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: Proc. 39th ACM Symposium on Theory of Computing, pp. 1\u201310 (2007)","DOI":"10.1145\/1250790.1250792"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. In: Proc. 47th IEEE Symposium on Foundations of Computer Science, pp. 719\u2013728 (2006)","DOI":"10.1109\/FOCS.2006.54"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proc. 30th IEEE Symposium on Foundations of Computer Science, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proc. 21st ACM Symposium on Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious tranfer. In: Proc. 20th ACM Symposium on Theory of Computing, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology\u00a011(2), 87\u2013108 (1998)","journal-title":"Journal of Cryptology"},{"key":"8_CR24","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 448\u2013457 (2001)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Proc. 40th ACM Symposium on Theory of Computing, pp. 187\u2013196 (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"8_CR27","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer, Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"issue":"11","key":"8_CR29","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"issue":"4","key":"8_CR30","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News\u00a015(1), 78\u201388 (1983)","journal-title":"SIGACT News"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11761679_14","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S. Wolf","year":"2006","unstructured":"Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 222\u2013232. Springer, Heidelberg (2006)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 555\u2013572. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04846-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:45:02Z","timestamp":1606185902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04846-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048456","9783642048463"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04846-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}