{"id":"https://openalex.org/W3158015690","doi":"https://doi.org/10.1145/3406325.3451121","title":"Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity","display_name":"Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3158015690","doi":"https://doi.org/10.1145/3406325.3451121","mag":"3158015690"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451121","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yanyi Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yanyi Liu","raw_affiliation_strings":["Cornell University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081609749","display_name":"Rafael Pass","orcid":"https://orcid.org/0000-0001-7440-5690"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rafael Pass","raw_affiliation_strings":["Cornell University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05225069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2021","issue":null,"first_page":"722","last_page":"735"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9948999881744385,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9948999881744385,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9855999946594238,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9783999919891357,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.9294275045394897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6522619724273682},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6514518857002258},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.617284893989563},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6063225269317627},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5129725337028503},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4638957977294922},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.45800164341926575},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4261518120765686},{"id":"https://openalex.org/keywords/uniform-boundedness","display_name":"Uniform boundedness","score":0.414380818605423},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08580303192138672},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06389877200126648}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.9294275045394897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6522619724273682},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6514518857002258},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.617284893989563},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6063225269317627},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5129725337028503},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4638957977294922},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.45800164341926575},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4261518120765686},{"id":"https://openalex.org/C90377204","wikidata":"https://www.wikidata.org/wiki/Q1052594","display_name":"Uniform boundedness","level":3,"score":0.414380818605423},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08580303192138672},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06389877200126648},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3406325.3451121","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"mag:3197591422","is_oa":false,"landing_page_url":"https://eprint.iacr.org/2021/517.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2764847869","display_name":"IACR Cryptology ePrint Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":["https://openalex.org/P4322614454"],"host_organization_lineage_names":["Cryptology ePrint Archive"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Cryptology ePrint Archive","raw_type":null},{"id":"mag:3158015690","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc28.html#LiuP21","pdf_url":null,"source":{"id":"https://openalex.org/S4306509107","display_name":"Electron. Colloquium Comput. Complex.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G928242395","display_name":null,"funder_award_id":"SATC-1704788,RI-1703846","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482558212","https://openalex.org/W1538406570","https://openalex.org/W1966819396","https://openalex.org/W1994584977","https://openalex.org/W1997643965","https://openalex.org/W2004974518","https://openalex.org/W2005097301","https://openalex.org/W2015880590","https://openalex.org/W2017520109","https://openalex.org/W2078472124","https://openalex.org/W2108585502","https://openalex.org/W2125218823","https://openalex.org/W2131798840","https://openalex.org/W2159841662","https://openalex.org/W2165813048","https://openalex.org/W2625217561","https://openalex.org/W2794956177","https://openalex.org/W2884999233","https://openalex.org/W2888250735","https://openalex.org/W2951756435","https://openalex.org/W2952032520","https://openalex.org/W2964773335","https://openalex.org/W2967083823","https://openalex.org/W2971710618","https://openalex.org/W2972703483","https://openalex.org/W3034183797","https://openalex.org/W4210300416","https://openalex.org/W6776740623"],"related_works":["https://openalex.org/W3197591422","https://openalex.org/W1702487489","https://openalex.org/W3170725852","https://openalex.org/W2152561478","https://openalex.org/W2949310842","https://openalex.org/W2945324225","https://openalex.org/W2402942645","https://openalex.org/W1534635560","https://openalex.org/W3198718099","https://openalex.org/W3005666252","https://openalex.org/W2949566844","https://openalex.org/W2020505980","https://openalex.org/W2150806094","https://openalex.org/W2950519981","https://openalex.org/W1205694693","https://openalex.org/W3197942683","https://openalex.org/W2053805167","https://openalex.org/W3182571019","https://openalex.org/W3133665495","https://openalex.org/W2574098572"],"abstract_inverted_index":{"Let":[0],"MKtP[s]":[1],"be":[2],"the":[3,16,21,54,59,78,183],"set":[4],"of":[5,20,35,51,61,80,108,119,157,185],"strings":[6],"x":[7],"such":[8,67,86],"that":[9,30,68,87,131,172],"Kt(x)":[10,14],"\u2264":[11],"s(|x|),":[12],"where":[13,139],"denotes":[15],"t-bounded":[17],"Kolmogorov":[18],"complexity":[19],"truthtable":[22],"described":[23],"by":[24,168],"x.":[25],"Our":[26],"main":[27],"theorem":[28],"shows":[29],"for":[31,39,102,203],"an":[32],"appropriate":[33],"notion":[34],"mild":[36,116],"average-case":[37,91,117,201],"hardness,":[38],"every":[40,47],"\u03b5>0,":[41],"polynomial":[42],"t(n)":[43],"\u2265":[44],"(1+\u03b5)n,":[45],"and":[46,197],"\u201cnice\u201d":[48],"class":[49],"F":[50,66,85],"super-polynomial":[52],"functions,":[53],"following":[55],"are":[56],"equivalent:":[57],"(i)":[58],"existence":[60,79,107,184],"some":[62,81,103],"function":[63,82],"T":[64,83],"\u2208":[65,84],"T-hard":[69,137],"one-way":[70],"functions":[71],"(OWF)":[72],"exists":[73],"(with":[74,99],"non-uniform":[75,97,126],"security);":[76],"(ii)":[77],"MKtP[T\u22121]":[88],"is":[89,113,178,189,199],"mildly":[90,200],"hard":[92,191,202],"with":[93],"respect":[94],"to":[95,115,135,152,176,180],"sublinear-time":[96,125,162,195],"algorithms":[98],"running-time":[100],"n\u03b4":[101],"0<\u03b4<1).":[104],"For":[105],"instance,":[106],"subexponentially-hard":[109],"(resp.":[110,122],"quasi-poly-nomially-hard)":[111],"OWFs":[112,138],"equivalent":[114],"hardness":[118,156],"MKtP[poly":[120],"logn]":[121],"MKtP[2O(\u221alogn))])":[123],"w.r.t.":[124,142,159,192],"algorithms.":[127,207],"We":[128,164],"additionally":[129],"note":[130],"if":[132],"we":[133],"want":[134],"deduce":[136,182],"security":[140],"holds":[141],"uniform":[143,160,193],"T-time":[144],"probabilistic":[145,161,194],"attackers":[146],"(i.e.,":[147],"uniformly-secure":[148],"OWFs),":[149],"it":[150],"suffices":[151],"assume":[153],"sublinear":[154],"time":[155],"MKtP":[158],"attackers.":[163],"complement":[165],"this":[166],"result":[167],"proving":[169],"lower":[170],"bounds":[171],"come":[173],"surprisingly":[174],"close":[175],"what":[177],"required":[179],"unconditionally":[181],"(uniformly-secure)":[186],"OWFs:":[187],"MKtP[polylogn]":[188],"worst-case":[190],"algorithms,":[196],"MKtP[n\u2212logn]":[198],"all":[204],"O(t(n)/n3)-time":[205],"deterministic":[206]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-05-10T00:00:00"}