{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:01:06Z","timestamp":1780675266763,"version":"3.54.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    With the rising volume of transactions on blockchains, signature verification becomes a critical bottleneck of efficiency, hindering scalability and performance. This paper presents a general approach to batch verification of arbitrary signatures on blockchain. By leveraging the memory-friendliness of incremental verifiable computation (IVC) and optimizing for blockchain environments, the proposed scheme can enhance scalability, reduce memory consumption, and ensure compatibility with common devices while supporting an arbitrary number of signature verifications. This approach allows for the concurrent generation of IVC proofs while receiving signatures from other nodes, making it particularly well-suited for low-latency blockchain applications. As a concrete instantiation of our approach, we introduce BEATS (Batch ECDSA Transaction verification Scheme), where the underlying SNARK is instantiated by Spartan with Bulletproof commitment. Our implementation, evaluated on a virtual machine with 8 cores and 16 GB RAM, shows significant performance gains compared to Spartan\n                    <jats:sub>BP<\/jats:sub>\n                    , which is the direct construction using Spartan with Bulletproof commitment to verify a batch of ECDSA. The comparison shows that BEATS speeds up the prover by 3\u20137 times and the verifier by 48\u2013240 times when handling up to 2\n                    <jats:sup>11<\/jats:sup>\n                    ECDSA signatures, the maximum batch size supported by Spartan\n                    <jats:sub>BP<\/jats:sub>\n                    . For larger batches exceeding 2\n                    <jats:sup>10<\/jats:sup>\n                    , our scheme outperforms the baseline approach, which verifies ECDSA signatures one by one without any proof system. Our verifier achieved a speedup of 21\u2013174 times compared to the baseline as the batch size grows to 2\n                    <jats:sup>20<\/jats:sup>\n                    . Furthermore, BEATS exhibits a remarkably low memory footprint, with peak memory usage remaining below 1 GB.\n                  <\/jats:p>","DOI":"10.1007\/s11704-025-41269-5","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T04:32:30Z","timestamp":1762835550000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable batch verification of ECDSA for blockchain using IVC"],"prefix":"10.1007","volume":"20","author":[{"given":"Li","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Puwen","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuchang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zirui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Da","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zengjie","family":"Kou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,11]]},"reference":[{"key":"41269_CR1","first-page":"416","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology","author":"D Boneh","year":"2003","unstructured":"Boneh D, Gentry C, Lynn B, Shacham H. Aggregate and verifiably encrypted signatures from bilinear maps. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. 2003, 416\u2013432"},{"issue":"12","key":"41269_CR2","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1049\/el:19980833","volume":"34","author":"L Harn","year":"1998","unstructured":"Harn L. Batch verifying multiple RSA digital signatures. Electronics Letters, 1998, 34(12): 1219\u20131220","journal-title":"Electronics Letters"},{"key":"41269_CR3","first-page":"1","volume-title":"Proceedings of the 5th International Conference on Cryptology in Africa on Progress in Cryptology","author":"S Karati","year":"2012","unstructured":"Karati S, Das A, Roychowdhury D, Bellur B, Bhattacharya D, Iyer A. Batch verification of ECDSA signatures. In: Proceedings of the 5th International Conference on Cryptology in Africa on Progress in Cryptology. 2012, 1\u201318"},{"key":"41269_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-12060-7_16","volume-title":"Proceedings of the 4th International Conference on Security, Privacy, and Applied Cryptography Engineering","author":"S Karati","year":"2014","unstructured":"Karati S, Das A, Roychoudhury D. Randomized batch verification of standard ECDSA signatures. In: Proceedings of the 4th International Conference on Security, Privacy, and Applied Cryptography Engineering. 2014, 237\u2013255"},{"key":"41269_CR5","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-07536-5_26","volume-title":"Proceedings of the 12th International Conference on Applied Cryptography and Network Security","author":"S Karati","year":"2014","unstructured":"Karati S, Das A. Faster batch verification of standard ECDSA signatures using summation polynomials. In: Proceedings of the 12th International Conference on Applied Cryptography and Network Security. 2014, 438\u2013456"},{"key":"41269_CR6","first-page":"307","volume-title":"Proceedings of the 12th International Workshop on Selected Areas in Cryptography","author":"A Antipa","year":"2005","unstructured":"Antipa A, Brown D, Gallant R, Lambert R, Struik R, Vanstone S. Accelerated verification of ECDSA signatures. In: Proceedings of the 12th International Workshop on Selected Areas in Cryptography. 2005, 307\u2013318"},{"key":"41269_CR7","first-page":"442","volume-title":"Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography","author":"J H Cheon","year":"2007","unstructured":"Cheon J H, Yi J H. Fast batch verification of multiple signatures. In: Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography. 2007, 442\u2013457"},{"key":"41269_CR8","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/SP54263.2024.00035","volume-title":"Proceedings of 2024 IEEE Symposium on Security and Privacy (SP)","author":"T Liu","year":"2024","unstructured":"Liu T, Xie T, Zhang J, Song D, Zhang Y. Pianist: scalable zkRollups via fully distributed zero-knowledge proofs. In: Proceedings of 2024 IEEE Symposium on Security and Privacy (SP). 2024, 1777\u20131793"},{"key":"41269_CR9","unstructured":"Polygon. See https:\/\/www.Polygon.technology\/polygon-zkevm website, 2024"},{"key":"41269_CR10","unstructured":"Scroll. See {rs www.Scroll.io\/website}, 2025"},{"key":"41269_CR11","unstructured":"ZKsync. See {rs www.Zksync.io\/website}, 2024"},{"key":"41269_CR12","first-page":"704","volume-title":"Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology","author":"S Setty","year":"2020","unstructured":"Setty S. Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology. 2020, 704\u2013737"},{"key":"41269_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/SP.2018.00020","volume-title":"Proceedings of 2018 IEEE Symposium on Security and Privacy (SP)","author":"B B\u00fcnz","year":"2018","unstructured":"B\u00fcnz B, Bootle J, Boneh D, Poelstra A, Wuille P, Maxwell G. Bulletproofs: short proofs for confidential transactions and more. In: Proceedings of 2018 IEEE Symposium on Security and Privacy (SP). 2018, 315\u2013334"},{"key":"41269_CR14","first-page":"738","volume-title":"Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology","author":"A Chiesa","year":"2020","unstructured":"Chiesa A, Hu Y, Maller M, Mishra P, Vesely N, Ward N. Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. 2020, 738\u2013768"},{"key":"41269_CR15","first-page":"177","volume-title":"Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security on Advances in Cryptology","author":"A Kate","year":"2010","unstructured":"Kate A, Zaverucha G M, Goldberg I. Constant-size commitments to polynomials and their applications. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security on Advances in Cryptology. 2010, 177\u2013194"},{"key":"41269_CR16","first-page":"359","volume-title":"Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology","author":"A Kothapalli","year":"2022","unstructured":"Kothapalli A, Setty S, Tzialla I. Nova: recursive zero-knowledge arguments from folding schemes. In: Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology. 2022, 359\u2013388"},{"key":"41269_CR17","unstructured":"C2PA technical specification. See {rs www.C2pa.org\/specifications\/specifications\/1.1\/specs\/C2PA_Specification} website, 2024"},{"key":"41269_CR18","unstructured":"Curve with group order 2 255 - 19. See https:\/\/www.Moderncrypto.org\/mail-archive\/curves\/2018\/000992 website, 2018"},{"key":"41269_CR19","unstructured":"Spartan-ECDSA. See https:\/\/www.Github.com\/personaelabs\/spartan-ecdsa website, 2024"},{"key":"41269_CR20","first-page":"77","volume-title":"Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security","author":"B B\u00fcnz","year":"2023","unstructured":"B\u00fcnz B, Chen B. Protostar: generic efficient accumulation\/folding for special-sound protocols. In: Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security. 2023, 77\u2013110"},{"key":"41269_CR21","first-page":"345","volume-title":"Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology","author":"A Kothapalli","year":"2024","unstructured":"Kothapalli A, Setty S. HyperNova: recursive arguments for customizable constraint systems. In: Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology. 2024, 345\u2013379"},{"key":"41269_CR22","first-page":"305","volume-title":"Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology","author":"J Groth","year":"2016","unstructured":"Groth J. On the size of pairing-based non-interactive arguments. In: Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. 2016, 305\u2013326"},{"key":"41269_CR23","volume-title":"PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge","author":"A Gabizon","year":"2019","unstructured":"Gabizon A, Williamson Z J, Ciobotaru O. PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. See Eprint.iacr.org\/2019\/953 website, 2019"},{"key":"41269_CR24","unstructured":"Zcash. See https:\/\/www.Zcash.readthedocs.io\/en\/latest\/website, 2019"},{"key":"41269_CR25","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/SP40000.2020.00052","volume-title":"Proceedings of 2020 IEEE Symposium on Security and Privacy (SP)","author":"J Zhang","year":"2020","unstructured":"Zhang J, Xie T, Zhang Y, Song D. Transparent polynomial delegation and its applications to zero knowledge proof. In: Proceedings of 2020 IEEE Symposium on Security and Privacy (SP). 2020, 859\u2013876"},{"key":"41269_CR26","first-page":"193","volume-title":"Proceedings of Annual International Cryptology Conference","author":"A Golovnev","year":"2023","unstructured":"Golovnev A, Lee J, Setty S, Thaler J, Wahby R S. Brakedown: Linear-time and field-agnostic snarks for R1CS. In: Proceedings of Annual International Cryptology Conference. 2023, 193\u2013226"},{"key":"41269_CR27","first-page":"299","volume-title":"Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology","author":"T Xie","year":"2022","unstructured":"Xie T, Zhang Y, Song D. Orion: zero knowledge proof with linear prover time. In: Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology. 2022, 299\u2013328"},{"key":"41269_CR28","unstructured":"Kales D, Zaverucha G. Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. See https:\/\/www.Eprint.iacr.org\/2022\/588 website, 2022"},{"key":"41269_CR29","first-page":"138","volume-title":"Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology","author":"H Zeilberger","year":"2024","unstructured":"Zeilberger H, Chen B, Fisch B. BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology. 2024, 138\u2013169"},{"key":"41269_CR30","first-page":"276","volume-title":"Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology","author":"A R Block","year":"2024","unstructured":"Block A R, Fang Z, Katz J, Thaler J, Waldner H, Zhang Y. Fiel-dagnostic SNARKs from expand-accumulate codes. In: Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology. 2024, 276\u2013307"},{"key":"41269_CR31","first-page":"499","volume-title":"Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology","author":"B Chen","year":"2023","unstructured":"Chen B, B\u00fcnz B, Boneh D, Zhang Z. HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. 2023, 499\u2013530"},{"key":"41269_CR32","unstructured":"0xPolygonZero\/zk_evm. See https:\/\/www.Github.com\/0xPolygonZero\/zk_evm website, 2024"},{"key":"41269_CR33","unstructured":"Plonky2. See https:\/\/www.Github.com\/0xPolygonZero\/plonky2\/blob\/main\/plonky2\/plonky2 website, 2022"},{"key":"41269_CR34","first-page":"675","volume-title":"Proceedings of the 27th USENIX Conference on Security Symposium","author":"H Wu","year":"2018","unstructured":"Wu H, Zheng W, Chiesa A, Popa R A, Stoica I. DIZK: a distributed zero knowledge proof system. In: Proceedings of the 27th USENIX Conference on Security Symposium. 2018, 675\u2013692"},{"key":"41269_CR35","first-page":"361","volume-title":"Proceedings of the 32nd USENIX Conference on Security Symposium","author":"A Chiesa","year":"2023","unstructured":"Chiesa A, Lehmkuhl R, Mishra P, Zhang Y. EOS: efficient private delegation of zkSNARK provers. In: Proceedings of the 32nd USENIX Conference on Security Symposium. 2023, 361"},{"issue":"5","key":"41269_CR36","doi-asserted-by":"publisher","first-page":"185812","DOI":"10.1007\/s11704-023-2782-9","volume":"18","author":"J Sha","year":"2024","unstructured":"Sha J, Liu S. Delegable zk-SNARKs with proxies. Frontiers of Computer Science, 2024, 18(5): 185812","journal-title":"Frontiers of Computer Science"},{"key":"41269_CR37","first-page":"449","volume-title":"Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology","author":"S Garg","year":"2024","unstructured":"Garg S, Goel A, Wang M. How to prove statements obliviously? In: Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology. 2024, 449\u2013487"},{"key":"41269_CR38","first-page":"356","volume-title":"Proceedings of 2023 ACM SIGSAC Conference on Computer and Communications Security","author":"S Das","year":"2023","unstructured":"Das S, Camacho P, Xiang Z, Nieto J, B\u00fcnz B, Ren L. Threshold signatures from inner product argument: succinct, weighted, and multi-threshold. In: Proceedings of 2023 ACM SIGSAC Conference on Computer and Communications Security. 2023, 356\u2013370"},{"key":"41269_CR39","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1109\/SP54263.2024.00057","volume-title":"Proceedings of 2024 IEEE Symposium on Security and Privacy (SP)","author":"S Garg","year":"2024","unstructured":"Garg S, Jain A, Mukherjee P, Sinha R, Wang M, Zhang Y. hinTS: threshold signatures with silent setup. In: Proceedings of 2024 IEEE Symposium on Security and Privacy (SP). 2024, 3034\u20133052"},{"key":"41269_CR40","first-page":"279","volume-title":"Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security on Advances in Cryptology","author":"T Qiu","year":"2023","unstructured":"Qiu T, Tang Q. Predicate aggregate signatures and applications. In: Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security on Advances in Cryptology. 2023, 279\u2013312"},{"key":"41269_CR41","first-page":"33","volume-title":"Proceedings of the 38th Annual International Cryptology Conference on Advances in Cryptology","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer G, Kiltz E, Loss J. The algebraic group model and its applications. In: Proceedings of the 38th Annual International Cryptology Conference on Advances in Cryptology. 2018, 33\u201362"},{"key":"41269_CR42","volume-title":"On the security of nova recursive proof system","author":"H Lee","year":"2024","unstructured":"Lee H, Seo J H. On the security of nova recursive proof system. See Eprint.iacr.org\/2024\/232 website, 2024"},{"key":"41269_CR43","unstructured":"Nova. See https:\/\/www.Github.com\/microsoft\/Nova website, 2025"},{"key":"41269_CR44","volume-title":"Revisiting the nova proof system on a cycle of curves","author":"W Nguyen","year":"2023","unstructured":"Nguyen W, Boneh D, Setty S. Revisiting the nova proof system on a cycle of curves. See https:\/\/www.Eprint.Iacr.Org\/2023\/969 website, 2023"},{"key":"41269_CR45","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.FIPS.186-5","volume-title":"Digital signature standard (DSS)","author":"National Institute of StandardsTechnology.","year":"2023","unstructured":"National Institute of Standards and Technology. Digital signature standard (DSS). See https:\/\/www.Csrc.nist.gov\/pubs\/fips\/186-5\/final website, 2023"},{"key":"41269_CR46","first-page":"519","volume-title":"Proceedings of the 30th USENIX Conference on Security Symposium","author":"L Grassi","year":"2021","unstructured":"Grassi L, Khovratovich D, Rechberger C, Roy A, Schofnegger M. Poseidon: a new hash function for zero-knowledge proof systems. In: Proceedings of the 30th USENIX Conference on Security Symposium. 2021, 519\u2013535"},{"key":"41269_CR47","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/SP.2018.00018","volume-title":"Proceedings of 2018 IEEE Symposium on Security and Privacy (SP)","author":"A Kosba","year":"2018","unstructured":"Kosba A, Papamanthou C, Shi E. xJsnark: a framework for efficient verifiable computation. In: Proceedings of 2018 IEEE Symposium on Security and Privacy (SP). 2018, 944\u2013961"},{"key":"41269_CR48","unstructured":"0xPARC. zk-ECDSA part 2: under the hood. See https:\/\/www.0Xparc.org\/blog\/zk-ecdsa-2 website, 2024"},{"key":"41269_CR49","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz J, Lindell Y. Introduction to Modern Cryptography. 2nd ed. Chapman & Hall\/CRC, 2014","edition":"2nd ed."},{"key":"41269_CR50","unstructured":"bellpepper. See https:\/\/www.Github.com\/lurk-lab\/bellpepper website, 2024"},{"key":"41269_CR51","first-page":"308","volume-title":"Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology","author":"W Nguyen","year":"2024","unstructured":"Nguyen W, Datta T, Chen B, Tyagi N, Boneh D. Mangrove: a scalable framework for folding-based SNARKs. In: Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology. 2024, 308\u2013344"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-41269-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-41269-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-41269-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T04:32:38Z","timestamp":1762835558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-41269-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,11]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["41269"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-41269-5","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,11]]},"assertion":[{"value":"25 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2004803"}}