{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T16:11:14Z","timestamp":1786291874258,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642226694","type":"print"},{"value":"9783642226700","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22670-0_23","type":"book-chapter","created":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T09:10:18Z","timestamp":1311757818000},"page":"273-301","source":"Crossref","is-referenced-by-count":34,"title":["On Yao\u2019s XOR-Lemma"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Goldreich, O.: Foundation of Cryptography \u2013 Class Notes. Computer Science Department, Technion, Haifa, Israel (Spring 1989)"},{"key":"23_CR2","unstructured":"Goldreich, O.: Foundation of Cryptography \u2013 Fragments of a Book, Available from ECCC (February 1995)"},{"key":"23_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundation of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundation of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"23_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity: A Conceptual Perspective","author":"O. Goldreich","year":"2008","unstructured":"Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A Hard-Core Predicate for all One-Way Functions. In: 21st STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"4","key":"23_CR6","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.A., Luby, M.: A Pseudorandom Generator from any One-way Function. SICOMP\u00a028(4), 1364\u20131396 (1999); Combines papers of Impagliazzo et al. (21st STOC, 1989) and H\u00e5stad (22nd STOC, 1990)","journal-title":"SICOMP"},{"key":"23_CR7","unstructured":"Impagliazzo, R.: See [8], which appeared after our first posting (1994) (manuscript)"},{"key":"#cr-split#-23_CR8.1","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core Distributions for Somewhat Hard Problems. In: 36th FOCS, pp. 538\u2013545 (1995);","DOI":"10.1109\/SFCS.1995.492584"},{"key":"#cr-split#-23_CR8.2","unstructured":"This is a later version of [7]"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. In: 47th FOCS, pp. 187\u2013196 (2006)","DOI":"10.1109\/FOCS.2006.13"},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/080734030","volume":"39","author":"R. Impagliazzo","year":"2010","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V., Wigderson, A.: Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J.\u00a0Comput.\u00a039(4), 1637\u20131665 (2010); Preliminary version in 40th STOC (2008)","journal-title":"SIAM J.\u00a0Comput."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: 29th STOC, pp. 220\u2013229 (1997)","DOI":"10.1145\/258533.258590"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-Way Functions and Pseudorandom Generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L.A. Levin","year":"1986","unstructured":"Levin, L.A.: Average Case Complete Problems. SICOMP\u00a015, 285\u2013286 (1986)","journal-title":"SICOMP"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N., Rudich, S., Saks, M.: Products and Help Bits in Decision Trees. In: 35th FOCS, pp. 318\u2013329 (1994)","DOI":"10.1109\/SFCS.1994.365683"},{"issue":"2","key":"23_CR15","first-page":"149","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs Randomness. JCSS\u00a049(2), 149\u2013167 (1994)","journal-title":"JCSS"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4086\/toc.2008.v004a007","volume":"4","author":"E. Viola","year":"2008","unstructured":"Viola, E., Wigderson, A.: Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols. Theory of Computing\u00a04(1), 137\u2013168 (2008); Preliminary version in IEEE Conf. on Comput. Complex. (2007)","journal-title":"Theory of Computing"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and Application of Trapdoor Functions. In: 23rd FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22670-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T13:02:03Z","timestamp":1560430923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22670-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226694","9783642226700"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22670-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}