{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T09:01:20Z","timestamp":1769677280086,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB0690200"],"award-info":[{"award-number":["XDB0690200"]}]},{"name":"National Key Research and Development Program of China","award":["2023YFB4503203"],"award-info":[{"award-number":["2023YFB4503203"]}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372447"],"award-info":[{"award-number":["62372447"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Recent years have seen the widespread adoption of zkSNARKs constructed over small fields, including but not limited to, the Goldilocks field, small Mersenne prime fields, and tower of binary fields. Their appeal stems primarily from their efficacy in proving computations with small bit widths, which facilitates efficient proving of general computations and offers significant advantages, notably yielding remarkably fast proving efficiency for tasks such as proof of knowledge of hash preimages. Nevertheless, employing these SNARKs to prove algebraic statements (e.g., RSA, ECDSA signature verification) presents efficiency challenges, particularly in critical applications like zk-bridges and zkVMs that require verifying standard cryptographic primitives. To address this problem, we first define a new circuit model: arithmetic circuits with additional\n                    <jats:italic>exponentiation gates<\/jats:italic>\n                    . These gates serve as fundamental building blocks for establishing more intricate algebraic relations. Then we present a\n                    <jats:italic>Hash-committed Commit-and-Prove (HCP)<\/jats:italic>\n                    framework to construct Non-interactive Zero-knowledge (NIZK) proofs for the satisfiability of these circuits. Specifically, when proving knowledge of group exponentiations in discrete logarithm hard groups and RSA groups, compared to verifying complex group exponentiations within SNARK circuits, our approach requires proving only more lightweight computations within the SNARK, such as zk-friendly hash functions (e.g., Poseidon hash function). The number of these lightweight computations depends solely on the security parameter. This differentiation leads to substantial speedups for the prover relative to direct SNARK methods, while maintaining competitive proof size and verification cost.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00538-3","type":"journal-article","created":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:29:20Z","timestamp":1769495360000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proof of exponentiation: enhanced prover efficiency for algebraic statements"],"prefix":"10.1186","volume":"9","author":[{"given":"Zhuo","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinxuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5948-0780","authenticated-orcid":false,"given":"Yi","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hailong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,27]]},"reference":[{"key":"538_CR1","doi-asserted-by":"publisher","unstructured":"Goldwasser S, Micali S, Rackoff C (1985) The knowledge complexity of interactive proof-systems (extended abstract). In: 17th Annual ACM symposium on theory of computing. ACM Press, Providence, pp 291\u2013304 https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"538_CR2","series-title":"Part II Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology-EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth J (2016) On the size of pairing-based non-interactive arguments. In: Fischlin M, Coron J-S (eds) Advances in Cryptology-EUROCRYPT 2016, vol 9666. Part II Lecture Notes in Computer Science. Springer, Vienna, pp 305\u2013326. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"538_CR3","unstructured":"Ben-Sasson E, Bentov I, Horesh Y, Riabzev M (2018) Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/046. https:\/\/eprint.iacr.org\/2018\/046"},{"key":"538_CR4","doi-asserted-by":"publisher","unstructured":"Maller M, Bowe S, Kohlweiss M, Meiklejohn S (2019) Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Cavallaro L, Kinder J, Wang X, Katz J (eds) ACM CCS 2019: 26th conference on computer and communications security. ACM Press, London, pp 2111\u20132128. https:\/\/doi.org\/10.1145\/3319535.3339817","DOI":"10.1145\/3319535.3339817"},{"key":"538_CR5","doi-asserted-by":"publisher","unstructured":"Xie T, Zhang J, Zhang Y, Papamanthou C, Song D (2019) Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva A, Micciancio D (eds) Advances in cryptology\u2013CRYPTO 2019, vol 11694. Part III Lecture notes in computer science. Springer, Santa Barbara, pp 733\u2013764. https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"538_CR6","unstructured":"Gabizon A, Williamson ZJ, Ciobotaru O (2019) PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953"},{"key":"538_CR7","series-title":"Part I. Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in cryptology\u2013EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson E, Chiesa A, Riabzev M, Spooner N, Virza M, Ward NP (2019) Aurora: transparent succinct arguments for R1CS. In: Ishai Y, Rijmen V (eds) Advances in cryptology\u2013EUROCRYPT 2019, vol 11476. Part I. Lecture Notes in Computer Science. Springer, Darmstadt, pp 103\u2013128. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"538_CR8","series-title":"Part I. Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in cryptology - EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa A, Hu Y, Maller M, Mishra P, Vesely P, Ward NP (2020) Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut A, Ishai Y (eds) Advances in cryptology - EUROCRYPT 2020, vol 12105. Part I. Lecture notes in computer science. Springer, Zagreb, pp 738\u2013768. https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"538_CR9","series-title":"Part II. Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-031-38545-2_7","volume-title":"Advances in cryptology\u2014CRYPTO 2023","author":"A Golovnev","year":"2023","unstructured":"Golovnev A, Lee J, Setty STV, Thaler J, Wahby RS (2023) Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh H, Lysyanskaya A (eds) Advances in cryptology\u2014CRYPTO 2023, vol 14082. Part II. Lecture Notes in Computer Science. Springer, Santa Barbara, pp 193\u2013226. https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7"},{"key":"538_CR10","series-title":"Part II. Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-031-30617-4_17","volume-title":"Advances in cryptology\u2014EUROCRYPT 2023","author":"B Chen","year":"2023","unstructured":"Chen B, B\u00fcnz B, Boneh D, Zhang Z (2023) HyperPlonk: Plonk with linear-time prover and high-degree custom gates. In: Hazay C, Stam M (eds) Advances in cryptology\u2014EUROCRYPT 2023, vol 14005. Part II. Lecture notes in computer science. Springer, Lyon, pp 499\u2013530. https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17"},{"key":"538_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_5","volume-title":"Basefold: Efficient field-agnostic polynomial commitment schemes from foldable codes","author":"H Zeilberger","year":"2024","unstructured":"Zeilberger H, Chen B, Fisch B (2024) Basefold: Efficient field-agnostic polynomial commitment schemes from foldable codes. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-031-68403-6_5"},{"key":"538_CR12","unstructured":"Diamond BE, Posen J (2023) Succinct arguments over towers of binary fields. Cryptology ePrint Archive, Report 2023\/1784. https:\/\/eprint.iacr.org\/2023\/1784"},{"key":"538_CR13","unstructured":"Bruestle, J., Gafni, P (2023) RISC Zero zkVM: scalable, transparent arguments of RISCV integrity. https:\/\/www.risczero.com\/proof-system-in-detail.pdf. Accessed on 08 May 2025"},{"key":"538_CR14","unstructured":"0xPolygonZero (2023) Plonky2: fast, recursive zkSNARKs. https:\/\/github.com\/0xPolygonZero\/plonky2\/blob\/main\/plonky2\/plonky2.pdf"},{"key":"538_CR15","series-title":"Part I. Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-031-22318-1_17","volume-title":"TCC 2022: 20th theory of cryptography conference","author":"E Ben-Sasson","year":"2022","unstructured":"Ben-Sasson E, Carmon D, Kopparty S, Levit D (2022) Scalable and transparent proofs over all large fields, via elliptic curves - (ECFFT part II). In: Kiltz E, Vaikuntanathan V (eds) TCC 2022: 20th theory of cryptography conference, vol 13747. Part I. Lecture notes in computer science. Springer, Chicago, pp 467\u2013496. https:\/\/doi.org\/10.1007\/978-3-031-22318-1_17"},{"key":"538_CR16","unstructured":"Hab\u00f6ck U, Levit D, Papini S (2024) Circle STARKs. Cryptology ePrint Archive, Report 2024\/278. https:\/\/eprint.iacr.org\/2024\/278"},{"key":"538_CR17","unstructured":"Grassi L, Khovratovich D, Rechberger C, Roy A, Schofnegger M (2021) Poseidon: a new hash function for zero-knowledge proof systems. In: Bailey M, Greenstadt R (eds) USENIX security 2021: 30th USENIX security symposium, USENIX Association, pp 519\u2013535"},{"key":"538_CR18","doi-asserted-by":"publisher","unstructured":"Kosba AE, Papamanthou C, Shi E (2018) xJsnark: a framework for efficient verifiable computation. In: 2018 IEEE symposium on security and privacy. IEEE Computer Society Press, San Francisco, pp 944\u2013961. https:\/\/doi.org\/10.1109\/SP.2018.00018","DOI":"10.1109\/SP.2018.00018"},{"key":"538_CR19","unstructured":"JkY (2023) Non-native field arithmetic. https:\/\/hackmd.io\/@JkY-zACaSqerTtn_UwFjKg\/SJZw6x75o"},{"key":"538_CR20","unstructured":"Lubarov, D., Mel\u00e9, J.B (2022) Casting out primes: bignum arithmetic for zero-knowledge proofs. Cryptology ePrint Archive, Paper 2022\/1470. https:\/\/eprint.iacr.org\/2022\/1470"},{"key":"538_CR21","unstructured":"Ambrona M, Firsov D, Querejeta-Azurmendi I (2025) Efficient foreign-field arithmetic in PLONK. Cryptology ePrint Archive, Paper 2025\/695. https:\/\/eprint.iacr.org\/2025\/695"},{"key":"538_CR22","unstructured":"Zakharov D, Kurbatov O, Bista M, Bist B (2024) Optimizing big integer multiplication on bitcoin: introducing w-windowed approach. Cryptology ePrint Archive, Report 2024\/1236. https:\/\/eprint.iacr.org\/2024\/1236"},{"key":"538_CR23","doi-asserted-by":"crossref","unstructured":"Eagen L, Housni YE, Masson S, Piellard T (2025) Fast elliptic curve scalar multiplications in SN(T)ARK circuits. IACR Cryptol. ePrint Arch., 933","DOI":"10.1007\/978-3-032-06754-8_4"},{"key":"538_CR24","series-title":"Part III. Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-662-53015-3_18","volume-title":"Advances in Cryptology - CRYPTO 2016","author":"M Chase","year":"2016","unstructured":"Chase M, Ganesh C, Mohassel P (2016) Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials. In: Robshaw M, Katz J (eds) Advances in Cryptology - CRYPTO 2016, vol 9816. Part III. Lecture notes in computer science. Springer, Santa Barbara, pp 499\u2013530. https:\/\/doi.org\/10.1007\/978-3-662-53015-3_18"},{"key":"538_CR25","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra A, Wuille P, Maxwell G (2018) Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE symposium on security and privacy. IEEE Computer Society Press, San Francisco, pp 315\u2013334. https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"538_CR26","series-title":"Part III. Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-96878-0_22","volume-title":"Advances in Cryptology\u2013CRYPTO 2018","author":"S Agrawal","year":"2018","unstructured":"Agrawal S, Ganesh C, Mohassel P (2018) Non-interactive zero-knowledge proofs for composite statements. In: Shacham H, Boldyreva A (eds) Advances in Cryptology\u2013CRYPTO 2018, vol 10993. Part III. Lecture Notes in Computer Science. Springer, Santa Barbara, pp 643\u2013673. https:\/\/doi.org\/10.1007\/978-3-319-96878-0_22"},{"key":"538_CR27","doi-asserted-by":"publisher","unstructured":"Backes M, Hanzlik L, Herzberg A, Kate A, Pryvalov I (2019) Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup. In: Lin D, Sako K (eds) PKC\u00a02019: 22nd International conference on theory and practice of public key cryptography, Part\u00a0I. Lecture notes in computer science, vol 11442. Springer, Beijing, pp 286\u2013313. https:\/\/doi.org\/10.1007\/978-3-030-17253-4_10","DOI":"10.1007\/978-3-030-17253-4_10"},{"key":"538_CR28","doi-asserted-by":"publisher","unstructured":"Campanelli M, Fiore D, Querol A (2019) LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Cavallaro L, Kinder J, Wang X, Katz J (eds) ACM CCS 2019: 26th conference on computer and communications security. ACM Press, London, pp 2075\u20132092. https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"538_CR29","series-title":"Part III. Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92078-4_1","volume-title":"Advances in Cryptology - ASIACRYPT 2021","author":"M Campanelli","year":"2021","unstructured":"Campanelli M, Faonio A, Fiore D, Querol A, Rodr\u00edguez H (2021) Lunar: A toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. In: Tibouchi M, Wang H (eds) Advances in Cryptology - ASIACRYPT 2021, vol 13092. Part III. Lecture Notes in Computer Science. Springer, Singapore, pp 3\u201333. https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"538_CR30","doi-asserted-by":"publisher","unstructured":"Aranha DF, Bennedsen EM, Campanelli M, Ganesh C, Orlandi C, Takahashi A (2022) ECLIPSE: Enhanced compiling method for pedersen-committed zkSNARK engines. In: Hanaoka G, Shikata J, Watanabe Y (eds) PKC\u00a02022: 25th International conference on theory and practice of public key cryptography. Part\u00a0I Lecture notes in computer science, vol 13177. Springer, New York, pp 584\u2013614. https:\/\/doi.org\/10.1007\/978-3-030-97121-2_21","DOI":"10.1007\/978-3-030-97121-2_21"},{"key":"538_CR31","doi-asserted-by":"publisher","unstructured":"Zhang M, Chen Y, Yao C, Wang Z (2023) Sigma protocols from verifiable secret sharing and their applications. In: Guo J, Steinfeld R (eds) Advances in cryptology\u2014ASIACRYPT\u00a02023, Part\u00a0II. Lecture notes in computer science, vol 14439. Springer, Guangzhou, pp 208\u2013242.https:\/\/doi.org\/10.1007\/978-981-99-8724-5_7","DOI":"10.1007\/978-981-99-8724-5_7"},{"key":"538_CR32","doi-asserted-by":"publisher","unstructured":"Orr\u00f9 M, Kadianakis G, Maller M, Zaverucha G (2025) Beyond the circuit: How to minimize foreign arithmetic in ZKP circuits. IACR Commun. Cryptol. 2(1), 23 https:\/\/doi.org\/10.62056\/AN-4C3C2H","DOI":"10.62056\/AN-4C3C2H"},{"key":"538_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth J, Sahai A (2008) Efficient non-interactive proof systems for bilinear groups. In: Smart NP (ed) Advances in Cryptology\u2014EUROCRYPT 2008, vol 4965. Lecture Notes in Computer Science. Springer, Istanbul, pp 415\u2013432. https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"538_CR34","unstructured":"Bowe S, Grigg J, Hopwood D (2019) Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"538_CR35","unstructured":"Kohrita T, Towa P, Williamson ZJ (2024) One-shot native proofs of non-native operations in incrementally verifiable computations. IACR Cryptol. ePrint Arch. https:\/\/eprint.iacr.org\/2024\/1651"},{"key":"538_CR36","unstructured":"Kadianakis G, Maller M, Novakovic A (2023) Sigmabus: binding sigmas in circuits for fast curve operations. Cryptology ePrint Archive, Report 2023\/1406. https:\/\/eprint.iacr.org\/2023\/1406"},{"key":"538_CR37","doi-asserted-by":"crossref","unstructured":"Garg S, Goel A, Wang M (2024) How to prove statements obliviously? In: annual international cryptology conference. Springer, pp 449\u2013487","DOI":"10.1007\/978-3-031-68403-6_14"},{"key":"538_CR38","unstructured":"Jeong G, Moon M, Yoon G, Oh H, Kim J (2025) Tangram: encryption-friendly SNARK framework under Pedersen committed engines. Cryptology ePrint Archive, Paper 2025\/540. https:\/\/eprint.iacr.org\/2025\/540"},{"issue":"3","key":"538_CR39","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C-P Schnorr","year":"1991","unstructured":"Schnorr C-P (1991) Efficient signature generation by smart cards. J Cryptol 4(3):161\u2013174. https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J Cryptol"},{"key":"538_CR40","doi-asserted-by":"publisher","unstructured":"Guillou LC, Quisquater J-J (1988) A practical zero-knowledge protocol fitted to security microprocessor minimizing both trasmission and memory. In: Gunther CG (ed) Advances in Cryptology - EUROCRYPT\u201988, vol 330. Lecture Notes in Computer Science. Springer, Davos, pp 123\u2013128. https:\/\/doi.org\/10.1007\/3-540-45961-8_11","DOI":"10.1007\/3-540-45961-8_11"},{"key":"538_CR41","series-title":"Part IV. Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-031-15985-5_13","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"A Kothapalli","year":"2022","unstructured":"Kothapalli A, Setty S, Tzialla I (2022) Nova: Recursive zero-knowledge arguments from folding schemes. In: Dodis Y, Shrimpton T (eds) Advances in Cryptology - CRYPTO 2022, vol 13510. Part IV. Lecture Notes in Computer Science. Springer, Santa Barbara, pp 359\u2013388. https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13"},{"key":"538_CR42","unstructured":"Damg\u00e5rd I (1991) Efficient and probabilistic proofs. In: PhD thesis, Aarhus University, Denmark, Aarhus, Denmark"},{"key":"538_CR43","series-title":"Part II. Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-031-30617-4_18","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"Q Dao","year":"2023","unstructured":"Dao Q, Grubbs P (2023) Spartan and bulletproofs are simulation-extractable (for free!). In: Hazay C, Stam M (eds) Advances in Cryptology - EUROCRYPT 2023, vol 14005. Part II. Lecture Notes in Computer Science. Springer, Lyon, pp 531\u2013562. https:\/\/doi.org\/10.1007\/978-3-031-30617-4_18"},{"key":"538_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO\u201986","author":"A Fiat","year":"1987","unstructured":"Fiat A, Shamir A (1987) How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko AM (ed) Advances in Cryptology - CRYPTO\u201986, vol 263. Lecture Notes in Computer Science. Springer, Santa Barbara, pp 186\u2013194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"538_CR45","unstructured":"Developers P (2024) Plonky3 repository: benchmarks. https:\/\/github.com\/Plonky3\/Plonky3\/tree\/main?tab=readme-ov-file#benchmarks. Accessed 11 May 2025"},{"key":"538_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology - CRYPTO\u201988","author":"LC Guillou","year":"1990","unstructured":"Guillou LC, Quisquater J-J (1990) A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser S (ed) Advances in Cryptology - CRYPTO\u201988, vol 403. Lecture Notes in Computer Science. Springer, Santa Barbara, pp 216\u2013231. https:\/\/doi.org\/10.1007\/0-387-34799-2_16"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00538-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00538-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00538-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:29:47Z","timestamp":1769495387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00538-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,27]]},"references-count":46,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00538-3","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,27]]},"assertion":[{"value":"10 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None of the authors have any Conflict of interest in the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"115"}}