{"id":"https://openalex.org/W3046543556","doi":"https://doi.org/10.1007/s00037-023-00238-9","title":"Is it possible to improve Yao\u2019s XOR lemma using reductions that exploit the efficiency of their oracle?","display_name":"Is it possible to improve Yao\u2019s XOR lemma using reductions that exploit the efficiency of their oracle?","publication_year":2023,"publication_date":"2023-05-23","ids":{"openalex":"https://openalex.org/W3046543556","doi":"https://doi.org/10.1007/s00037-023-00238-9","mag":"3046543556"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-023-00238-9","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s00037-023-00238-9","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol176-approx-random2020/LIPIcs.APPROX-RANDOM.2020.10/LIPIcs.APPROX-RANDOM.2020.10.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062263696","display_name":"Ronen Shaltiel","orcid":"https://orcid.org/0000-0002-5182-593X"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ronen Shaltiel","raw_affiliation_strings":["Department of Computer Science, University of Haifa, 65 Hanamal street, Haifa, 3303221, Israel","University of Haifa, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, 65 Hanamal street, Haifa, 3303221, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":"University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062263696"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00122259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":"94","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14025","display_name":"Educational Technology and Assessment","score":0.8884999752044678,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14025","display_name":"Educational Technology and Assessment","score":0.8884999752044678,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.857699990272522,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.8389000296592712,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.8022942543029785},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.552502453327179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5522310137748718},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5518843531608582},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44060441851615906},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.365037739276886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36466532945632935},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.2356007993221283},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.10100740194320679}],"concepts":[{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.8022942543029785},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.552502453327179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5522310137748718},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5518843531608582},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44060441851615906},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.365037739276886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36466532945632935},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.2356007993221283},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.10100740194320679},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00037-023-00238-9","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s00037-023-00238-9","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:12613","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol176-approx-random2020/LIPIcs.APPROX-RANDOM.2020.10/LIPIcs.APPROX-RANDOM.2020.10.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.approx/random.2020.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2020.10","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:3046543556","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc27.html#Shaltiel20","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12613","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol176-approx-random2020/LIPIcs.APPROX-RANDOM.2020.10/LIPIcs.APPROX-RANDOM.2020.10.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7456564546","display_name":null,"funder_award_id":"1628/17","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3046543556.pdf","grobid_xml":"https://content.openalex.org/works/W3046543556.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1517420271","https://openalex.org/W1598233781","https://openalex.org/W1625658248","https://openalex.org/W1850905020","https://openalex.org/W1901622511","https://openalex.org/W1973874352","https://openalex.org/W1987890787","https://openalex.org/W2004881597","https://openalex.org/W2009994177","https://openalex.org/W2021736779","https://openalex.org/W2027665018","https://openalex.org/W2032791464","https://openalex.org/W2036656440","https://openalex.org/W2048284438","https://openalex.org/W2062965695","https://openalex.org/W2070678975","https://openalex.org/W2072124641","https://openalex.org/W2099645854","https://openalex.org/W2114451680","https://openalex.org/W2129210705","https://openalex.org/W2130246629","https://openalex.org/W2140343994","https://openalex.org/W2144537400","https://openalex.org/W2160403361","https://openalex.org/W2161714146","https://openalex.org/W2163083173","https://openalex.org/W2294870549","https://openalex.org/W2336471965","https://openalex.org/W2610312456","https://openalex.org/W2799236954","https://openalex.org/W2888575364","https://openalex.org/W2947443956","https://openalex.org/W2950999115","https://openalex.org/W6966764767"],"related_works":["https://openalex.org/W264971478","https://openalex.org/W2149096890","https://openalex.org/W3029247252","https://openalex.org/W2399264755","https://openalex.org/W2148959297","https://openalex.org/W2557037377","https://openalex.org/W109847728","https://openalex.org/W1480767061","https://openalex.org/W3028996067","https://openalex.org/W2951004906","https://openalex.org/W3185811952","https://openalex.org/W2952536999","https://openalex.org/W2620926970","https://openalex.org/W17952650","https://openalex.org/W3122582894"],"abstract_inverted_index":{"Yao\u2019s":[0,137,148,246],"XOR":[1,138,149,247],"lemma":[2,60],"states":[3],"that":[4,20,110,124,132,143,166,187,237,265,286,292,307],"for":[5,17,21,45,54,67,262,277],"every":[6,22],"function":[7,130],"$$f:\\{0,1\\}^k":[8],"\\rightarrow":[9],"\\{0,1\\}$$":[10],",":[11,64,69],"if":[12],"f":[13],"has":[14,49],"hardness":[15,50,263],"2/3":[16],"P/poly":[18,77],"(meaning":[19],"circuit":[23,142],"C":[24],"in":[25,157,245,285],"P/poly,":[26],"$$\\Pr[C(X)=f(X)]":[27],"\\le":[28],"2/3$$":[29],"on":[30,103,161,260,295],"a":[31,104,129,141,153],"uniform":[32],"input":[33],"X),":[34],"then":[35],"the":[36,87,134,145,158,170,221,242,250,257,273,281,304],"task":[37],"of":[38,58,82,93,106,136,147,172,205,224,232,252],"computing":[39],"$$f(X_1)":[40],"\\oplus":[41,43],"\\ldots":[42],"f(X_t)$$":[44],"sufficiently":[46],"large":[47],"t":[48],"$$\\frac{1}{2}":[51],"+":[52],"\\epsilon$$":[53],"P/poly.":[55],"Known":[56],"proofs":[57],"this":[59,217,255,310],"cannot":[61,113,240],"achieve":[62],"$$\\epsilon=\\frac{1}{k^{\\omega(1)}}$$":[63],"and":[65,98,175,180,227,298],"even":[66],"$$\\epsilon=\\frac{1}{k}$$":[68],"we":[70,219],"do":[71],"not":[72],"know":[73],"how":[74],"to":[75,128,163,191,197,210,229,267,301],"replace":[76],"by":[78,116,120],"AC0[parity]":[79],"(the":[80],"class":[81,204,233,238,268],"constant":[83],"depth":[84],"circuits":[85],"with":[86,288,303],"gates":[88],"{and,":[89],"or,":[90],"not,":[91],"parity}":[92],"unbounded":[94],"fan-in).":[95],"Grinberg,":[96,225],"Shaltiel":[97,174,226],"Viola":[99,228],"(FOCS":[100,182],"2018)":[101],"(building":[102],"sequence":[105],"earlier":[107],"works)":[108],"showed":[109],"these":[111],"limitations":[112,223],"be":[114],"circumvented":[115],"black-box":[117,213,278],"reductions.":[118,269],"Namely,":[119],"reductions":[121,156,165,171,239,261],"$${\\rm":[122],"Red}^{(\\cdot)}$$":[123],"given":[125,194],"oracle":[126,195,199,283],"access":[127,196],"D":[131,200],"violates":[133,144],"conclusion":[135],"lemma,":[139],"implement":[140],"assumption":[146],"lemma.":[150,248],"There":[151],"are":[152,167,184,188],"few":[154],"known":[155],"related":[159],"literature":[160],"worst-case":[162],"average-case":[164],"non-black-box.":[168],"Specifically,":[169],"Gutfreund,":[173],"Ta-Shma":[176],"(Computational":[177],"Complexity":[178],"2007)":[179],"Hirahara":[181],"2018))":[183],"\u201cclass":[185],"reductions\u201d":[186],"only":[189],"guaranteed":[190],"succeed":[192],"when":[193],"an":[198,289],"from":[201],"some":[202,212],"efficient":[203,290],"algorithms.":[206],"These":[207],"works":[208],"seem":[209],"circumvent":[211],"impossibility":[214],"results.":[215],"In":[216],"paper,":[218],"extend":[220],"previous":[222,274],"several":[230],"types":[231],"reductions,":[234,279],"giving":[235],"evidence":[236],"yield":[241],"desired":[243],"improvements":[244],"To":[249],"best":[251],"our":[253],"knowledge,":[254],"is":[256,293],"first":[258],"limitation":[259],"amplification":[264],"applies":[266],"Our":[270],"technique":[271],"imitates":[272],"lower":[275],"bounds":[276],"replacing":[280],"inefficient":[282],"used":[284],"proof,":[287],"one":[291],"based":[294],"limited":[296],"independence,":[297],"developing":[299],"tools":[300],"deal":[302],"technical":[305],"difficulties":[306],"arise":[308],"following":[309],"replacement.":[311]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}