{"id":"https://openalex.org/W4414869547","doi":"https://doi.org/10.62056/abvur-iuc","title":"Practical Batch Proofs of Exponentiation","display_name":"Practical Batch Proofs of Exponentiation","publication_year":2025,"publication_date":"2025-10-06","ids":{"openalex":"https://openalex.org/W4414869547","doi":"https://doi.org/10.62056/abvur-iuc"},"language":"en","primary_location":{"id":"doi:10.62056/abvur-iuc","is_oa":true,"landing_page_url":"https://doi.org/10.62056/abvur-iuc","pdf_url":"https://cic.iacr.org/p/2/3/9/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/3/9/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008907363","display_name":"Charlotte Hoffmann","orcid":"https://orcid.org/0000-0003-2027-5549"},"institutions":[{"id":"https://openalex.org/I4210143702","display_name":"Institut Sains dan Teknologi Al-Kamal","ror":"https://ror.org/044nhav08","country_code":"ID","type":"education","lineage":["https://openalex.org/I4210143702"]}],"countries":["ID"],"is_corresponding":true,"raw_author_name":"Charlotte Hoffmann","raw_affiliation_strings":["ISTA"],"raw_orcid":"https://orcid.org/0000-0003-2027-5549","affiliations":[{"raw_affiliation_string":"ISTA","institution_ids":["https://openalex.org/I4210143702"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005607969","display_name":"Pavel Hub\u00e1\u010dek","orcid":"https://orcid.org/0000-0002-6850-6222"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Hub\u00e1\u010dek","raw_affiliation_strings":["Charles University, Faculty of Mathematics and Physics","Institute of Mathematics, Czech Academy of Sciences"],"raw_orcid":"https://orcid.org/0000-0002-6850-6222","affiliations":[{"raw_affiliation_string":"Charles University, Faculty of Mathematics and Physics","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Institute of Mathematics, Czech Academy of Sciences","institution_ids":["https://openalex.org/I4210120266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119867258","display_name":"Svetlana Ivanova","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Svetlana Ivanova","raw_affiliation_strings":["Charles University, Faculty of Mathematics and Physics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Faculty of Mathematics and Physics","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008907363"],"corresponding_institution_ids":["https://openalex.org/I4210143702"],"apc_list":null,"apc_paid":null,"fwci":2.0776,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.90303432,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"2","issue":"3","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.9991999864578247,"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.9991999864578247,"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/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9936000108718872,"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/exponentiation","display_name":"Exponentiation","score":0.8434000015258789},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7228000164031982},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.6658999919891357},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.5325000286102295},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.39899998903274536},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.37860000133514404},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.33149999380111694}],"concepts":[{"id":"https://openalex.org/C81539297","wikidata":"https://www.wikidata.org/wiki/Q33456","display_name":"Exponentiation","level":2,"score":0.8434000015258789},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7228000164031982},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.6658999919891357},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6255000233650208},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.5325000286102295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4032999873161316},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.37860000133514404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.349700003862381},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32910001277923584},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.32100000977516174},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C52723943","wikidata":"https://www.wikidata.org/wiki/Q1127410","display_name":"Serialization","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2581000030040741}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.62056/abvur-iuc","is_oa":true,"landing_page_url":"https://doi.org/10.62056/abvur-iuc","pdf_url":"https://cic.iacr.org/p/2/3/9/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"},{"id":"pmh:oai:pub.research-explorer.ista.ac.at:20701","is_oa":true,"landing_page_url":"https://research-explorer.ista.ac.at/record/20701","pdf_url":null,"source":{"id":"https://openalex.org/S7407055285","display_name":"Institute of Science and Technology Austria","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoffmann C, Hub\u00e1\u010dek P, Ivanova S. Practical batch proofs of exponentiation. <i>Cryptology ePrint Archive</i>.","raw_type":"http://purl.org/coar/resource_type/c_816b"}],"best_oa_location":{"id":"doi:10.62056/abvur-iuc","is_oa":true,"landing_page_url":"https://doi.org/10.62056/abvur-iuc","pdf_url":"https://cic.iacr.org/p/2/3/9/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414869547.pdf","grobid_xml":"https://content.openalex.org/works/W4414869547.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W168976633","https://openalex.org/W1490394993","https://openalex.org/W1565378600","https://openalex.org/W1589034595","https://openalex.org/W1632088469","https://openalex.org/W1909324101","https://openalex.org/W2047000063","https://openalex.org/W2056993901","https://openalex.org/W2109365902","https://openalex.org/W2136975477","https://openalex.org/W2164988972","https://openalex.org/W2776394487","https://openalex.org/W2795301572","https://openalex.org/W2884026699","https://openalex.org/W2885172320","https://openalex.org/W2899466157","https://openalex.org/W2912274982","https://openalex.org/W2927551711","https://openalex.org/W2969756126","https://openalex.org/W2990498574","https://openalex.org/W3014073258","https://openalex.org/W3138063853","https://openalex.org/W3147459559","https://openalex.org/W3187842930","https://openalex.org/W3196780870","https://openalex.org/W3204458480","https://openalex.org/W3213153633","https://openalex.org/W3214715484","https://openalex.org/W4205630623","https://openalex.org/W4243024017","https://openalex.org/W4247266746","https://openalex.org/W4312730681","https://openalex.org/W4312753175","https://openalex.org/W4317927042","https://openalex.org/W4367663806","https://openalex.org/W4385654278","https://openalex.org/W4385654747","https://openalex.org/W4389010937","https://openalex.org/W4394595369","https://openalex.org/W4410137597"],"related_works":[],"abstract_inverted_index":{"A":[0],"Proof":[1],"of":[2,28,38,71,73,108,123,138,145,155,176,178,189,196,203,210,215,220,222,240,259,280,283,291,315,322,333,336,341,359,367,371],"Exponentiation":[3],"(PoE)":[4],"allows":[5],"a":[6,11,76,136,248,296,312,330,352],"prover":[7,361],"to":[8,79,128,173,272,350],"efficiently":[9],"convince":[10],"verifier":[12],"that":[13,104,118,231,246],"<mml:math":[14],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[15],"<mml:mrow>":[16],"<mml:mi>y</mml:mi>":[17],"<mml:mo>=</mml:mo>":[18],"<mml:msup>":[19],"<mml:mi>x</mml:mi>":[20],"<mml:mi>e</mml:mi>":[21],"</mml:msup>":[22],"</mml:mrow>":[23],"</mml:math>":[24],"in":[25,44,52,192,295,307,339],"some":[26],"group":[27,197],"unknown":[29,179,342],"order.":[30,180],"PoEs":[31,62,103,122,317],"are":[32,46,63,269],"the":[33,81,119,130,143,162,174,187,190,193,200,208,227,235,257,281,284,304,334,357,360,368],"basis":[34],"for":[35,48,68,83,218,355],"practical":[36],"constructions":[37],"Verifiable":[39],"Delay":[40],"Functions":[41],"(VDFs),":[42],"which,":[43],"turn,":[45],"important":[47,301],"various":[49],"higher-level":[50],"protocols":[51,67],"distributed":[53,59],"computing.":[54],"In":[55,96],"applications":[56],"such":[57,92,252],"as":[58],"consensus,":[60],"many":[61],"generated":[64],"regularly,":[65],"motivating":[66],"secure":[69,289,353],"aggregation":[70],"batches":[72],"statements":[74,78],"into":[75],"few":[77],"improve":[80,129],"efficiency":[82,132],"both":[84,106,234],"parties.":[85],"Rotem":[86,109,124],"(TCC":[87],"2021)":[88],"recently":[89],"presented":[90],"two":[91,101,120],"generic":[93],"batch":[94,102,121,153,183,229,316,345],"PoEs.":[95],"this":[97],"work,":[98],"we":[99,111,116,141,275,310],"introduce":[100],"outperform":[105],"proposals":[107],"and":[110,148,158,205,238],"evaluate":[112],"their":[113,166],"practicality.":[114],"First,":[115],"show":[117,159,245,327],"can":[125,169,347],"be":[126,170,348],"combined":[127],"overall":[131],"by":[133,212],"at":[134],"least":[135],"factor":[137],"two.":[139],"Second,":[140],"revisit":[142],"work":[144],"Bellare,":[146],"Garay":[147],"Rabin":[149],"(EUROCRYPT":[150],"1998)":[151],"on":[152],"verification":[154],"digital":[156],"signatures":[157],"that,":[160,328],"under":[161,329],"low":[163,285],"order":[164,214,286],"assumption,":[165],"bucket":[167],"test":[168],"securely":[171],"adapted":[172],"setting":[175,303],"groups":[177,340],"The":[181],"resulting":[182,294],"PoE":[184,230,264,292,346],"quickly":[185],"outperforms":[186],"state":[188],"art":[191],"expected":[194],"number":[195,202,370],"multiplications":[198],"with":[199,362],"growing":[201],"instances,":[204,293],"it":[206,225],"decreases":[207,233],"cost":[209],"batching":[211,290],"an":[213,277],"magnitude":[216],"already":[217],"hundreds":[219],"thousands":[221],"instances.":[223],"Importantly,":[224],"is":[226,300],"first":[228],"significantly":[232],"proof":[236,267],"size":[237],"complexity":[239,365],"verification.":[241],"Our":[242,266],"experimental":[243],"evaluations":[244],"even":[247],"non-optimized":[249],"implementation":[250],"achieves":[251],"improvements,":[253],"which":[254,299],"would":[255],"match":[256],"demands":[258],"real-life":[260],"systems":[261],"requiring":[262],"large-scale":[263],"processing.":[265],"techniques":[268],"conceptually":[270],"similar":[271],"Rotem.":[273],"However,":[274],"give":[276],"improved":[278],"analysis":[279],"application":[282,314],"assumption":[287],"towards":[288,318],"tight":[297],"reduction,":[298],"when":[302],"security":[305],"parameter":[306],"practice.":[308],"Finally,":[309],"discuss":[311],"new":[313],"efficient":[319],"remote":[320],"attestation":[321],"parallel":[323],"computational":[324],"power.":[325],"We":[326],"natural":[331],"generalization":[332],"hardness":[335],"iterated":[337],"squaring":[338],"order,":[343],"any":[344],"used":[349],"construct":[351],"protocol":[354],"testing":[356],"parallelism":[358],"optimal":[363],"communication":[364],"independent":[366],"claimed":[369],"available":[372],"processors.":[373]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}