{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:44Z","timestamp":1778249444692,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25336-1_3","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:15:46Z","timestamp":1778246146000},"page":"63-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Soloist: Distributed SNARK for\u00a0R1CS with\u00a0Constant Proof Size"],"prefix":"10.1007","author":[{"given":"Weihan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongyang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengfei","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"issue":"6","key":"3_CR2","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., Mel\u00e9, J.B.: Circom: a circuit description language for building zero-knowledge applications. IEEE Trans. Dependable Secur. Comput. 20(6), 4733\u20134751 (2023)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"3_CR3","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR ePrint 2018\/046"},{"key":"3_CR4","series-title":"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 \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"3_CR5","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR ePrint 2018\/046"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-030-84242-0_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"D Boneh","year":"2021","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: proof-carrying data from additive polynomial commitments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 649\u2013680. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_23"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: S&P (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"3_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-981-96-0935-2_9","volume-title":"ASIACRYPT","author":"B B\u00fcnz","year":"2024","unstructured":"B\u00fcnz, B., Chen, J.: Proofs for deep thought: accumulation for large memories and deterministic computations. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT. LNCS, vol. 15488, pp. 269\u2013301. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_9"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"3_CR10","series-title":"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 \u2013 ASIACRYPT 2021","author":"M Campanelli","year":"2021","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a\u00a0toolbox for\u00a0more efficient universal and\u00a0updatable zkSNARKs and\u00a0commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 3\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"3_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-031-30617-4_17","volume-title":"EUROCRYPT 2023","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: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17"},{"key":"3_CR12","series-title":"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 \u2013 EUROCRYPT 2020","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: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"3_CR13","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: Cached quotients for fast lookups. IACR ePrint 2022\/1763 (2022)"},{"key":"3_CR14","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. IACR ePrint 2020\/315 (2020)"},{"key":"3_CR15","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. IACR ePrint 2019\/953 (2019)"},{"key":"3_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-981-95-5116-3_15","volume-title":"ASIACRYPT 2025","author":"C Ganesh","year":"2025","unstructured":"Ganesh, C., Patranabis, S., Singh, N.: Samaritan: linear-time prover SNARK from new multilinear polynomial commitments. In: Hanaoka, G., Yang, B.Y. (eds.) ASIACRYPT 2025. LNCS, vol. 16249, pp. 456\u2013489. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-981-95-5116-3_15"},{"key":"3_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-031-38545-2_7","volume-title":"CRYPTO 2023","author":"A Golovnev","year":"2023","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: Linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7"},{"key":"3_CR18","series-title":"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 \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-319-96878-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"J Groth","year":"2018","unstructured":"Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., Miers, I.: Updatable and universal common reference strings with applications to\u00a0zk-SNARKs. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 698\u2013728. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_24"},{"key":"3_CR20","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. IACR ePrint 2022\/1530 (2022)"},{"key":"3_CR21","unstructured":"Hu, Y., et al.: DFS: delegation-friendly zksnark and private delegation of provers. In: USENIX Security (2025)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Knabenhans, C., Viand, A., Merino-Gallardo, A., Hithnawi, A.: vFHE: verifiable fully homomorphic encryption. In: WAHC (2024). https:\/\/doi.org\/10.1145\/3689945.3694806","DOI":"10.1145\/3689945.3694806"},{"key":"3_CR24","unstructured":"Kosba, A.E., Papadopoulos, D., Papamanthou, C., Song, D.: MIRAGE: succinct arguments for randomized algorithms with applications to universal zk-SNARKs. In: USENIX Security (2020)"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Lavaur, T., Lacan, J.: Boomy: Batch opening of multivariate polynomial commitment. IACR Commun. Cryptol. 2(1), 7 (2025). https:\/\/doi.org\/10.62056\/AN5TX4E-","DOI":"10.62056\/AN5TX4E-"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-90453-1_1","volume-title":"Theory of Cryptography","author":"J Lee","year":"2021","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 1\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Li, C., Li, Y., Zhu, P., Qu, W., Zhang, J.: Hyperpianist: pianist with linear-time prover via fully distributed hyperplonk. In: S&P (2025). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17, https:\/\/github.com\/AntCPLab\/HyperPianist","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"3_CR28","unstructured":"Li, W., et al.: Shred-to-shine metamorphosis of (distributed) polynomial commitments. IACR ePrint 2025\/1354 (2025). to appear at USENIX Security 2026"},{"key":"3_CR29","unstructured":"Li, W., Zhang, Z., Li, Y., Zhu, P., Hong, C., Liu, J.: Soloist: distributed SNARKs for rank-one constraint system. IACR ePrint 2025\/557"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Liu, T., Xie, T., Zhang, J., Song, D., Zhang, Y.: Pianist: scalable zkrollups via fully distributed zero-knowledge proofs. In: S&P (2024). https:\/\/doi.org\/10.1109\/SP54263.2024.00035","DOI":"10.1109\/SP54263.2024.00035"},{"key":"3_CR31","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with collaborative zk-SNARKs: zero-knowledge proofs for distributed secrets. In: USENIX Security (2022)"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Ozdemir, A., Brown, F., Wahby, R.S.: Circ: compiler infrastructure for proof systems, software verification, and more. In: S&P (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833782","DOI":"10.1109\/SP46214.2022.9833782"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Ozdemir, A., Wahby, R.S., Brown, F., Barrett, C.W.: Bounded verification for finite-field-blasting - in a compiler for zero knowledge proofs. In: CAV (2023). https:\/\/doi.org\/10.1007\/978-3-031-37709-9_8","DOI":"10.1007\/978-3-031-37709-9_8"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Pailoor, S., et al.: Automated detection of under-constrained circuits in zero-knowledge proofs. Proc. ACM Program. Lang. 7(PLDI), 1510\u20131532 (2023). https:\/\/doi.org\/10.1145\/3591282","DOI":"10.1145\/3591282"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Theory of Cryptography","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: S&P (2013). https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-030-84242-0_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C R\u00e0fols","year":"2021","unstructured":"R\u00e0fols, C., Zapico, A.: An algebraic framework for universal and updatable SNARKs. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 774\u2013804. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_27"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Rosenberg, M., Mopuri, T., Hafezi, H., Miers, I., Mishra, P.: Hekaton: horizontally-scalable zkSNARKs via proof aggregation. In: CCS (2024). https:\/\/doi.org\/10.1145\/3658644.369028, https:\/\/github.com\/Pratyush\/hekaton-system","DOI":"10.1145\/3658644.369028"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"key":"3_CR40","unstructured":"Setty, S.T.V., Thaler, J., Wahby, R.S.: Customizable constraint systems for succinct arguments. IACR ePrint 2023\/552 (2023)"},{"key":"3_CR41","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-031-58751-1_7","volume-title":"EUROCRYPT 2024","author":"STV Setty","year":"2024","unstructured":"Setty, S.T.V., Thaler, J., Wahby, R.S.: Unlocking the lookup singularity with lasso. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 180\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7"},{"key":"3_CR42","unstructured":"Stronati, M., Firsov, D., Locascio, A., Livshits, B.: Clap: a semantic-preserving optimizing eDSL for Plonkish proof systems. Arxiv 2405\/12115 (2023)"},{"key":"3_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-030-97121-2_19","volume-title":"PKC 2022","author":"A Szepieniec","year":"2022","unstructured":"Szepieniec, A., Zhang, Y.: Polynomial IOPs for linear algebra relations. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022. LNCS, vol. 13177, pp. 523\u2013552. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_19"},{"key":"3_CR44","unstructured":"Thaler, J.: 17 misconceptions about SNARKs (and why they hold us back). https:\/\/a16zcrypto.com\/posts\/article\/17-misconceptions-about-snarks\/"},{"key":"3_CR45","unstructured":"Wang, W., Shi, F., Vilardell, D., Zhang, F.: Cirrus: performant and accountable distributed SNARK. IACR ePrint 2024\/1873 (2024). to appear at NDSS 2026"},{"key":"3_CR46","unstructured":"Wu, H., Zheng, W., Chiesa, A., Popa, R.A., Stoica, I.: DIZK: a distributed zero knowledge proof system. In: USENIX Security (2018)"},{"key":"3_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-981-97-5025-2_24","volume-title":"ACISP 2024","author":"J Xie","year":"2024","unstructured":"Xie, J., Hu, Y., Yu, Y.: Hadamard product argument from lagrange-based univariate polynomials. In: Zhu, T., Li, Y. (eds.) ACISP 2024. LNCS, vol. 14895, pp. 472\u2013492. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-97-5025-2_24"},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Xie, T., et al.: zkBridge: trustless cross-chain bridges made practical. In: CCS (2022). https:\/\/doi.org\/10.1145\/3548606.3560652","DOI":"10.1145\/3548606.3560652"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"3_CR50","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-031-15985-5_11","volume-title":"CRYPTO 2022","author":"T Xie","year":"2022","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: Zero knowledge proof with linear prover time. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 299\u2013328. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11"},{"key":"3_CR51","doi-asserted-by":"publisher","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: Lookup arguments in sublinear time. In: CCS (2022). https:\/\/doi.org\/10.1145\/3548606.3560646","DOI":"10.1145\/3548606.3560646"},{"key":"3_CR52","doi-asserted-by":"publisher","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: S&P (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00052","DOI":"10.1109\/SP40000.2020.00052"},{"key":"3_CR53","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Szepieniec, A., Zhang, R., Sun, S., Wang, G., Gu, D.: VOProof: efficient zkSNARKs from vector oracle compilers. In: CCS (2022). https:\/\/doi.org\/10.1145\/3548606.3559387","DOI":"10.1145\/3548606.3559387"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:16:01Z","timestamp":1778246161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}