{"id":"https://openalex.org/W7128613222","doi":"https://doi.org/10.1109/focs63196.2025.00091","title":"On Succinct Obfuscation via Propositional Proofs","display_name":"On Succinct Obfuscation via Propositional Proofs","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128613222","doi":"https://doi.org/10.1109/focs63196.2025.00091"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00091","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/A5125663559","display_name":"Abhishek Jain","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103733","display_name":"Shandong Xiehe University","ror":"https://ror.org/01bx4e159","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210103733"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Abhishek Jain","raw_affiliation_strings":["NTT Research & JHU"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Research & JHU","institution_ids":["https://openalex.org/I4210103733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005453022","display_name":"Zhengzhong Jin","orcid":"https://orcid.org/0000-0002-2233-3768"},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Zhengzhong Jin","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027918715","display_name":"Surya Mathialagan","orcid":"https://orcid.org/0000-0003-4904-3637"},"institutions":[{"id":"https://openalex.org/I4210105847","display_name":"NTT Basic Research Laboratories","ror":"https://ror.org/01m2pas06","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210105847"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Surya Mathialagan","raw_affiliation_strings":["NTT Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Research","institution_ids":["https://openalex.org/I4210105847"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035828031","display_name":"Omer Paneth","orcid":"https://orcid.org/0000-0001-8561-1123"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Omer Paneth","raw_affiliation_strings":["Tel Aviv University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5175,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.94401072,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1703","last_page":"1740"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.8842999935150146,"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.8842999935150146,"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/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.061000000685453415,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11424","display_name":"Security and Verification in Computing","score":0.008299999870359898,"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/obfuscation","display_name":"Obfuscation","score":0.8123000264167786},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6582000255584717},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.491100013256073},{"id":"https://openalex.org/keywords/bootstrapping","display_name":"Bootstrapping (finance)","score":0.4684000015258789},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.46309998631477356},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4546999931335449},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4133000075817108},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3986000120639801},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.3837999999523163}],"concepts":[{"id":"https://openalex.org/C40305131","wikidata":"https://www.wikidata.org/wiki/Q2616305","display_name":"Obfuscation","level":2,"score":0.8123000264167786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6844000220298767},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6582000255584717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5652999877929688},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.491100013256073},{"id":"https://openalex.org/C207609745","wikidata":"https://www.wikidata.org/wiki/Q4944086","display_name":"Bootstrapping (finance)","level":2,"score":0.4684000015258789},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.46309998631477356},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4546999931335449},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3986000120639801},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.3837999999523163},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.3790000081062317},{"id":"https://openalex.org/C2780746774","wikidata":"https://www.wikidata.org/wiki/Q17014981","display_name":"Functional encryption","level":4,"score":0.34619998931884766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33000001311302185},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.3190000057220459},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.2922999858856201},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2824999988079071},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2784000039100647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2768000066280365},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C182776695","wikidata":"https://www.wikidata.org/wiki/Q840661","display_name":"Ciphertext indistinguishability","level":5,"score":0.26600000262260437},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00091","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"central":[1],"line":[2],"of":[3,8,17,34,85,88,95,104,113,124,131,139,182,240,262,276,286,294,329,352],"inquiry":[4],"in":[5,74,246],"the":[6,15,18,32,35,40,46,59,62,83,86,93,114,129,137,140,147,152,179,238,269,274,277,284,287,302,318,326,343,350,353],"study":[7],"indistinguishability":[9],"obfuscation":[10,36,189],"(IO)":[11],"is":[12,116,163,280],"to":[13,24,57,186,198,205,299],"minimize":[14],"size":[16,33,42,64,130,138,275,285,345,351],"obfuscation.":[19,90],"Today":[20],"we":[21,81,173,195],"know":[22],"how":[23,56,197,298],"obfuscate":[25],"programs":[26,68],"represented":[27,337],"as":[28,190],"Turing":[29],"machines,":[30,161],"where":[31,69,128,273,342],"grows":[37,135],"only":[38,134],"with":[39,45,99,136,146,151,156,219,231,320,349],"input":[41,63,153],"and":[43,51,144,171,256,266],"not":[44,145,347],"machine\u2019s":[47],"running":[48],"time.":[49],"Jain":[50],"Jin":[52],"[FOCS":[53],"2022]":[54],"showed":[55],"remove":[58],"dependency":[60],"on":[61,215],"for":[65,159,169,178,229,290,334],"functionally":[66],"equivalent":[67],"equivalence":[70],"can":[71,106,243],"be":[72,107,244],"proven":[73,245],"Cook\u2019s":[75],"theory":[76,247],"PV.":[77,248],"In":[78],"this":[79],"work":[80],"investigate":[82],"limits":[84],"pursuit":[87],"succinct":[89,126,176,192,202,216,224,264,330],"We":[91,118,184,234,249,258],"consider":[92],"task":[94],"obfuscating":[96,305],"a":[97,100,121,291,308,321],"program":[98,133,279,289,303],"large":[101,292],"description,":[102],"most":[103],"which":[105,162],"made":[108],"public":[109,148,322],"while":[110],"some":[111],"portion":[112],"description":[115],"secret.":[117],"put":[119],"forth":[120],"new":[122],"notion":[123],"fully":[125,175,191,201,263],"IO":[127,158,168,177,208,265,271],"obfuscated":[132,278],"program\u2019s":[141],"secret":[142,332],"part":[143,149],"or":[150,227],"size.":[154],"Starting":[155],"input-succinct":[157],"PV-equivalent":[160],"known":[164],"from":[165],"super-polynomially":[166],"hard":[167],"circuits":[170,341],"LWE,":[172],"construct":[174],"same":[180],"class":[181,293],"programs.":[183],"refer":[185],"such":[187],"an":[188],"pv-IO.":[193],"Next,":[194],"show":[196,250,297],"bootstrap":[199],"our":[200],"$\\mathbf{p":[203],"v}$-IO":[204],"achieve":[206],"full":[207],"security.":[209],"Our":[210],"bootstrapping":[211],"theorems":[212],"are":[213,254],"based":[214],"cryptographic":[217],"primitives":[218,242],"seemingly":[220],"weaker":[221],"functionality:":[222],"either":[223],"witness":[225],"encryption":[226],"SNARGs":[228],"NP":[230],"unique":[232],"proofs.":[233],"also":[235],"require":[236],"that":[237,251],"correctness":[239],"these":[241,252],"assumptions":[253],"sufficient":[255],"necessary.":[257],"demonstrate":[259],"several":[260],"applications":[261],"pv-IO:(i)We":[267],"give":[268,325],"first":[270,327],"construction":[272,328],"less":[281],"than":[282],"twice":[283],"original":[288],"useful":[295],"programs.(ii)We":[296],"avoid":[300],"padding":[301,319],"before":[304],"it":[306],"\u2013":[307,315],"step":[309],"often":[310],"necessitated":[311],"by":[312,316,338],"security":[313],"analysis":[314],"replacing":[317],"random":[323],"string.(iii)We":[324],"computational":[331],"sharing":[333],"access":[335,354],"structures":[336],"polynomial-size":[339],"monotone":[340],"share":[344],"does":[346],"grow":[348],"structure.":[355]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-12T00:00:00"}