{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:12:34Z","timestamp":1757452354948,"version":"3.37.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2025,1]]},"abstract":"Abstract<\/jats:title>\n We propose a generic compiler that can convert any zero-knowledge (ZK) proof for SIMD circuits to general circuits efficiently, and an extension that can preserve the space complexity of the proof systems. Our compiler can immediately produce new results improving upon state of the art.\n \n By plugging in our compiler to Antman, an interactive sublinear-communication protocol, we improve the overall communication complexity for general circuits from \n \n $$\\mathcal {O}(C^{3\/4})$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n C<\/mml:mi>\n \n 3<\/mml:mn>\n \/<\/mml:mo>\n 4<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> to \n \n $$\\mathcal {O}(C^{1\/2})$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n C<\/mml:mi>\n \n 1<\/mml:mn>\n \/<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>. Our implementation shows that for a circuit of size \n \n $$2^{27}$$<\/jats:tex-math>\n \n \n 2<\/mml:mn>\n 27<\/mml:mn>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>, it achieves up to \n \n $$83.6\\times $$<\/jats:tex-math>\n \n \n 83.6<\/mml:mn>\n \u00d7<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> improvement on communication compared to the state-of-the-art implementation. Its end-to-end running time is at least \n \n $$70\\%$$<\/jats:tex-math>\n \n \n 70<\/mml:mn>\n %<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> faster in a 10Mbps network.<\/jats:p>\n <\/jats:list-item>\n \n Using the recent results on compressed \n \n $$\\varSigma $$<\/jats:tex-math>\n \n \u03a3<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>-protocol theory, we obtain a discrete-log-based constant-round zero-knowledge argument with \n \n $$\\mathcal {O}(C^{1\/2})$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n C<\/mml:mi>\n \n 1<\/mml:mn>\n \/<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> communication and common random string length, improving over the state of the art that has linear-size common random string and requires heavier computation.<\/jats:p>\n <\/jats:list-item>\n \n We improve the communication of a designated n<\/jats:italic>-verifier zero-knowledge proof from \n \n $$\\mathcal {O}(nC\/B+n^2B^2)$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n n<\/mml:mi>\n C<\/mml:mi>\n \/<\/mml:mo>\n B<\/mml:mi>\n +<\/mml:mo>\n \n n<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msup>\n \n B<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> to \n \n $$\\mathcal {O}(nC\/B+n^2)$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n n<\/mml:mi>\n C<\/mml:mi>\n \/<\/mml:mo>\n B<\/mml:mi>\n +<\/mml:mo>\n \n n<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>.<\/jats:p>\n <\/jats:list-item>\n <\/jats:list> To demonstrate the scalability of our compilers, we were able to extract a commit-and-prove SIMD ZK from Ligero and cast it in our framework. We also give one instantiation derived from LegoSNARK, demonstrating that the idea of CP-SNARK also fits in our methodology.<\/jats:p>","DOI":"10.1007\/s00145-024-09531-4","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T23:02:31Z","timestamp":1733439751000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient ZK Compiler from SIMD Circuits to General Circuits"],"prefix":"10.1007","volume":"38","author":[{"given":"Dung","family":"Bui","sequence":"first","affiliation":[]},{"given":"Haotian","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chenkai","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Kang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"key":"9531_CR1","doi-asserted-by":"crossref","unstructured":"C.J. Alpert, J.H. Huang, A.B. Kahng, Multilevel circuit partitioning, in Proceedings of the 34th Annual Design Automation Conference (1997), pp. 530\u2013533","DOI":"10.1145\/266021.266275"},{"key":"9531_CR2","doi-asserted-by":"publisher","unstructured":"S. Ames, C. Hazay, Y. Ishai, M. Venkitasubramaniam, Ligero: Lightweight sublinear arguments without a trusted setup, in B.M. Thuraisingham, D. Evans, T. Malkin, D. Xu (eds.) ACM CCS 2017 (ACM Press, 2017), pp. 2087\u20132104. https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"9531_CR3","doi-asserted-by":"publisher","unstructured":"T. Attema, R. Cramer, Compressed $$\\Sigma $$-protocol theory and practical application to plug & play secure algorithmics, in D. Micciancio, T. Ristenpart (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172 (Springer, Heidelberg, 2020), pp. 513\u2013543. https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"9531_CR4","doi-asserted-by":"publisher","unstructured":"L. Bangalore, R. Bhadauria, C. Hazay, M. Venkitasubramaniam, On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives, in E. Kiltz, V. Vaikuntanathan (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747. (Springer, Heidelberg, 2022), pp. 417\u2013446.https:\/\/doi.org\/10.1007\/978-3-031-22318-1_15","DOI":"10.1007\/978-3-031-22318-1_15"},{"key":"9531_CR5","doi-asserted-by":"publisher","unstructured":"C. Baum, A.J. Malozemoff, M.B. Rosen, P. Scholl, Mac\u2019n\u2019cheese: Zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions, in T. Malkin, C. Peikert (eds.) CRYPTO\u00a02021, Part\u00a0IV. LNCS, vol. 12828(Springer, Heidelberg, Virtual Event, 2021), pp. 92\u2013122.https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"9531_CR6","doi-asserted-by":"publisher","unstructured":"R. Bhadauria, Z. Fang, C. Hazay, M. Venkitasubramaniam, T. Xie, Y. Zhang, Ligero++: a new optimized sublinear IOP, in J. Ligatti, X. Ou, J. Katz, G. Vigna (eds.) ACM CCS 2020 (ACM Press, 2020). pp. 2025\u20132038.https:\/\/doi.org\/10.1145\/3372297.3417893","DOI":"10.1145\/3372297.3417893"},{"key":"9531_CR7","doi-asserted-by":"publisher","unstructured":"N. Bitansky, R. Canetti, A. Chiesa, E. Tromer, Recursive composition and bootstrapping for SNARKS and proof-carrying data, in D. Boneh, T. Roughgarden, J. Feigenbaum (eds.) 45th ACM STOC (ACM Press, 2013), pp. 111\u2013120. https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"9531_CR8","doi-asserted-by":"publisher","unstructured":"N. Bitansky, A. Chiesa, Succinct arguments from multi-prover interactive proofs and their efficiency benefits, in R. Safavi-Naini, R. Canetti (eds.) CRYPTO\u00a02012. LNCS, vol.\u00a07417 (Springer, Heidelberg, 2012), pp. 255\u2013272. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_16","DOI":"10.1007\/978-3-642-32009-5_16"},{"key":"9531_CR9","unstructured":"Block, A.R., Garman, C.: Honest majority multi-prover interactive arguments. Cryptology ePrint Archive, Report 2022\/557 (2022), https:\/\/eprint.iacr.org\/2022\/557"},{"key":"9531_CR10","doi-asserted-by":"publisher","unstructured":"A.R. Block, J. Holmgren, A. Rosen, R.D. Rothblum, P. Soni, Public-coin zero-knowledge arguments with (almost) minimal time and space overheads, in R. Pass, K. Pietrzak (eds.) TCC\u00a02020, Part\u00a0II. LNCS, vol. 12551 (Springer, Heidelberg, 2020), pp. 168\u2013197. https:\/\/doi.org\/10.1007\/978-3-030-64378-2_7","DOI":"10.1007\/978-3-030-64378-2_7"},{"key":"9531_CR11","doi-asserted-by":"publisher","unstructured":"A.R. Block, J. Holmgren, A. Rosen, R.D. Rothblum, P. Soni, Time- and space-efficient arguments from groups of unknown order, in T. Malkin, C. Peikert (eds.) CRYPTO\u00a02021, Part\u00a0IV. LNCS, vol. 12828 (Springer, Heidelberg, Virtual Event, 2021), pp. 123\u2013152. https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"9531_CR12","doi-asserted-by":"publisher","unstructured":"D. Boneh, E. Boyle, H. Corrigan-Gibbs, N. Gilboa, Y. Ishai, Zero-knowledge proofs on secret-shared data via fully linear PCPs, in A. Boldyreva, D. Micciancio (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694 (Springer, Heidelberg, 2019), pp. 67\u201397. https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"9531_CR13","doi-asserted-by":"publisher","unstructured":"J. Bootle, A. Chiesa, Y. Hu, M. Orr\u00f9, Gemini: Elastic SNARKs for diverse environments, in O. Dunkelman, S. Dziembowski (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276 (Springer, Heidelberg, 2022), pp. 427\u2013457. https:\/\/doi.org\/10.1007\/978-3-031-07085-3_15","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"9531_CR14","unstructured":"S. Bowe, J. Grigg, D. Hopwood, Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"9531_CR15","doi-asserted-by":"publisher","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, A. Nof, Sublinear GMW-style compiler for MPC with preprocessing, in T. Malkin, C. Peikert (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826 (Springer, Heidelberg, Virtual Event, 2021), pp. 457\u2013485. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_16","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"9531_CR16","doi-asserted-by":"publisher","unstructured":"B. B\u00fcnz, A. Chiesa, W. Lin, P. Mishra, N. Spooner, Proof-carrying data without succinct arguments, in T. Malkin, C. Peikert (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825 (Springer, Heidelberg, Virtual Event, 2021), pp. 681\u2013710. https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"9531_CR17","doi-asserted-by":"publisher","unstructured":"M. Campanelli, A. Faonio, D. Fiore, A. Querol, H. Rodr\u00edguez, Lunar: A toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. in M. Tibouchi, H. Wang (eds.) ASIACRYPT\u00a02021, Part\u00a0III. LNCS, vol. 13092 (Springer, Heidelberg, 2021), pp. 3\u201333. https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1","DOI":"10.1007\/978-3-030-92078-4_1"},{"key":"9531_CR18","doi-asserted-by":"publisher","unstructured":"M. Campanelli, D. Fiore, A. Querol, LegoSNARK: modular design and composition of succinct zero-knowledge proofs, in L. Cavallaro, J. Kinder, X. Wang, J. Katz (eds.) ACM CCS 2019 (ACM Press, 2019). pp. 2075\u20132092. https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"9531_CR19","doi-asserted-by":"publisher","unstructured":"B. Chen, B. B\u00fcnz, D. Boneh, Z. Zhang, HyperPlonk: plonk with linear-time prover and high-degree custom gates, in EUROCRYPT\u00a02023, Part\u00a0II. LNCS (Springer, Heidelberg, 2023), pp. 499\u2013530. https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"9531_CR20","doi-asserted-by":"publisher","unstructured":"A. Chiesa, Y. Hu, M. Maller, P. Mishra, P. Vesely, N.P. Ward, Marlin: preprocessing zkSNARKs with universal and updatable SRS, in A. Canteaut, Y. Ishai (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105 (Springer, Heidelberg, 2020), pp. 738\u2013768. https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"9531_CR21","doi-asserted-by":"publisher","unstructured":"I. Damg\u00e5rd, V. Pastro, N.P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption. in R. Safavi-Naini, R. Canetti (eds.) CRYPTO\u00a02012. LNCS, vol.\u00a07417 (Springer, Heidelberg, 2012), pp. 643\u2013662. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9531_CR22","doi-asserted-by":"publisher","unstructured":"C. Delpech de Saint Guilhem, E. Orsini, T. Tanguy, Limbo: efficient zero-knowledge MPCitH-based arguments, in G. Vigna, E. Shi (eds.) ACM CCS 2021 (ACM Press, 2021), pp. 3022\u20133036. https:\/\/doi.org\/10.1145\/3460120.3484595","DOI":"10.1145\/3460120.3484595"},{"key":"9531_CR23","unstructured":"S. Dittmer, Y. Ishai, R. Ostrovsky, Line-point zero knowledge and its applications. Cryptology ePrint Archive, Report 2020\/1446 (2020). https:\/\/eprint.iacr.org\/2020\/1446"},{"key":"9531_CR24","doi-asserted-by":"publisher","unstructured":"N. Ephraim, C. Freitag, I. Komargodski, R. Pass, SPARKs: succinct parallelizable arguments of knowledge, in A. Canteaut, Y. Ishai (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105 (Springer, Heidelberg, 2020), pp. 707\u2013737. https:\/\/doi.org\/10.1007\/978-3-030-45721-1_25","DOI":"10.1007\/978-3-030-45721-1_25"},{"key":"9531_CR25","doi-asserted-by":"publisher","unstructured":"M.K. Franklin, M. Yung, Communication complexity of secure computation (extended abstract), in 24th ACM STOC (ACM Press, 1992). pp. 699\u2013710. https:\/\/doi.org\/10.1145\/129712.129780","DOI":"10.1145\/129712.129780"},{"key":"9531_CR26","unstructured":"A. Gabizon, Z.J. Williamson, O. Ciobotaru, PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"9531_CR27","doi-asserted-by":"publisher","unstructured":"R. Gennaro, C. Gentry, B. Parno, M. Raykova, Quadratic span programs and succinct NIZKs without PCPs, in T. Johansson, P.Q. Nguyen (eds.) EUROCRYPT\u00a02013. LNCS, vol.\u00a07881 (Springer, Heidelberg, 2013), pp. 626\u2013645. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"9531_CR28","unstructured":"V. Goyal, Y. Song, Malicious security comes free in honest-majority MPC. Cryptology ePrint Archive, Report 2020\/134 (2020). https:\/\/eprint.iacr.org\/2020\/134"},{"key":"9531_CR29","doi-asserted-by":"publisher","unstructured":"V. Goyal, Y. Song, C. Zhu, Guaranteed output delivery comes free in honest majority MPC, in D. Micciancio, T. Ristenpart (eds.) CRYPTO\u00a02020, Part\u00a0II. LNCS, vol. 12171 (Springer, Heidelberg, 2020), pp. 618\u2013646. https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"9531_CR30","doi-asserted-by":"publisher","unstructured":"J. Groth, Linear algebra with sub-linear zero-knowledge arguments, in S. Halevi (ed.) CRYPTO\u00a02009. LNCS, vol.\u00a05677 (Springer, Heidelberg, 2009), pp. 192\u2013208. https:\/\/doi.org\/10.1007\/978-3-642-03356-8_12","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"9531_CR31","doi-asserted-by":"publisher","unstructured":"J. Holmgren, R. Rothblum, Delegating computations with (almost) minimal time and space overhead, in M. Thorup (ed.) 59th FOCS (IEEE Computer Society Press, 2018). pp. 124\u2013135. https:\/\/doi.org\/10.1109\/FOCS.2018.00021","DOI":"10.1109\/FOCS.2018.00021"},{"key":"9531_CR32","doi-asserted-by":"publisher","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in D.S. Johnson, U. Feige (eds.) 39th ACM STOC (ACM Press, 2007), pp. 21\u201330. https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"9531_CR33","unstructured":"S. Kanjalkar, Y. Zhang, S. Gandlur, A. Miller, Publicly auditable mpc-as-a-service with succinct verification and universal setup. CoRR abs\/2107.04248 (2021). https:\/\/arxiv.org\/abs\/2107.04248"},{"key":"9531_CR34","doi-asserted-by":"publisher","unstructured":"M. Keller, V. Pastro, D. Rotaru, Overdrive: making SPDZ great again, in J.B. Nielsen, V. Rijmen (eds.) EUROCRYPT\u00a02018, Part\u00a0III. LNCS, vol. 10822 (Springer, Heidelberg, 2018), pp. 158\u2013189. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"9531_CR35","unstructured":"A. Kothapalli, S. Setty, SuperNova: proving universal machine executions without universal circuits. Cryptology ePrint Archive, Report 2022\/1758 (2022). https:\/\/eprint.iacr.org\/2022\/1758"},{"key":"9531_CR36","doi-asserted-by":"crossref","unstructured":"A. Kothapalli, S. Setty, Hypernova: recursive arguments for customizable constraint systems. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"9531_CR37","doi-asserted-by":"publisher","unstructured":"A. Kothapalli, S. Setty, I. Tzialla, Nova: recursive zero-knowledge arguments from folding schemes, in Y. Dodis, T. Shrimpton (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510 (Springer, Heidelberg, 2022), pp. 359\u2013388. https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"9531_CR38","doi-asserted-by":"publisher","unstructured":"H. Lipmaa, Prover-efficient commit-and-prove zero-knowledge SNARKs, in D. Pointcheval, A. Nitaj, T. Rachidi (eds.) AFRICACRYPT 16. LNCS, vol.\u00a09646 (Springer, Heidelberg, 2016), pp. 185\u2013206. https:\/\/doi.org\/10.1007\/978-3-319-31517-1_10","DOI":"10.1007\/978-3-319-31517-1_10"},{"key":"9531_CR39","doi-asserted-by":"publisher","unstructured":"C. Lund, L. Fortnow, H.J. Karloff, N. Nisan, Algebraic methods for interactive proof systems, in 31st FOCS (IEEE Computer Society Press, 1990), pp. 2\u201310. https:\/\/doi.org\/10.1109\/FSCS.1990.89518","DOI":"10.1109\/FSCS.1990.89518"},{"key":"9531_CR40","unstructured":"A. Ozdemir, D. Boneh, Experimenting with collaborative zk-SNARKs: zero-knowledge proofs for distributed secrets, in K.R.B. Butler, K. Thomas (eds.) USENIX Security 2022 (USENIX Association, 2022), pp. 4291\u20134308"},{"key":"9531_CR41","doi-asserted-by":"publisher","unstructured":"B. Patt-Shamir, A note on efficient aggregate queries in sensor networks, in S. Chaudhuri, S. Kutten (eds.) 23rd ACM PODC (ACM, 2004), pp. 283\u2013289. https:\/\/doi.org\/10.1145\/1011767.1011809","DOI":"10.1145\/1011767.1011809"},{"key":"9531_CR42","doi-asserted-by":"publisher","unstructured":"T.P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in J. Feigenbaum (ed.) CRYPTO\u201991. LNCS, vol.\u00a0576 (Springer, Heidelberg, 1992), pp. 129\u2013140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"issue":"3","key":"9531_CR43","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/net.3230130305","volume":"13","author":"Y Perl","year":"1983","unstructured":"Y. Perl, M. Snir, Circuit partitioning with size and connection constraints. Networks 13(3), 365\u2013375 (1983)","journal-title":"Networks"},{"issue":"1","key":"9531_CR44","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/31.1694","volume":"35","author":"R Rohrer","year":"1988","unstructured":"R. Rohrer, Circuit partitioning simplified. IEEE Trans. Circuits Syst. 35(1), 2\u20135 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"9531_CR45","doi-asserted-by":"publisher","unstructured":"B. Schoenmakers, M. Veeningen, N. de\u00a0Vreede, Trinocchio: privacy-preserving outsourcing by distributed verifiable computation, in M. Manulis, A.R. Sadeghi, S. Schneider (eds.) ACNS 16. LNCS, vol.\u00a09696 (Springer, Heidelberg, 2016), pp. 346\u2013366. https:\/\/doi.org\/10.1007\/978-3-319-39555-5_19","DOI":"10.1007\/978-3-319-39555-5_19"},{"key":"9531_CR46","unstructured":"A. Microsoft SEAL (release 4.0). https:\/\/github.com\/Microsoft\/SEAL (2022), microsoft Research, Redmond, WA."},{"key":"9531_CR47","unstructured":"S. Setty, J. Thaler, R. Wahby, Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Paper 2023\/552 (2023). https:\/\/eprint.iacr.org\/2023\/552"},{"key":"9531_CR48","unstructured":"X. Wang, A.J. Malozemoff, J. Katz, EMP-toolkit: efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit (2016)"},{"key":"9531_CR49","doi-asserted-by":"publisher","unstructured":"C. Weng, K. Yang, J. Katz, X. Wang, Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits, in 2021 IEEE Symposium on Security and Privacy (IEEE Computer Society Press, 2021), pp. 1074\u20131091. https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"9531_CR50","doi-asserted-by":"publisher","unstructured":"C. Weng, K. Yang, Z. Yang, X. Xie, X. Wang, AntMan: interactive zero-knowledge proofs with sublinear communication, in H. Yin, A. Stavrou, C. Cremers, E. Shi (eds.) ACM CCS 2022 (ACM Press, 2022), pp. 2901\u20132914. https:\/\/doi.org\/10.1145\/3548606.3560667","DOI":"10.1145\/3548606.3560667"},{"key":"9531_CR51","unstructured":"H. Wu, W. Zheng, A. Chiesa, R.A. Popa, I. Stoica, DIZK: a distributed zero knowledge proof system, in W. Enck, A.P. Felt (eds.) USENIX Security 2018 (USENIX Association, 2018), pp. 675\u2013692"},{"key":"9531_CR52","doi-asserted-by":"publisher","unstructured":"K. Yang, P. Sarkar, C. Weng, X. Wang, QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field, in G. Vigna, E. Shi (eds.) ACM CCS 2021 (ACM Press, 2021), pp. 2986\u20133001. https:\/\/doi.org\/10.1145\/3460120.3484556","DOI":"10.1145\/3460120.3484556"},{"key":"9531_CR53","doi-asserted-by":"publisher","unstructured":"K. Yang, X. Wang, Non-interactive zero-knowledge proofs to multiple verifiers, in S. Agrawal, D. Lin (eds.) ASIACRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13793 (Springer, Heidelberg, 2022), pp. 517\u2013546. https:\/\/doi.org\/10.1007\/978-3-031-22969-5_18","DOI":"10.1007\/978-3-031-22969-5_18"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09531-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09531-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09531-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:33:25Z","timestamp":1739309605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09531-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["9531"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09531-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2024,12,5]]},"assertion":[{"value":"21 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}