{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:42Z","timestamp":1766281002011},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_3","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"34-49","source":"Crossref","is-referenced-by-count":16,"title":["On Hardness Amplification of One-Way Functions"],"prefix":"10.1007","author":[{"given":"Henry","family":"Lin","sequence":"first","affiliation":[]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gertner, Y., Katz, J.: Lower bounds on the efficiency of encryption and digital signature schemes. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 417\u2013425 (2003)","DOI":"10.1145\/780542.780604"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pp. 318\u2013326 (1990)","DOI":"10.1109\/FSCS.1990.89550"},{"key":"3_CR3","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: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the impossibility of basing trapdoor functions on trapdoor predicates. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 126\u2013135 (2001)","DOI":"10.1109\/SFCS.2001.959887"},{"key":"3_CR5","unstructured":"Goldreich, O.: A sample of samplers - a computational perspective on sampling. Technical Report TR97-020, Electronic Colloquium on Computational Complexity (1997)"},{"key":"3_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 305\u2013313 (2000)","DOI":"10.1109\/SFCS.2000.892119"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"3_CR10","unstructured":"Impagliazzo, R.: Very strong one-way functions and pseudo-random generators exist relative to a random oracle. Unpublished manuscript (1996)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kahn, J., Saks, M., Smyth, C.: A dual version of Reimer\u2019s inequality and a proof of rudich\u2019s conjecture. In: Proceedings of the 15th IEEE Conference on Computational Complexity (2000)","DOI":"10.1109\/CCC.2000.856739"},{"key":"3_CR13","unstructured":"Kim, J.H., Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutations-based hash functions. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 535\u2013542 (1999)"},{"key":"3_CR14","doi-asserted-by":"crossref","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton (1996)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Tight bounds for depth-two superconcentrators. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pp. 585\u2013594 (1997)","DOI":"10.1109\/SFCS.1997.646148"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"3_CR17","unstructured":"Rudich, S.: Limits on the provable consequences of one-way functions. PhD thesis, University of California at Berkeley (1988)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-46766-1_19","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"S. Rudich","year":"1992","unstructured":"Rudich, S.: The use of interaction in public cryptosystems. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 242\u2013251. Springer, Heidelberg (1992)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A.: Almost optimal dispersers. In: Proceedings of the 30th ACM Symposium on Theory of Computing (1998)","DOI":"10.1145\/276698.276736"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:54Z","timestamp":1605759834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}