{"id":"https://openalex.org/W7128616165","doi":"https://doi.org/10.1109/focs63196.2025.00021","title":"Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions","display_name":"Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128616165","doi":"https://doi.org/10.1109/focs63196.2025.00021"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00021","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00021","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","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":"https://openalex.org/A5015399980","display_name":"George Lu","orcid":"https://orcid.org/0009-0000-6178-461X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George Lu","raw_affiliation_strings":["UT Austin,Department of Computer Science,Austin,USA"],"affiliations":[{"raw_affiliation_string":"UT Austin,Department of Computer Science,Austin,USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086894856","display_name":"Jad Silbak","orcid":"https://orcid.org/0009-0003-3298-5094"},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Jad Silbak","raw_affiliation_strings":["MIT CSAIL MIT,Boston,USA"],"affiliations":[{"raw_affiliation_string":"MIT CSAIL MIT,Boston,USA","institution_ids":["https://openalex.org/I4210109586","https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058929075","display_name":"Daniel Wichs","orcid":"https://orcid.org/0000-0002-4981-1643"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Wichs","raw_affiliation_strings":["Northeastern University and NTT Research,Khoury College of Computer Science,Boston,USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University and NTT Research,Khoury College of Computer Science,Boston,USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015399980"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.88186392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.11559999734163284,"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.11559999734163284,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.11389999836683273,"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/T11130","display_name":"Coding theory and cryptography","score":0.07249999791383743,"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/bounded-function","display_name":"Bounded function","score":0.7024999856948853},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5640000104904175},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.5041000247001648},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4772999882698059},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.439300000667572},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4262999892234802},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3691999912261963},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.33799999952316284},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.33309999108314514}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7024999856948853},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5640000104904175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5054000020027161},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.5041000247001648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4893999993801117},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4772999882698059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4724999964237213},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4296000003814697},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4262999892234802},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3691999912261963},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.33309999108314514},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.32910001277923584},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.3269999921321869},{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.32670000195503235},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3172999918460846},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2858000099658966},{"id":"https://openalex.org/C128040838","wikidata":"https://www.wikidata.org/wiki/Q1810628","display_name":"Pseudorandom binary sequence","level":3,"score":0.27880001068115234},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25839999318122864}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00021","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00021","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.41801175475120544,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,11],"study":[1],"error-detection":[2],"and":[3,19,37,52,83,208],"error-correction":[4],"codes":[5,14,155,200,239],"for":[6,89,109,240,259],"computationally":[7,90],"bounded":[8,54],"adversarial":[9,32],"channels.":[10,92],"consider":[12],"seeded":[13],"where":[15],"the":[16,47,62,110,129,143,158,235,264],"polynomial-time":[17,41],"encoding":[18],"decoding":[20],"procedures":[21],"share":[22],"a":[23,53,122,174,229,245],"public":[24],"random":[25],"seed,":[26],"but":[27],"are":[28],"otherwise":[29],"deterministic.":[30],"An":[31],"channel":[33],"gets":[34],"this":[35,150,241],"seed":[36],"can":[38,168,219],"perform":[39],"arbitrary":[40],"computation":[42],"to":[43,49,58,61,68,141],"adaptively":[44],"select":[45],"both":[46],"message":[48],"be":[50,59,171],"encoded":[51],"number":[55],"of":[56,125,146,161,176,226,234,249],"errors":[57,73,132,227],"added":[60],"resulting":[63],"codeword.":[64],"The":[65],"goal":[66],"is":[67],"detect":[69],"or":[70,135,183,187,191],"correct":[71,221],"such":[72,180],"with":[74,131,228],"overwhelming":[75],"probability,":[76],"while":[77],"achieving":[78],"better":[79],"trade-offs":[80],"between":[81],"rate":[82,204,230],"error":[84,197,210,216,242],"tolerance":[85,211],"than":[86],"those":[87],"possible":[88],"unbounded":[91],"For":[93,196,215],"large":[94],"alphabets,":[95],"prior":[96,113],"work":[97],"(ITCS":[98],"\u201825)":[99,118],"achieves":[100],"essentially":[101,202],"optimal":[102,203],"parameters":[103],"under":[104,128,173,263],"minimal":[105],"cryptographic":[106,139,178,266],"assumptions.":[107],"However,":[108],"binary":[111,154],"alphabet,":[112],"works":[114],"(TCC":[115],"\u201820,":[116],"EUROCRYPT":[117],"either":[119],"only":[120],"achieved":[121],"weaker":[123],"notion":[124,145,160],"selective":[126],"security":[127,163],"learning":[130],"(LWE)":[133],"assumption,":[134],"relied":[136],"on":[137],"non-standard":[138],"assumptions":[140,179,267],"get":[142,201],"full":[144,159],"adaptive":[147,162],"security.":[148],"In":[149],"work,":[151],"we":[152,253],"construct":[153,254],"that":[156,233],"achieve":[157],"assuming":[164],"trapdoor":[165],"hashing,":[166],"which":[167],"in":[169],"turn":[170],"instantiated":[172],"variety":[175],"standard":[177,265],"as":[181],"LWE,":[182],"Decisional":[184,192],"DiffieHellman":[185],"(DDH),":[186],"Quadratic":[188],"Residuosity":[189,194],"(QR),":[190],"Composite":[193],"(DCR).":[195],"detection,":[198],"our":[199],"$R":[205],"\\approx":[206,213],"1$":[207],"relative":[209],"$p":[212],"\\frac{1}{2}$.":[214],"correction,":[217],"they":[218],"uniquely":[220],"$p\\lt1":[222],"/":[223],"4$":[224],"fraction":[225],"R":[231],"matching":[232],"best":[236],"known":[237],"list-decodable":[238],"tolerance.":[243],"As":[244],"central":[246],"technical":[247],"tool":[248],"potentially":[250],"independent":[251],"interest,":[252],"multi-input":[255],"correlation":[256],"intractable":[257],"hashing":[258],"\u201cshifted":[260],"output":[261],"relations\u201d":[262],"above.":[268]},"counts_by_year":[],"updated_date":"2026-02-13T13:36:01.753593","created_date":"2026-02-12T00:00:00"}