{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T09:02:18Z","timestamp":1779872538880,"version":"3.53.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272491"],"award-info":[{"award-number":["62272491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272491"],"award-info":[{"award-number":["62272491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Project of Guangdong Provincial Key Laboratory of Information Security Technology","award":["2023B1212060026"],"award-info":[{"award-number":["2023B1212060026"]}]},{"name":"Project of Guangdong Provincial Key Laboratory of Information Security Technology","award":["2023B1212060026"],"award-info":[{"award-number":["2023B1212060026"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10207-025-01199-6","type":"journal-article","created":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T08:40:59Z","timestamp":1767429659000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Designated-verifier zk-SNARKs made easy"],"prefix":"10.1007","volume":"25","author":[{"given":"Chen","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,3]]},"reference":[{"key":"1199_CR1","unstructured":"0xPARC. circom-ecdsa: Big integer arithmetic and secp256k1 ECC operations in circom, (2024)"},{"key":"1199_CR2","unstructured":"Adhikary, S., Mondal, P., Karmakar, A.: Lattice-based zk-SNARKs with hybrid verification technique. Cryptology ePrint Archive, Paper 2025\/1839, (2025)"},{"key":"1199_CR3","doi-asserted-by":"crossref","unstructured":"Ames, S, Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201917, pages 2087\u20132104, New York, NY, USA, (2017). Association for Computing Machinery","DOI":"10.1145\/3133956.3134104"},{"key":"1199_CR4","doi-asserted-by":"crossref","unstructured":"Au, M.H., Susilo, W.: Two-party (blind) ring signatures and their applications. In Xinyi Huang and Jianying Zhou, editors, Information Security Practice and Experience, pages 403\u2013417, Cham, (2014). Springer International Publishing","DOI":"10.1007\/978-3-319-06320-1_30"},{"key":"1199_CR5","unstructured":"Belling, A., Soleimanian, A.: Vortex : Building a lattice-based SNARK scheme with transparent setup. IACR Cryptol. ePrint Arch., page 1633, (2022)"},{"issue":"6","key":"1199_CR6","doi-asserted-by":"publisher","first-page":"4733","DOI":"10.1109\/TDSC.2022.3232813","volume":"20","author":"M Bell\u00e9s-Mu\u00f1oz","year":"2023","unstructured":"Bell\u00e9s-Mu\u00f1oz, M., Isabel, M., Mu\u00f1oz-Tapia, J.L., Rubio, A., Baylina, J.: Circom: A circuit description language for building zero-knowledge applications. IEEE Trans. Dependable Secure Comput. 20(6), 4733\u20134751 (2023)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"1199_CR7","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Paper 2018\/046, (2018)"},{"key":"1199_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology \u2013 CRYPTO 2019, pages 701\u2013732, Cham, (2019). Springer International Publishing","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"1199_CR9","doi-asserted-by":"crossref","unstructured":"Ben\u00a0Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: Decentralized anonymous payments from bitcoin. In 2014 IEEE Symposium on Security and Privacy, pages 459\u2013474, (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"1199_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In 2015 IEEE Symposium on Security and Privacy, pages 287\u2013304, (2015)","DOI":"10.1109\/SP.2015.25"},{"key":"1199_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: Transparent succinct arguments for R1CS. In Yuval Ishai and Vincent Rijmen, editors, Advances in Cryptology \u2013 EUROCRYPT 2019, pages 103\u2013128, Cham, (2019). Springer International Publishing","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"1199_CR12","unstructured":"Benaloh, J.: Dense probabilistic encryption. In Proceedings of the workshop on selected areas of cryptography, pages 120\u2013128, (1994)"},{"key":"1199_CR13","doi-asserted-by":"crossref","unstructured":"Bhadauria, R., Fang, Z., Hazay, C., Venkitasubramaniam, M., Xie, T., Zhang, Y.: Ligero++: A new optimized sublinear IOP. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201920, pages 2025\u20132038, New York, NY, USA, (2020). Association for Computing Machinery","DOI":"10.1145\/3372297.3417893"},{"key":"1199_CR14","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., Ostrovsky, R.: Succinct non-interactive arguments via linear interactive proofs. In Amit Sahai, editor, Theory of Cryptography, pages 315\u2013333, Berlin, Heidelberg, (2013). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"1199_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Lattice-based SNARGs and their application to more efficient obfuscation. In Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, editors, Advances in Cryptology \u2013 EUROCRYPT 2017, pages 247\u2013277, Cham, (2017). Springer International Publishing","DOI":"10.1007\/978-3-319-56617-7_9"},{"key":"1199_CR16","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Quasi-optimal SNARGs via linear multi-prover interactive proofs. In Jesper\u00a0Buus Nielsen and Vincent Rijmen, editors, Advances in Cryptology \u2013 EUROCRYPT 2018, pages 222\u2013255, Cham, (2018). Springer International Publishing","DOI":"10.1007\/978-3-319-78372-7_8"},{"key":"1199_CR17","doi-asserted-by":"crossref","unstructured":"Bowe, S., Gabizon, A., Green, M.D.: A multi-party protocol for constructing the public parameters of the pinocchio zk-SNARK. In Aviv Zohar, Ittay Eyal, Vanessa Teague, Jeremy Clark, Andrea Bracciali, Federico Pintore, and Massimiliano Sala, editors, Financial Cryptography and Data Security, pages 64\u201377, Berlin, Heidelberg, (2019). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-662-58820-8_5"},{"key":"1199_CR18","unstructured":"Bowe, S., Gabizon, A., Miers, I.: Scalable multi-party computation for zk-snark parameters in the random beacon model. Cryptology ePrint Archive, Paper 2017\/1050, (2017)"},{"key":"1199_CR19","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Khoshakhlagh, H.: Succinct publicly-certifiable proofs. In Avishek Adhikari, Ralf K\u00fcsters, and Bart Preneel, editors, Progress in Cryptology \u2013 INDOCRYPT 2021, pages 607\u2013631, Cham, (2021). Springer International Publishing","DOI":"10.1007\/978-3-030-92518-5_27"},{"key":"1199_CR20","doi-asserted-by":"crossref","unstructured":"Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D., Zaverucha, G.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201917, pages 1825\u20131842, New York, NY, USA, (2017). Association for Computing Machinery","DOI":"10.1145\/3133956.3133997"},{"key":"1199_CR21","unstructured":"Chaum, D.: Private signature and proof systems, US Patent 5,493,614, (1996)"},{"key":"1199_CR22","doi-asserted-by":"crossref","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: Hyperplonk: Plonk with linear-time prover and high-degree custom gates. In Carmit Hazay and Martijn Stam, editors, Advances in Cryptology \u2013 EUROCRYPT 2023, pages 499\u2013530, Cham, (2023). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"1199_CR23","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, Ni.: Marlin: Preprocessing zksnarks with universal and updatable srs. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology \u2013 EUROCRYPT 2020, pages 738\u2013768, Cham, (2020). Springer International Publishing","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"1199_CR24","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: Post-quantum and transparent recursive proofs from holography. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology \u2013 EUROCRYPT 2020, pages 769\u2013793, Cham, (2020). Springer International Publishing","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"1199_CR25","doi-asserted-by":"crossref","unstructured":"Debes, H.B., Giannetsos, T.: Retract: Expressive designated verifier anonymous credentials. In Proceedings of the 18th International Conference on Availability, Reliability and Security, ARES \u201923, New York, NY, USA, (2023). Association for Computing Machinery","DOI":"10.1145\/3600160.3600191"},{"key":"1199_CR26","unstructured":"Electron-Labs. ed25519-circom: Ed25519 implementation in circom, 2024"},{"issue":"4","key":"1199_CR27","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T Elgamal","year":"1985","unstructured":"Elgamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1199_CR28","unstructured":"Gabizon, A., Williamson, Z.J.: fflonk: a fast-fourier inspired verifier efficient version of PlonK. Cryptology ePrint Archive, Paper 2021\/1167, (2021)"},{"key":"1199_CR29","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953, (2019)"},{"key":"1199_CR30","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In Thomas Johansson and Phong\u00a0Q. Nguyen, editors, Advances in Cryptology \u2013 EUROCRYPT 2013, pages 626\u2013645, Berlin, Heidelberg, (2013). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"1199_CR31","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Minelli, M., Nitulescu, A., Orr\u00f9, M.: Lattice-based zk-SNARKs from square span programs. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201918, pages 556\u2013573, New York, NY, USA, (2018). Association for Computing Machinery","DOI":"10.1145\/3243734.3243845"},{"key":"1199_CR32","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: Faster Zero-Knowledge for boolean circuits. In 25th USENIX Security Symposium (USENIX Security 16), pages 1069\u20131083, Austin, TX, August (2016). USENIX Association"},{"key":"1199_CR33","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: Linear-time and field-agnostic SNARKs for R1CS. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology \u2013 CRYPTO 2023, pages 193\u2013226, Cham, (2023). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"1199_CR34","doi-asserted-by":"crossref","unstructured":"Gong, B., Au, M.H., Xue, H.: Constructing strong designated verifier signatures from key encapsulation mechanisms. In 2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications\/13th IEEE International Conference On Big Data Science And Engineering (TrustCom\/BigDataSE), pages 586\u2013593, (2019)","DOI":"10.1109\/TrustCom\/BigDataSE.2019.00084"},{"key":"1199_CR35","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In Marc Fischlin and Jean-S\u00e9bastien Coron, editors, Advances in Cryptology \u2013 EUROCRYPT 2016, pages 305\u2013326, Berlin, Heidelberg, (2016). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"1199_CR36","unstructured":"iden3. snarkjs: zkSNARK implementation in JavaScript & WASM, (2024)"},{"key":"1199_CR37","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Efficient arguments without short PCPs. In Twenty-Second Annual IEEE Conference on Computational Complexity (CCC\u201907), pages 278\u2013291, (2007)","DOI":"10.1109\/CCC.2007.10"},{"key":"1199_CR38","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC \u201907, pages 21\u201330, New York, NY, USA, (2007). Association for Computing Machinery","DOI":"10.1145\/1250790.1250794"},{"key":"1199_CR39","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Su, H., Wu, D.J.: Shorter and faster post-quantum designated-verifier zkSNARKs from lattices. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201921, pages 212\u2013234, New York, NY, USA, (2021). Association for Computing Machinery","DOI":"10.1145\/3460120.3484572"},{"key":"1199_CR40","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In Ueli Maurer, editor, Advances in Cryptology \u2014 EUROCRYPT \u201996, pages 143\u2013154, Berlin, Heidelberg, (1996). Springer Berlin Heidelberg","DOI":"10.1007\/3-540-68339-9_13"},{"key":"1199_CR41","doi-asserted-by":"crossref","unstructured":"Li, C., Zhang, F.: Strong designated-verifier zk-snarks. In Xiaofeng Chen, Haibo Hu, and Ding Wang, editors, Data Security and Privacy Protection, pages 359\u2013373, Singapore, (2026). Springer Nature Singapore","DOI":"10.1007\/978-981-95-3182-0_23"},{"key":"1199_CR42","doi-asserted-by":"crossref","unstructured":"Lin, X., Xia, H., Li, Y., Wang, M.: Batch lattice-based designated-verifier zk-snarks for r1cs. In Haixin Duan, Mourad Debbabi, Xavier de\u00a0Carn\u00e9\u00a0de Carnavalet, Xiapu Luo, Xiaojiang Du, and Man Ho\u00a0Allen Au, editors, Security and Privacy in Communication Networks, pages 329\u2013349, Cham, (2025). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-64948-6_17"},{"key":"1199_CR43","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, X., Zhang, Y.: zkcnn: Zero knowledge proofs for convolutional neural network predictions and accuracy. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201921, page 2968\u20132985, New York, NY, USA, (2021). Association for Computing Machinery","DOI":"10.1145\/3460120.3485379"},{"key":"1199_CR44","unstructured":"Nitulescu, A.: zk-SNARKs: a gentle introduction, (2020)"},{"key":"1199_CR45","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In Jacques Stern, editor, Advances in Cryptology \u2014 EUROCRYPT \u201999, pages 223\u2013238, Berlin, Heidelberg, (1999). Springer Berlin Heidelberg","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"2","key":"1199_CR46","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2856449","volume":"59","author":"B Parno","year":"2016","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2016)","journal-title":"Commun. ACM"},{"key":"1199_CR47","unstructured":"Pearson, L., Fitzgerald, J., Masip, H., Bell\u00e9s-Mu\u00f1oz, M., Mu\u00f1oz-Tapia, J.L.: PlonKup: Reconciling PlonK with plookup. Cryptology ePrint Archive, Paper 2022\/086, (2022)"},{"key":"1199_CR48","doi-asserted-by":"crossref","unstructured":"Saeednia, S., Kremer, S., Markowitch, O.: An efficient strong designated verifier signature scheme. In Jong-In Lim and Dong-Hoon Lee, editors, Information Security and Cryptology - ICISC 2003, pages 40\u201354, Berlin, Heidelberg, (2004). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-540-24691-6_4"},{"key":"1199_CR49","unstructured":"scipr lab. libiop: C++ library for IOP-based zkSNARKs, 2024"},{"key":"1199_CR50","doi-asserted-by":"crossref","unstructured":"Setty, S.: Spartan: Efficient and general-purpose zkSNARKs without trusted setup. In Daniele Micciancio and Thomas Ristenpart, editors, Advances in Cryptology \u2013 CRYPTO 2020, pages 704\u2013737, Cham, (2020). Springer International Publishing","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"1199_CR51","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Paper 2023\/552, (2023)"},{"key":"1199_CR52","unstructured":"Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A.J., Walfish, M.: Taking Proof-Based verified computation a few steps closer to practicality. In 21st USENIX Security Symposium (USENIX Security 12), pages 253\u2013268, Bellevue, WA, (2012). USENIX Association"},{"key":"1199_CR53","doi-asserted-by":"crossref","unstructured":"Steffen, S., Bichsel, B., Baumgartner, R., Vechev, M.: Zeestar: Private smart contracts by homomorphic encryption and zero-knowledge proofs. In 2022 IEEE Symposium on Security and Privacy (SP), pages 179\u2013197, (2022)","DOI":"10.1109\/SP46214.2022.9833732"},{"key":"1199_CR54","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In 2018 IEEE Symposium on Security and Privacy (SP), pages 926\u2013943, (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"1199_CR55","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: Efficient conversions for Zero-Knowledge proofs with applications to machine learning. In 30th USENIX Security Symposium (USENIX Security 21), pages 501\u2013518. USENIX Association, August (2021)"},{"key":"1199_CR56","doi-asserted-by":"publisher","first-page":"2218","DOI":"10.1109\/TIFS.2023.3262932","volume":"18","author":"J Weng","year":"2023","unstructured":"Weng, J., Weng, J., Tang, G., Yang, A., Li, M., Liu, J.-N.: pvCNN: Privacy-preserving and verifiable convolutional neural network testing. IEEE Trans. Inf. Forensics Secur. 18, 2218\u20132233 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1199_CR57","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: Zero knowledge proof with linear prover time. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology \u2013 CRYPTO 2022, pages 299\u2013328, Cham, (2022). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"1199_CR58","first-page":"220","volume":"10","author":"F-Y Yang","year":"2010","unstructured":"Yang, F.-Y., Liao, C.-M.: A provably secure and efficient strong designated verifier signature scheme. Int. J. Netw. Secur. 10, 220\u2013224 (2010)","journal-title":"Int. J. Netw. Secur."},{"key":"1199_CR59","doi-asserted-by":"publisher","first-page":"2533","DOI":"10.1109\/TIFS.2023.3348268","volume":"19","author":"T Zhaolu","year":"2024","unstructured":"Zhaolu, T., Wan, Z., Wang, H.: Division of regulatory power: Collaborative regulation for privacy-preserving blockchains. IEEE Trans. Inf. Forensics Secur. 19, 2533\u20132548 (2024)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1199_CR60","unstructured":"Zhu, X., Song, X.,\u00a0Deng, Y.: Fast and designated-verifier friendly zkSNARKs in the BPK model. Cryptology ePrint Archive, Paper 2023\/1806, (2023)"},{"key":"1199_CR61","unstructured":"zkp application. circom-rsa-verify: Zero knowledge proof for RSA, 2024"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01199-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-025-01199-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01199-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T08:05:57Z","timestamp":1779869157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-025-01199-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,3]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1199"],"URL":"https:\/\/doi.org\/10.1007\/s10207-025-01199-6","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,3]]},"assertion":[{"value":"23 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":"3 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":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"20"}}