{"id":"https://openalex.org/W7119477805","doi":"https://doi.org/10.62056/akjby76bm","title":"FRIttata: A FRI-based Polynomial Commitment Scheme for Distributed Proof Generation","display_name":"FRIttata: A FRI-based Polynomial Commitment Scheme for Distributed Proof Generation","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119477805","doi":"https://doi.org/10.62056/akjby76bm"},"language":"en","primary_location":{"id":"doi:10.62056/akjby76bm","is_oa":true,"landing_page_url":"https://doi.org/10.62056/akjby76bm","pdf_url":"https://cic.iacr.org/p/2/4/26/pdf","source":{"id":"https://openalex.org/S4394708374","display_name":"IACR Communications in Cryptology","issn_l":"3006-5496","issn":["3006-5496"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320989","host_organization_name":"International Association for Cryptologic Research","host_organization_lineage":["https://openalex.org/P4310320989"],"host_organization_lineage_names":["International Association for Cryptologic Research"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Communications in Cryptology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://cic.iacr.org/p/2/4/26/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122326507","display_name":"Hua Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Hua Xu","raw_affiliation_strings":["COSIC, KU Leuven"],"raw_orcid":"https://orcid.org/0009-0007-1972-7815","affiliations":[{"raw_affiliation_string":"COSIC, KU Leuven","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Mariana Gama","orcid":"https://orcid.org/0000-0002-2759-043X"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Mariana Gama","raw_affiliation_strings":["COSIC, KU Leuven"],"raw_orcid":"https://orcid.org/0000-0002-2759-043X","affiliations":[{"raw_affiliation_string":"COSIC, KU Leuven","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008723906","display_name":"Emad Heydari Beni","orcid":"https://orcid.org/0000-0003-3352-6968"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Emad Beni","raw_affiliation_strings":["COSIC, KU Leuven","Nokia Bell Labs"],"raw_orcid":"https://orcid.org/0000-0003-3352-6968","affiliations":[{"raw_affiliation_string":"COSIC, KU Leuven","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Nokia Bell Labs","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045098077","display_name":"Jiayi Kang","orcid":"https://orcid.org/0000-0002-1093-7978"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Jiayi Kang","raw_affiliation_strings":["COSIC, KU Leuven"],"raw_orcid":"https://orcid.org/0000-0002-1093-7978","affiliations":[{"raw_affiliation_string":"COSIC, KU Leuven","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0477855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.36309999227523804,"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.36309999227523804,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.2117999941110611,"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/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.19210000336170197,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8417999744415283},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6238999962806702},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6014000177383423},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.583299994468689},{"id":"https://openalex.org/keywords/random-oracle","display_name":"Random oracle","score":0.5457000136375427},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47350001335144043},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4271000027656555},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.36880001425743103}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8417999744415283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7432000041007996},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6238999962806702},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6014000177383423},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.583299994468689},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.5457000136375427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48170000314712524},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36489999294281006},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3418999910354614},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.3393999934196472},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.31529998779296875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C64341305","wikidata":"https://www.wikidata.org/wiki/Q4919225","display_name":"Bivariate analysis","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C91399829","wikidata":"https://www.wikidata.org/wiki/Q1115684","display_name":"Commitment scheme","level":3,"score":0.28839999437332153},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.2775000035762787},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.62056/akjby76bm","is_oa":true,"landing_page_url":"https://doi.org/10.62056/akjby76bm","pdf_url":"https://cic.iacr.org/p/2/4/26/pdf","source":{"id":"https://openalex.org/S4394708374","display_name":"IACR Communications in Cryptology","issn_l":"3006-5496","issn":["3006-5496"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320989","host_organization_name":"International Association for Cryptologic Research","host_organization_lineage":["https://openalex.org/P4310320989"],"host_organization_lineage_names":["International Association for Cryptologic Research"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Communications in Cryptology","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.62056/akjby76bm","is_oa":true,"landing_page_url":"https://doi.org/10.62056/akjby76bm","pdf_url":"https://cic.iacr.org/p/2/4/26/pdf","source":{"id":"https://openalex.org/S4394708374","display_name":"IACR Communications in Cryptology","issn_l":"3006-5496","issn":["3006-5496"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320989","host_organization_name":"International Association for Cryptologic Research","host_organization_lineage":["https://openalex.org/P4310320989"],"host_organization_lineage_names":["International Association for Cryptologic Research"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Communications in Cryptology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6220799212","display_name":"Cybersecurity Research Program Flanders \u2013 second cycle","funder_award_id":"VOEWICS02","funder_id":"https://openalex.org/F4320327336","funder_display_name":"Vlaamse regering"}],"funders":[{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7119477805.pdf","grobid_xml":"https://content.openalex.org/works/W7119477805.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1589034595","https://openalex.org/W1909324101","https://openalex.org/W2102421735","https://openalex.org/W2102526737","https://openalex.org/W2496543269","https://openalex.org/W2536319456","https://openalex.org/W2885314357","https://openalex.org/W2990120385","https://openalex.org/W2991016858","https://openalex.org/W3015343560","https://openalex.org/W3126633261","https://openalex.org/W3213340422","https://openalex.org/W4308641862","https://openalex.org/W4365808257","https://openalex.org/W4389897546","https://openalex.org/W4402264553","https://openalex.org/W4405181164","https://openalex.org/W4411337569","https://openalex.org/W4416866368"],"related_works":[],"abstract_inverted_index":{"We":[0,126],"present":[1,80],"the":[2,25,92,129,176],"first":[3,177],"horizontally":[4,178],"scalable":[5,53,179],"polynomial":[6,27],"commitment":[7],"scheme":[8],"(PCS)":[9],"that":[10,69,116,152,181],"is":[11,175],"both":[12],"transparent":[13,97],"and":[14,51,66,98,134,166,188,196],"plausibly":[15,99],"post-quantum":[16],"(PQ)":[17],"secure.":[18],"This":[19],"PCS":[20,83,180],"can":[21],"be":[22],"combined":[23],"with":[24],"distributed":[26,142,160],"interactive":[28],"oracle":[29],"proof":[30,169],"(PIOP)":[31],"introduced":[32],"in":[33],"Pianist":[34,50,93],"(IEEE":[35],"S&":[36],"P":[37],"2024),":[38],"which":[39],"achieves":[40,95,183],"linear":[41],"scalability":[42,165],"by":[43,145],"encoding":[44],"witnesses":[45],"using":[46],"bivariate":[47,82],"polynomials.":[48],"While":[49],"other":[52],"SNARK":[54],"systems":[55],"offer":[56],"strong":[57],"performance":[58,147],"profiles,":[59],"they":[60],"rely":[61],"on":[62,85],"trusted":[63],"setup":[64],"ceremonies":[65],"cryptographic":[67],"assumptions":[68],"are":[70],"not":[71],"PQ":[72,100,186],"secure,":[73],"e.g.,":[74],"pairing-based":[75],"primitives.":[76],"In":[77],"contrast,":[78],"we":[79,110],"a":[81,96,105,113,189],"based":[84],"FRI,":[86,143],"which,":[87],"when":[88],"used":[89],"to":[90,158],"compile":[91],"PIOP,":[94],"alternative.":[101],"Distributed":[102],"FRI":[103,124,161],"has":[104],"high":[106],"communication":[107,155],"cost.":[108],"Therefore,":[109],"introduce":[111],"Fold-and-Batch,":[112],"customizable":[114],"technique":[115],"applies":[117],"partial":[118],"folding":[119],"locally":[120],"before":[121],"performing":[122],"batched":[123],"centrally.":[125],"formally":[127],"prove":[128],"security":[130],"of":[131,141],"our":[132,172],"constructions":[133],"provide":[135],"an":[136],"implementation":[137],"for":[138],"three":[139],"variants":[140],"accompanied":[144],"thorough":[146],"evaluations.":[148],"Our":[149],"results":[150],"show":[151],"Fold-and-Batch":[153],"reduces":[154],"overhead":[156],"compared":[157],"existing":[159],"approaches,":[162],"while":[163],"preserving":[164],"maintaining":[167],"moderate":[168],"sizes.":[170],"To":[171],"knowledge,":[173],"this":[174],"simultaneously":[182],"transparency,":[184],"plausible":[185],"security,":[187],"tunable":[190],"tradeoff":[191],"between":[192],"efficiency,":[193],"verifier":[194],"cost,":[195],"communication.":[197]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-01-09T00:00:00"}