{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:06:09Z","timestamp":1765411569851,"version":"3.46.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB4503203"],"award-info":[{"award-number":["2023YFB4503203"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372447"],"award-info":[{"award-number":["62372447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61932019"],"award-info":[{"award-number":["61932019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["M22003"],"award-info":[{"award-number":["M22003"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB0690200"],"award-info":[{"award-number":["XDB0690200"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Zero knowledge succinct non-interactive arguments of knowledge protocol (zk-SNARK) is an application oriented variant of zero knowledge proof, which enables a prover to convince a verifier that a statement is true, without revealing any other information beyond the correctness of the statement itself. Due to its powerful capabilities and high efficiency, it has been widely deployed in various blockchain based applications to provide privacy and scalability. While these applications place high demands on small proof size, fast verification and decentralization, currently available zk-SNARK with the shortest proof size and the fastest verification speed is in the common reference string (CRS) model, that is they require the trusted setup. After the pioneering results proposed by Bellare et al. in ASIACRYPT 2016, there have been lots of efforts to construct zk-SNARKs that satisfy subversion zero knowledge (S-ZK) and standard soundness from the zk-SNARK in the CRS model. These constructions could be regarded secure in the bare public key (BPK) model because that the equivalence between S-ZK in the CRS model, and uniform non-black-box zero knowledge in the BPK model has been proved by Abdolmaleki et al. in PKC 2020. Thus, compared to the CRS model, the BPK model better characterizes decentralized blockchain based application such as cryptocurrencies and anonymous credentials. In this study, by leveraging the power of random oracle (RO) model, we proposed the first publicly verifiable non-uniform ZK zk-SNARK scheme in the BPK model maintaining comparable efficiency with its conventional counterpart, which can also be compatible with the well-known transformation proposed by Bitansky et al. in TCC 2013 to obtain an efficient designated-verifier zk-SNARK. We achieve this goal by only adding a constant number of elements into the CRS, and using an unconventional but natural method to transform Groth\u2019s zk-SNARK in EUROCRYPT 2016. In addition, we propose a new speed-up technique that provides a trade-off. Specifically, if a logarithmic number of elements are added into the CRS, according to different circuits, the CRS verification time in our construction could be approximately 9\u201323% shorter than that in the conventional counterpart.<\/jats:p>","DOI":"10.1186\/s42400-025-00432-y","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:01:54Z","timestamp":1765411314000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast and designated-verifier friendly zk-SNARKs in the BPK model"],"prefix":"10.1186","volume":"8","author":[{"given":"Xudong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuyang","family":"Song","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":"Gang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"432_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70700-6_1","volume-title":"Advances in cryptology\u2014ASIACRYPT 2017","author":"B Abdolmaleki","year":"2017","unstructured":"Abdolmaleki B, Baghery K, Lipmaa H, Zaj\u0105c M (2017) A subversion-resistant snark. In: Takagi T, Peyrin T (eds) Advances in cryptology\u2014ASIACRYPT 2017. Springer, Cham, pp 3\u201333"},{"key":"432_CR2","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-030-45374-9_20","volume-title":"Public-key cryptography\u2014PKC 2020","author":"B Abdolmaleki","year":"2020","unstructured":"Abdolmaleki B, Lipmaa H, Siim J, Zaj\u0105c M (2020) On QA-NIZK in the BPK model. In: Kiayias A, Kohlweiss M, Wallden P, Zikas V (eds) Public-key cryptography\u2014PKC 2020. Springer, Cham, pp 590\u2013620"},{"key":"432_CR3","doi-asserted-by":"publisher","unstructured":"Abdolmaleki B, Ramacher S, Slamanig D (2020) Lift-and-shift: obtaining simulation extractable subversion and updatable snarks generically. In: Ligatti J, Ou X, Katz J, Vigna G (eds) CCS \u201920: 2020 ACM SIGSAC conference on computer and communications security, virtual event, USA, November 9\u201313, 2020, pp 1987\u20132005. ACM, New York. https:\/\/doi.org\/10.1145\/3372297.3417228","DOI":"10.1145\/3372297.3417228"},{"issue":"3","key":"432_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00145-021-09379-y","volume":"34","author":"B Abdolmaleki","year":"2021","unstructured":"Abdolmaleki B, Lipmaa H, Siim J, Zaj\u0105c M (2021) On subversion-resistant snarks. J Cryptol 34(3):17. https:\/\/doi.org\/10.1007\/s00145-021-09379-y","journal-title":"J Cryptol"},{"key":"432_CR5","unstructured":"Abdolmaleki B, Glaeser N, Ramacher S, Slamanig D (2023) Circuit-succinct universally-composable NIZKs with updatable CRS. Cryptology ePrint Archive, Paper 2023\/097. https:\/\/eprint.iacr.org\/2023\/097"},{"key":"432_CR6","doi-asserted-by":"crossref","unstructured":"Amine O, Baghery K, Pindado Z, R\u00e0fols C (2020) Simulation extractable versions of Groth\u2019s zk-SNARK revisited. Cryptology ePrint Archive, Paper 2020\/1306. https:\/\/eprint.iacr.org\/2020\/1306","DOI":"10.1007\/978-3-030-65411-5_22"},{"key":"432_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-030-35199-1_3","volume-title":"Cryptography and coding","author":"K Baghery","year":"2019","unstructured":"Baghery K (2019) Subversion-resistant simulation (knowledge) sound NIZKs. In: Albrecht M (ed) Cryptography and coding. Springer, Cham, pp 42\u201363"},{"key":"432_CR8","doi-asserted-by":"publisher","unstructured":"Baghery K, Pindado Z, R\u00e0fols C (2020) Simulation extractable versions of Groth\u2019s zk-SNARK revisited. In: Cryptology and network security: 19th international conference, CANS 2020, Vienna, Austria, December 14\u201316, 2020, Proceedings, pp 453\u2013461. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-030-65411-5_22","DOI":"10.1007\/978-3-030-65411-5_22"},{"key":"432_CR9","doi-asserted-by":"publisher","unstructured":"Belchior R, Putz B, Pernul G, Correia M, Vasconcelos A, Guerreiro S (2020) SSIBAC: self-sovereign identity based access control. In: Wang G, Ko RKL, Bhuiyan MZA, Pan Y (eds) 19th IEEE international conference on trust, security and privacy in computing and communications, TrustCom 2020, Guangzhou, China, December 29, 2020\u2014January 1, 2021, pp 1935\u20131943. IEEE, Guangzhou. https:\/\/doi.org\/10.1109\/TRUSTCOM50675.2020.00264","DOI":"10.1109\/TRUSTCOM50675.2020.00264"},{"key":"432_CR10","doi-asserted-by":"crossref","unstructured":"Bellare M, Fuchsbauer G, Scafuro A (2016) NIZKs with an untrusted CRS: security in the face of parameter subversion. In: Cheon JH, Takagi T (eds) Advances in cryptology\u2014ASIACRYPT 2016. Springer, Berlin, pp 777\u2013804","DOI":"10.1007\/978-3-662-53890-6_26"},{"key":"432_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Sasson E, Chiesa A, Garman C, Green M, Miers I, Tromer E, Virza M (2014) Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE symposium on security and privacy, SP 2014, Berkeley, CA, USA, May 18\u201321, 2014, pp 459\u2013474. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/SP.2014.36","DOI":"10.1109\/SP.2014.36"},{"key":"432_CR12","unstructured":"Ben-Sasson E, Chiesa A, Tromer E, Virza M (2014) Succinct non-interactive zero knowledge for a von Neumann architecture. In: 23rd USENIX security symposium (USENIX security 14), pp 781\u2013796. USENIX Association, San Diego, CA https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/ben-sasson"},{"key":"432_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in cryptology\u2014EUROCRYPT 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\u2014EUROCRYPT 2019. Springer, Cham, pp 103\u2013128"},{"key":"432_CR14","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in cryptology\u2014CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson E, Bentov I, Horesh Y, Riabzev M (2019) Scalable zero knowledge with no trusted setup. In: Boldyreva A, Micciancio D (eds) Advances in cryptology\u2014CRYPTO 2019. Springer, Cham, pp 701\u2013732"},{"key":"432_CR15","doi-asserted-by":"publisher","unstructured":"Bitansky N, Chiesa A, Ishai Y, Ostrovsky R, Paneth O (2013) Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) Theory of cryptography\u201410th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3\u20136, 2013. Proceedings. Lecture notes in computer science, vol 7785, pp 315\u2013333. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"#cr-split#-432_CR16.1","doi-asserted-by":"crossref","unstructured":"Blum M, Feldman P, Micali S (1988) Non-interactive zero-knowledge and its applications (extended abstract). In: Simon J","DOI":"10.1145\/62212.62222"},{"key":"#cr-split#-432_CR16.2","unstructured":"(ed) Proceedings of the 20th annual ACM symposium on theory of computing, May 2-4, 1988, Chicago, Illinois, USA, pp 103-112. ACM"},{"key":"432_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in cryptology\u2014EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle J, Cerulli A, Chaidos P, Groth J, Petit C (2016) Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin M, Coron J-S (eds) Advances in cryptology\u2014EUROCRYPT 2016. Springer, Berlin, pp 327\u2013357"},{"key":"432_CR18","unstructured":"Bowe S, Gabizon A (2018) Making Groth\u2019s zk-SNARK simulation extractable in the random oracle model. Cryptology ePrint Archive, Paper 2018\/187. https:\/\/eprint.iacr.org\/2018\/187"},{"key":"432_CR19","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 (SP), pp 315\u2013334. https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"432_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in cryptology\u2014EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz B, Fisch B, Szepieniec A (2020) Transparent snarks from dark compilers. In: Canteaut A, Ishai Y (eds) Advances in cryptology\u2014EUROCRYPT 2020. Springer, Cham, pp 677\u2013706"},{"key":"432_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92078-4_1","volume-title":"Advances in cryptology\u2014ASIACRYPT 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\u2014ASIACRYPT 2021. Springer, Cham, pp 3\u201333"},{"key":"432_CR22","doi-asserted-by":"publisher","unstructured":"Campanelli M, Gennaro R, Goldfeder S, Nizzardo L (2017) Zero-knowledge contingent payments revisited: attacks and payments for services. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security. CCS \u201917, pp 229\u2013243. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3133956.3134060","DOI":"10.1145\/3133956.3134060"},{"key":"432_CR23","unstructured":"Chiesa A, Hu Y, Maller M, Mishra P, Vesely P, Ward N (2019) Marlin: preprocessing zkSNARKs with universal and updatable SRS. Cryptology ePrint Archive, Paper 2019\/1047. https:\/\/eprint.iacr.org\/2019\/1047"},{"key":"432_CR24","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"Advances in cryptology\u2014EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa A, Ojha D, Spooner N (2020) Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut A, Ishai Y (eds) Advances in cryptology\u2014EUROCRYPT 2020. Springer, Cham, pp 769\u2013793"},{"key":"432_CR25","first-page":"532","volume-title":"Advances in cryptology\u2014ASIACRYPT 2014","author":"G Danezis","year":"2014","unstructured":"Danezis G, Fournet C, Groth J, Kohlweiss M (2014) Square span programs with applications to succinct NIZK arguments. In: Sarkar P, Iwata T (eds) Advances in cryptology\u2014ASIACRYPT 2014. Springer, Berlin, Heidelberg, pp 532\u2013550"},{"key":"432_CR26","doi-asserted-by":"publisher","unstructured":"Deng Y (2020) Individual simulations. In: Moriai, S., Wang, H. (eds.) Advances in cryptology\u2014ASIACRYPT 2020\u201426th international conference on the theory and application of cryptology and information security, Daejeon, South Korea, December 7\u201311, 2020, Proceedings, Part III. Lecture notes in computer science, vol 12493, pp 805\u2013836. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-030-64840-4_27","DOI":"10.1007\/978-3-030-64840-4_27"},{"key":"432_CR27","doi-asserted-by":"publisher","unstructured":"Eberhardt J, Tai S (2018) Zokrates\u2014scalable privacy-preserving off-chain computations. In: IEEE international conference on Internet of Things (iThings) and IEEE green computing and communications (GreenCom) and IEEE cyber, physical and social computing (CPSCom) and IEEE smart data (SmartData), iThings\/GreenCom\/CPSCom\/SmartData 2018, Halifax, NS, Canada, July 30\u2013August 3, 2018, pp 1084\u20131091. IEEE, Halifax https:\/\/doi.org\/10.1109\/CYBERMATICS_2018.2018.00199","DOI":"10.1109\/CYBERMATICS_2018.2018.00199"},{"key":"432_CR28","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-92068-5_21","volume-title":"Advances in cryptology\u2014ASIACRYPT 2021","author":"P Fauzi","year":"2021","unstructured":"Fauzi P, Lipmaa H, Siim J, Zaj\u0105c M, \u00d8degaard AT (2021) Verifiably-extractable OWFs and their applications to subversion zero-knowledge. In: Tibouchi M, Wang H (eds) Advances in cryptology\u2014ASIACRYPT 2021. Springer, Cham, pp 618\u2013649"},{"key":"432_CR29","first-page":"186","volume-title":"Advances in cryptology\u2014CRYPTO\u2019 86","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\u2014CRYPTO\u2019 86. Springer, Berlin, pp 186\u2013194"},{"key":"432_CR30","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-76578-5_11","volume-title":"Public-key cryptography\u2014PKC 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer G (2018) Subversion-zero-knowledge snarks. In: Abdalla M, Dahab R (eds) Public-key cryptography\u2014PKC 2018. Springer, Cham, pp 315\u2013347"},{"key":"432_CR31","doi-asserted-by":"publisher","unstructured":"Fuchsbauer G (2019) Wi is not enough: zero-knowledge contingent (service) payments revisited. In: Proceedings of the 2019 ACM SIGSAC conference on computer and communications security. CCS \u201919, pp 49\u201362. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3319535.3354234","DOI":"10.1145\/3319535.3354234"},{"key":"432_CR32","unstructured":"Gabizon A, Williamson ZJ, Ciobotaru O (2019) PLONK: permutations over Lagrange-bases for Oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953. https:\/\/eprint.iacr.org\/2019\/953"},{"key":"432_CR33","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in cryptology\u2014EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro R, Gentry C, Parno B, Raykova M (2013) Quadratic span programs and succinct NIZKs without PCPs. In: Johansson T, Nguyen PQ (eds) Advances in cryptology\u2014EUROCRYPT 2013. Springer, Berlin, pp 626\u2013645"},{"issue":"1","key":"432_CR34","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser S, Micali S, Rackoff C (1989) The knowledge complexity of interactive proof systems. SIAM J Comput 18(1):186\u2013208. https:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM J Comput"},{"key":"432_CR35","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in cryptology\u2014ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth J (2010) Short pairing-based non-interactive zero-knowledge arguments. In: Abe M (ed) Advances in cryptology\u2014ASIACRYPT 2010. Springer, Berlin, pp 321\u2013340"},{"key":"432_CR36","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in cryptology\u2014EUROCRYPT 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\u2014EUROCRYPT 2016. Springer, Berlin, pp 305\u2013326"},{"key":"432_CR37","doi-asserted-by":"publisher","unstructured":"Groth J, Maller M (2017) Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks. In: Katz J, Shacham H (eds) Advances in cryptology\u2014CRYPTO 2017\u201437th annual international cryptology conference, Santa Barbara, CA, USA, August 20\u201324, 2017, Proceedings, Part II. Lecture notes in computer science, vol 10402, pp 581\u2013612. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-63715-0_20","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"432_CR38","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-319-96878-0_24","volume-title":"Advances in cryptology\u2014CRYPTO 2018","author":"J Groth","year":"2018","unstructured":"Groth J, Kohlweiss M, Maller M, Meiklejohn S, Miers I (2018) Updatable and universal common reference strings with applications to zk-SNARKs. In: Shacham H, Boldyreva A (eds) Advances in cryptology\u2014CRYPTO 2018. Springer, Cham, pp 698\u2013728"},{"key":"432_CR39","doi-asserted-by":"crossref","unstructured":"Kilian J (1992) A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Kosaraju SR, Fellows M, Wigderson A, Ellis JA (eds) Proceedings of the 24th annual ACM symposium on theory of computing, May 4\u20136, 1992, Victoria, British Columbia, Canada, pp 723\u2013732. ACM, New York","DOI":"10.1145\/129712.129782"},{"key":"432_CR40","doi-asserted-by":"publisher","unstructured":"Kosba AE, Miller A, Shi E, Wen Z, Papamanthou C (2016) Hawk: The blockchain model of cryptography and privacy-preserving smart contracts. In: IEEE symposium on security and privacy, SP 2016, San Jose, CA, USA, May 22\u201326, 2016, pp. 839\u2014858. IEEE Computer Society, San Jose. https:\/\/doi.org\/10.1109\/SP.2016.55","DOI":"10.1109\/SP.2016.55"},{"key":"432_CR41","unstructured":"Labs M. Bellman: Bellman zkSNARK library for community with Ethereum\u2019s BN256 support. Github https:\/\/github.com\/matter-labs\/bellman"},{"key":"432_CR42","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-28914-9_10","volume-title":"Theory of cryptography","author":"H Lipmaa","year":"2012","unstructured":"Lipmaa H (2012) Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: Cramer R (ed) Theory of cryptography. Springer, Berlin, pp 169\u2013189"},{"key":"432_CR43","doi-asserted-by":"publisher","unstructured":"Lipmaa H (2022) A unified framework for non-universal snarks. In: Hanaoka G, Shikata J, Watanabe Y (eds) Public-key cryptography\u2014PKC 2022\u201425th IACR international conference on practice and theory of public-key cryptography, virtual event, March 8\u201311, 2022, Proceedings, part I. Lecture notes in computer science, vol 13177, pp 553\u2013583. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-97121-2_20","DOI":"10.1007\/978-3-030-97121-2_20"},{"key":"432_CR44","doi-asserted-by":"publisher","unstructured":"Li Q, Xue Z (2020) A privacy-protecting authorization system based on blockchain and zk-SNARK. In: Tian Z, Yin L, Gu Z (eds) CIAT 2020: international conference on cyberspace innovation of advanced technologies, virtual event\/Guangzhou, China, December 5, 2020, pp 439\u2013444. ACM, Guangzhou. https:\/\/doi.org\/10.1145\/3444370.3444610","DOI":"10.1145\/3444370.3444610"},{"key":"432_CR45","doi-asserted-by":"crossref","unstructured":"Maller M, Bowe S, Kohlweiss M, Meiklejohn S (2019) Sonic: zero-knowledge SNARKs from linear-size universal and updateable structured reference strings. Cryptology ePrint Archive, Paper 2019\/099. https:\/\/eprint.iacr.org\/2019\/099","DOI":"10.1145\/3319535.3339817"},{"issue":"4","key":"432_CR46","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali S (2000) Computationally sound proofs. SIAM J Comput 30(4):1253\u20131298. https:\/\/doi.org\/10.1137\/S0097539795284959","journal-title":"SIAM J Comput"},{"key":"432_CR47","doi-asserted-by":"publisher","unstructured":"Nguyen K, Ambrona M, Abe M (2020) Wi is almost enough: Contingent payment all over again. In: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security. CCS \u201920, pp 641\u2013656. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3372297.3417888","DOI":"10.1145\/3372297.3417888"},{"key":"432_CR48","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in cryptology\u2014EUROCRYPT \u201996","author":"D Pointcheval","year":"1996","unstructured":"Pointcheval D, Stern J (1996) Security proofs for signature schemes. In: Maurer U (ed) Advances in cryptology\u2014EUROCRYPT \u201996. Springer, Berlin, pp 387\u2013398"},{"key":"432_CR49","unstructured":"Rondelet A, Zajac M (2019) ZETH: on integrating zerocash on ethereum. CoRR arXiv:1904.00905"},{"key":"432_CR50","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in cryptology\u2014CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty S (2020) Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio D, Ristenpart T (eds) Advances in cryptology\u2014CRYPTO 2020. Springer, Cham, pp 704\u2013737"},{"key":"432_CR51","doi-asserted-by":"publisher","unstructured":"Wahby RS, Tzialla I, Shelat A, Thaler J, Walfish M (2018) Doubly-efficient zkSNARKs without trusted setup. In: 2018 IEEE symposium on security and privacy (SP), pp 926\u2013943 https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00432-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00432-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00432-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:01:58Z","timestamp":1765411318000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00432-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"references-count":52,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00432-y","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"25 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"113"}}