{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T17:31:29Z","timestamp":1771608689124,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T00:00:00Z","timestamp":1703289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T00:00:00Z","timestamp":1703289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s11704-023-2782-9","type":"journal-article","created":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T23:34:16Z","timestamp":1703288056000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Delegable zk-SNARKs with proxies"],"prefix":"10.1007","volume":"18","author":[{"given":"Jinrui","family":"Sha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,23]]},"reference":[{"issue":"3","key":"2782_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2220357.2220358","volume":"59","author":"J Groth","year":"2012","unstructured":"Groth J, Ostrovsky R, Sahai A. New techniques for noninteractive zero-knowledge. Journal of the ACM, 2012, 59(3): 1\u201335","journal-title":"Journal of the ACM"},{"key":"2782_CR2","doi-asserted-by":"crossref","unstructured":"Groth J, Ostrovsky R, Sahai A. Non-interactive zaps and new techniques for NIZK. In: Proceedings of the 26th Annual International Cryptology Conference. 2006, 97\u2013111","DOI":"10.1007\/11818175_6"},{"key":"2782_CR3","doi-asserted-by":"crossref","unstructured":"Groth J. Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security. 2006, 444\u2013459","DOI":"10.1007\/11935230_29"},{"issue":"5","key":"2782_CR4","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J Groth","year":"2012","unstructured":"Groth J, Sahai A. Efficient noninteractive proof systems for bilinear groups. SIAM Journal on Computing, 2012, 41(5): 1193\u20131232","journal-title":"SIAM Journal on Computing"},{"key":"2782_CR5","doi-asserted-by":"crossref","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. 2016, 305\u2013326","DOI":"10.1007\/978-3-662-49896-5_11"},{"issue":"1","key":"2782_CR6","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. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 1989, 18(1): 186\u2013208","journal-title":"SIAM Journal on Computing"},{"key":"2782_CR7","doi-asserted-by":"crossref","unstructured":"Blum M, Feldman P, Micali S. Non-interactive zero-knowledge and its applications. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1988, 103\u2013112","DOI":"10.1145\/62212.62222"},{"key":"2782_CR8","doi-asserted-by":"crossref","unstructured":"Kilian J. A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 1992, 723\u2013732","DOI":"10.1145\/129712.129782"},{"issue":"1","key":"2782_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S, Safra S. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 1998, 45(1): 70\u2013122","journal-title":"Journal of the ACM"},{"issue":"4","key":"2782_CR10","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali S. Computationally sound proofs. SIAM Journal on Computing, 2000, 30(4): 1253\u20131298","journal-title":"SIAM Journal on Computing"},{"key":"2782_CR11","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A. How to prove yourself: practical solutions to identification and signature problems. In: Proceedings of Conference on the Theory and Application of Cryptographic Techniques. 1986, 186\u2013194","DOI":"10.1007\/3-540-47721-7_12"},{"key":"2782_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky N, Canetti R, Chiesa A, Tromer E. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 2012, 326\u2013349","DOI":"10.1145\/2090236.2090263"},{"key":"2782_CR13","unstructured":"Goldwasser S, Lin H, Rubinstein A. Delegation of computation without rejection problem from designated verifier CS-proofs. Cryptology ePrint Archive, 2011"},{"key":"2782_CR14","doi-asserted-by":"crossref","unstructured":"Damgard I, Faust S, Hazay C. Secure two-party computation with low communication. In: Proceedings of the 9th Theory of Cryptography Conference. 2012, 54\u201374","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"2782_CR15","doi-asserted-by":"crossref","unstructured":"Groth J. Short pairing-based non-interactive zero-knowledge arguments. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. 2010, 321\u2013340","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"2782_CR16","doi-asserted-by":"crossref","unstructured":"Lipmaa H. Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Proceedings of the 19th International Conference on the Theory and Application of Cryptology and Information Security. 2013, 41\u201360","DOI":"10.1007\/978-3-642-42033-7_3"},{"key":"2782_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro R, Gentry C, Parno B, Raykova M. Quadratic span programs and succinct NIZKs without PCPs. In: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2013, 626\u2013645","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"2782_CR18","doi-asserted-by":"crossref","unstructured":"Bitansky N, Chiesa A, Ishai Y, Paneth O, Ostrovsky R. Succinct non-interactive arguments via linear interactive proofs. In: Proceedings of the 10th Theory of Cryptography Conference. 2013, 315\u2013333","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"2782_CR19","doi-asserted-by":"crossref","unstructured":"Setty S, Braun B, Vu V, Blumberg A J, Parno B, Walfish M. Resolving the conflict between generality and plausibility in verified computation. In: Proceedings of the 8th ACM European Conference on Computer Systems. 2013, 71\u201384","DOI":"10.1145\/2465351.2465359"},{"key":"2782_CR20","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E, Chiesa A, Genkin D, Tromer E, Virza M. SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Proceedings of the 33rd Annual Cryptology Conference. 2013, 90\u2013108","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"2782_CR21","doi-asserted-by":"crossref","unstructured":"Danezis G, Fournet C, Groth J, Kohlweiss M. Square span programs with applications to succinct NIZK arguments. In: Proceedings of the 20th International Conference on the Theory and Application of Cryptology and Information Security. 2014, 532\u2013550","DOI":"10.1007\/978-3-662-45611-8_28"},{"key":"2782_CR22","unstructured":"Ben-Sasson E, Chiesa A, Tromer E, Virza M. Succinct non-interactive zero knowledge for a von Neumann architecture. In: Proceedings of the 23rd USENIX Conference on Security Symposium. 2014, 781\u2013796"},{"key":"2782_CR23","doi-asserted-by":"crossref","unstructured":"Backes M, Barbosa M, Fiore D, Reischuk R M. ADSNARK: nearly practical and privacy-preserving proofs on authenticated data. In: Proceedings of 2015 IEEE Symposium on Security and Privacy. 2015, 271\u2013286","DOI":"10.1109\/SP.2015.24"},{"key":"2782_CR24","doi-asserted-by":"crossref","unstructured":"Costello C, Fournet C, Howell J, Kohlweiss M, Kreuter B, Naehrig M, Parno B, Zahur S. Geppetto: versatile verifiable computation. In: Proceedings of 2015 IEEE Symposium on Security and Privacy. 2015, 253\u2013270","DOI":"10.1109\/SP.2015.23"},{"key":"2782_CR25","doi-asserted-by":"crossref","unstructured":"Chiesa A, Tromer E, Virza M. Cluster computing in zero knowledge. In: Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2015, 371\u2013403","DOI":"10.1007\/978-3-662-46803-6_13"},{"key":"2782_CR26","doi-asserted-by":"crossref","unstructured":"Groth J, Kohlweiss M, Maller M, Meiklejohn S, Miers I. Updatable and universal common reference strings with applications to zk-SNARKs. In: Proceedings of the 38th Annual International Cryptology Conference. 2018, 698\u2013728","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"2782_CR27","doi-asserted-by":"crossref","unstructured":"Maller M, Bowe S, Kohlweiss M, Meiklejohn S. Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Proceedings of 2019 ACM SIGSAC Conference on Computer and Communications Security. 2019, 2111\u20132128","DOI":"10.1145\/3319535.3339817"},{"key":"2782_CR28","doi-asserted-by":"crossref","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. 2020, 738\u2013768","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"2782_CR29","unstructured":"Gabizon A, Williamson Z J, Ciobotaru O. PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, 2019"},{"key":"2782_CR30","doi-asserted-by":"crossref","unstructured":"Bellare M, Fuchsbauer G, Scafuro A. NIZKs with an untrusted CRS: security in the face of parameter subversion. In: Proceedings of the 22nd International Conference on the Theory and Application of Cryptology and Information Security. 2016, 777\u2013804","DOI":"10.1007\/978-3-662-53890-6_26"},{"key":"2782_CR31","doi-asserted-by":"crossref","unstructured":"Abdolmaleki B, Baghery K, Lipmaa H, Zaj\u0105c M. A subversion-resistant SNARK. In: Proceedings of the 23rd International Conference on the Theory and Application of Cryptology and Information Security. 2017, 3\u201333","DOI":"10.1007\/978-3-319-70700-6_1"},{"key":"2782_CR32","doi-asserted-by":"crossref","unstructured":"Fuchsbauer G. Subversion-zero-knowledge SNARKs. In: Proceedings of the 21st IACR International Workshop on Public Key Cryptography. 2018, 315\u2013347","DOI":"10.1007\/978-3-319-76578-5_11"},{"key":"2782_CR33","doi-asserted-by":"crossref","unstructured":"Abe M, Fehr S. Perfect NIZK with adaptive soundness. In: Proceedings of the 4th Theory of Cryptography Conference. 2007, 118\u2013136","DOI":"10.1007\/978-3-540-70936-7_7"},{"key":"2782_CR34","doi-asserted-by":"crossref","unstructured":"Shoup V. Lower bounds for discrete logarithms and related problems. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. 1997, 256\u2013266","DOI":"10.1007\/3-540-69053-0_18"},{"key":"2782_CR35","unstructured":"Dent A W. The hardness of the DHK problem in the generic group model. Cryptology ePrint Archive, 2006"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2782-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-2782-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2782-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T20:23:38Z","timestamp":1763583818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-2782-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,23]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2782"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-2782-9","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,23]]},"assertion":[{"value":"3 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Competing interests\n                      The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"185812"}}