{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:10:19Z","timestamp":1736993419252,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001713"},{"type":"electronic","value":"9783540361787"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36178-2_7","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:30:14Z","timestamp":1178213414000},"page":"110-124","source":"Crossref","is-referenced-by-count":3,"title":["On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives"],"prefix":"10.1007","author":[{"given":"Yan-Cheng","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Yun","family":"Hsiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Jen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0055735","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 98","author":"M. Bellare","year":"1998","unstructured":"Mihir Bellare, Shai Halevi, Amit Sahai, and Salil P. Vadhan. Many-to-one trapdoor functions and their relation to public-key cryptosystems. In Hugo Krawczyk, editor, Advances in Cryptology\u2014CRYPTO\u2019 98, volume 1462 of Lecture Notes in Computer Science, pages 283\u2013298. Springer-Verlag, 1998."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Amos Beimel, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. One-way functions are essential for single-server private information retrieval. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 89\u201398, 1999.","DOI":"10.1145\/301250.301277"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 41\u201350, 1995.","DOI":"10.1109\/SFCS.1995.492461"},{"key":"7_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 00","author":"G. Crescenzo Di","year":"2000","unstructured":"Giovanni Di Crescenzo, Tal Malkin, and Rafail Ostrovsky. Single database private information retrieval implies oblivious transfer. In Bart Preneel, editor, Advances in Cryptology\u2014EUROCRYPT\u2019 00, volume 1807 of Lecture Notes in Computer Science, pages 122\u2013138. Springer-Verlag, 2000."},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644\u2013654, 1976.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-45760-7_7","volume-title":"Topics in Cryptology\u2014CT-RSA\u2019 02","author":"M. Fischlin","year":"2002","unstructured":"Marc Fischlin. On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function. In Bart Preneel, editor, Topics in Cryptology\u2014CT-RSA\u2019 02, volume 2271 of Lecture Notes in Computer Science, pages 79\u201395. Springer-Verlag, 2002."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, and Mahesh Viswanathan. The relationship between public key encryption and oblivious transfer. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 325\u2013335, 2000.","DOI":"10.1109\/SFCS.2000.892121"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Yael Gertner, Tal Malkin, and Omer Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 126\u2013135, 2001.","DOI":"10.1109\/SFCS.2001.959887"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 305\u2013313, 2000.","DOI":"10.1109\/SFCS.2000.892119"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"Johan H\u00e5stad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364\u20131396, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography (extended abstract). In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 230\u2013235, 1989.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 44\u201361, 1989.","DOI":"10.1145\/73007.73012"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Joe Kilian. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 364\u2013373, 1997.","DOI":"10.1109\/SFCS.1997.646125"},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-45539-6_9","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 00","author":"E. Kushilevitz","year":"2000","unstructured":"Eyal Kushilevitz and Rafail Ostrovsky. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In Bart Preneel, editor, Advances in Cryptology\u2014EUROCRYPT\u2019 00, volume 1807 of Lecture Notes in Computer Science, pages 104\u2013121. Springer-Verlag, 2000."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Jeff Kahn, Michael E. Saks, and Cliff Smyth. A dual version of Reimer\u2019s inequality and a proof of Rudich\u2019s conjecture. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 98\u2013103, 2000.","DOI":"10.1109\/CCC.2000.856739"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Jeong Han Kim, Daniel R. Simon, and Prasad Tetali. Limits on the efficiency of one-way permutation-based hash functions. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 535\u2013542, 1999.","DOI":"10.1109\/SFFCS.1999.814627"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151\u2013158, 1991.","journal-title":"Journal of Cryptology"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 387\u2013394, 1990.","DOI":"10.1145\/100216.100269"},{"key":"7_CR20","unstructured":"Steven Rudich. Limits on the provable consequences of one-way functions. Ph.D. thesis, U.C. Berkeley, 1988."},{"key":"7_CR21","series-title":"Lect Notes Comput Sci","first-page":"242","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 91","author":"S. Rudich","year":"1991","unstructured":"Steven Rudich. The use of interaction in public cryptosystems (extended abstract). In Joan Feigenbaum, editor, Advances in Cryptology\u2014CRYPTO\u2019 91, volume 576 of Lecture Notes in Computer Science, pages 242\u2013251. Springer-Verlag, 1991."},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"7_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 98","author":"D. R. Simon","year":"1998","unstructured":"Daniel R. Simon. Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In Kaisa Nyberg, editor, Advances in Cryptology\u2014EUROCRYPT\u2019 98, volume 1403 of Lecture Notes in Computer Science, pages 334\u2013345. Springer-Verlag, 1998."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Andrew Chi-Chih Yao. Theory and applications of trapdoor functions (extended abstract). In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36178-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T01:07:41Z","timestamp":1736989661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36178-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001713","9783540361787"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-36178-2_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}