{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T10:01:10Z","timestamp":1776074470899,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:00:00Z","timestamp":1772496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:00:00Z","timestamp":1772496000000},"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":["Int. J. Inf. Secur."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Non-interactive zero-knowledge (NIZK) proofs of knowledge have proven to be highly relevant for securely realizing a wide array of applications that rely on both\n                    <jats:italic>privacy<\/jats:italic>\n                    and\n                    <jats:italic>correctness<\/jats:italic>\n                    . They enable a prover to convince any party of the correctness of a public statement for a\n                    <jats:italic>secret witness<\/jats:italic>\n                    . However, most NIZKs do not natively support proving knowledge of a secret witness that is distributed over multiple provers. Previously, collaborative proofs\u00a0[54] have been proposed to overcome this limitation. We investigate the notion of composability in this setting, following the Commit-and-Prove design of LegoSNARK\u00a0[19]. Composability allows users to combine different, specialized NIZKs (e.g., one for arithmetic circuits, one for boolean circuits, and one for range proofs) with the aim of reducing the proof generation time. Moreover, it opens the door to efficient realizations of many applications in the collaborative setting such as mutually exclusive prover groups, combining collaborative and single-party proofs and efficiently implementing publicly auditable secure multiparty computing (PA-MPC). We present the first, general definition for collaborative commitand- prove NIZK (CP-NIZK) proofs of knowledge and construct MPC protocols to enable their realization. We implement our protocols for two commonly used NIZKs, Groth16 and Bulletproofs, and evaluate their practicality in a variety of computational settings. Our findings indicate that composability adds only minor overhead, especially for large circuits. We also evaluated our construction in two application settings, one of which shows 18\u2013\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$55\\times $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mn>55<\/mml:mn>\n                            <mml:mo>\u00d7<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    runtime reduction when compared to prior works while requiring only a fraction (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$0.2\\%$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mn>0.2<\/mml:mn>\n                            <mml:mo>%<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ) of the communication.\n                  <\/jats:p>","DOI":"10.1007\/s10207-026-01209-1","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:04:39Z","timestamp":1772517879000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative CP-NIZKs: modular, composable proofs for distributed secrets"],"prefix":"10.1007","volume":"25","author":[{"given":"Mohammed","family":"Alghazwi","sequence":"first","affiliation":[]},{"given":"Tariq","family":"Bontekoe","sequence":"additional","affiliation":[]},{"given":"Leon","family":"Visscher","sequence":"additional","affiliation":[]},{"given":"Fatih","family":"Turkmen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,3]]},"reference":[{"key":"1209_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Ganesh, C., Mohassel, P.: Non-Interactive Zero-Knowledge Proofs for Composite Statements. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018, Lecture Notes in Computer Science, pp. 643\u2013673. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_22","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"1209_CR2","unstructured":"Alghazwi, M., Davies-Batista, D., Karastoyanova, D., Turkmen, F.: Vpas: publicly verifiable and privacy-preserving aggregate statistics on distributed datasets. arXiv preprint arXiv:2403.15208 (2024)"},{"key":"1209_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.03.023","volume":"88","author":"R Alvarez","year":"2020","unstructured":"Alvarez, R., Nojoumian, M.: Comprehensive survey on privacy-preserving protocols for sealed-bid auctions. Computers & Security 88, 101,502 (2020). https:\/\/doi.org\/10.1016\/j.cose.2019.03.023","journal-title":"Computers & Security"},{"key":"1209_CR4","doi-asserted-by":"publisher","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, pp. 2087\u20132104. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"1209_CR5","unstructured":"arkworks contributors: arkworks zksnark ecosystem (2022). https:\/\/arkworks.rs"},{"key":"1209_CR6","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R.: Compressed $$\\Sigma $$-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology - CRYPTO 2020, Lecture Notes in Computer Science, pp. 513\u2013543. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18","DOI":"10.1007\/978-3-030-56877-1_18"},{"issue":"7","key":"1209_CR7","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1002812","volume":"8","author":"GS Barsh","year":"2012","unstructured":"Barsh, G.S., Copenhaver, G.P., Gibson, G., Williams, S.M.: Guidelines for genome-wide association studies. PLoS Genet. 8(7), e1002,812 (2012)","journal-title":"PLoS Genet."},{"key":"1209_CR8","doi-asserted-by":"publisher","unstructured":"Baum, C., Damg\u00e5rd, I., Orlandi, C.: Publicly Auditable Secure Multi-Party Computation. In: Abdalla, M., De Prisco, R. (eds.) Security and Cryptography for Networks, Lecture Notes in Computer Science, pp. 175\u2013196. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_11","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"1209_CR9","doi-asserted-by":"publisher","unstructured":"Baum, C., Jadoul, R., Orsini, E., Scholl, P., Smart, N.P.: Feta: efficient Threshold Designated-Verifier Zero-Knowledge Proofs. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, pp. 293\u2013306. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3559354","DOI":"10.1145\/3548606.3559354"},{"key":"1209_CR10","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient Multiparty Protocols Using Circuit Randomization. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPTO \u201991, Lecture Notes in Computer Science, pp. 420\u2013432. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"1209_CR11","doi-asserted-by":"publisher","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, pp. 287\u2013304. IEEE, San Jose, CA, USA (2015). https:\/\/doi.org\/10.1109\/SP.2015.25","DOI":"10.1109\/SP.2015.25"},{"key":"1209_CR12","doi-asserted-by":"publisher","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.) Advances in Cryptology - EUROCRYPT 2019, pp. 103\u2013128. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"1209_CR13","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) Theory of Cryptography, pp. 31\u201360. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"1209_CR14","doi-asserted-by":"publisher","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, ITCS \u201912, pp. 326\u2013349. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2090236.2090263.https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090263","DOI":"10.1145\/2090236.2090263."},{"key":"1209_CR15","doi-asserted-by":"publisher","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the twentieth annual ACM symposium on Theory of computing, STOC \u201988, pp. 103\u2013112. Association for Computing Machinery, New York, NY, USA (1988). https:\/\/doi.org\/10.1145\/62212.62222.","DOI":"10.1145\/62212.62222."},{"key":"1209_CR16","doi-asserted-by":"publisher","unstructured":"Bontekoe, T., Everts, M., Peter, A.: Balancing privacy and accountability in digital payment methods using zk-SNARKs. In: 2022 19th Annual International Conference on Privacy, Security & Trust (PST), pp. 1\u201310. IEEE, Fredericton, NB, Canada (2022). https:\/\/doi.org\/10.1109\/PST55820.2022.9851987","DOI":"10.1109\/PST55820.2022.9851987"},{"key":"1209_CR17","doi-asserted-by":"publisher","unstructured":"Bontekoe, T., Karastoyanova, D., Turkmen, F.: Verifiable privacy-preserving computing (2024). https:\/\/doi.org\/10.48550\/arXiv.2309.08248","DOI":"10.48550\/arXiv.2309.08248"},{"key":"1209_CR18","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: 2018 IEEE Symposium on Security and Privacy (SP), pp. 315\u2013334. IEEE, San Francisco, CA, USA (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"1209_CR19","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201919, pp. 2075\u20132092. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"1209_CR20","doi-asserted-by":"publisher","unstructured":"Chase, M., Ganesh, C., Mohassel, P.: Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology \u2013 CRYPTO 2016, pp. 499\u2013530. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_18","DOI":"10.1007\/978-3-662-53015-3_18"},{"issue":"1","key":"1209_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSECP.2004.1264852","volume":"2","author":"D Chaum","year":"2004","unstructured":"Chaum, D.: Secret-ballot receipts: true voter-verifiable elections. IEEE Security & Privacy 2(1), 38\u201347 (2004). https:\/\/doi.org\/10.1109\/MSECP.2004.1264852","journal-title":"IEEE Security & Privacy"},{"key":"1209_CR22","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS (2019). https:\/\/eprint.iacr.org\/2019\/1047. Publication info: a major revision of an IACR publication in EUROCRYPT 2020","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"1209_CR23","unstructured":"Chiesa, A., Lehmkuhl, R., Mishra, P., Zhang, Y.: Eos: efficient private delegation of zkSNARK provers. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 6453\u20136469. USENIX Association, Anaheim, CA, USA (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/chiesa"},{"key":"1209_CR24","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y., (eds.) Advances in Cryptology - EUROCRYPT 2020, Lecture Notes in Computer Science, pp. 769\u2013793. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27","DOI":"10.1007\/978-3-030-45721-1_27"},{"issue":"6","key":"1209_CR25","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1038\/nbt.4108","volume":"36","author":"H Cho","year":"2018","unstructured":"Cho, H., Wu, D.J., Berger, B.: Secure genome-wide association analysis using multiparty computation. Nat. Biotechnol. 36(6), 547\u2013551 (2018)","journal-title":"Nat. Biotechnol."},{"key":"1209_CR26","doi-asserted-by":"publisher","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), pp. 372\u2013382. IEEE, Portland, OR, USA (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.2","DOI":"10.1109\/SFCS.1985.2"},{"key":"1209_CR27","doi-asserted-by":"publisher","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS \u201912, pp. 90\u2013112. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2090236.2090245","DOI":"10.1145\/2090236.2090245"},{"key":"1209_CR28","doi-asserted-by":"publisher","unstructured":"Costello, C., Fournet, C., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B., Zahur, S.: Geppetto: Versatile Verifiable Computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 253\u2013270. IEEE, San Jose, CA, USA (2015). https:\/\/doi.org\/10.1109\/SP.2015.23","DOI":"10.1109\/SP.2015.23"},{"key":"1209_CR29","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology - CRYPTO 2012, Lecture Notes in Computer Science, pp. 643\u2013662. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"1209_CR30","doi-asserted-by":"crossref","unstructured":"Dayama, P., Patra, A., Paul, P., Singh, N., Vinayagamurthy, D.: How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols (2021). https:\/\/eprint.iacr.org\/2021\/1599","DOI":"10.2478\/popets-2022-0055"},{"key":"1209_CR31","doi-asserted-by":"publisher","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) Advances in Cryptology \u2013 CRYPTO 2001, pp. 566\u2013598. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_33","DOI":"10.1007\/3-540-44647-8_33"},{"key":"1209_CR32","unstructured":"de Valence, H., Yun, C., Andreev, O.: Bulletproofs. https:\/\/github.com\/dalek-cryptography\/bulletproofs (2024). Accessed 17 Mar 2024"},{"key":"1209_CR33","unstructured":"de Valence, H.: Merlin. https:\/\/github.com\/dalek-cryptography\/merlin (2024). Accessed: 2024\u201305-17"},{"key":"1209_CR34","unstructured":"Dutta, M., Ganesh, C., Patranabis, S., Singh, N.: Compute, but verify: efficient multiparty computation over authenticated inputs (2022). https:\/\/eprint.iacr.org\/2022\/1648. Publication info: Preprint"},{"key":"1209_CR35","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How To Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) Advances in Cryptology \u2013 CRYPTO\u2019 86, Lecture Notes in Computer Science, pp. 186\u2013194. Springer, Berlin, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1209_CR36","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge (2019). https:\/\/eprint.iacr.org\/2019\/953. Publication info: Preprint"},{"key":"1209_CR37","unstructured":"Garg, S., Goel, A., Jain, A., Policharla, G.V., Sekar, S.: zkSaaS: zero-knowledge snarks as a service. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 4427\u20134444. USENIX Association, Anaheim, CA, USA (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/garg"},{"key":"1209_CR38","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511721656.http:\/\/www.wisdom.weizmann.ac.il\/%7Eoded\/foc-vol2.html","DOI":"10.1017\/CBO9780511721656."},{"key":"1209_CR39","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.: On the (In)security of the fiat-shamir paradigm. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp. 102\u2013113. IEEE, Cambridge, MA, USA (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238185","DOI":"10.1109\/SFCS.2003.1238185"},{"issue":"1","key":"1209_CR40","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 J. Comput. 18(1), 186\u2013208 (1989). https:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM J. Comput."},{"key":"1209_CR41","doi-asserted-by":"publisher","unstructured":"Groth, J.: Non-interactive zero-knowledge arguments for voting. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) Applied Cryptography and Network Security, Lecture Notes in Computer Science, pp. 467\u2013482. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_32","DOI":"10.1007\/11496137_32"},{"key":"1209_CR42","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2016, Lecture Notes in Computer Science, pp. 305\u2013326. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"1209_CR43","doi-asserted-by":"publisher","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe M. (ed.) Advances in Cryptology - ASIACRYPT 2010, Lecture Notes in Computer Science, pp. 321\u2013340. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19","DOI":"10.1007\/978-3-642-17373-8_19"},{"issue":"3","key":"1209_CR44","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549\u2013587 (1990). https:\/\/doi.org\/10.1145\/79147.79161","journal-title":"J. ACM"},{"key":"1209_CR45","unstructured":"Hopwood, D.E., Bowe, S., Hornby, T., Wilcox, N.: Zcash Protocol Specification, Version 2023.4.0 [NU5] (2023). https:\/\/zips.z.cash\/protocol\/protocol.pdf. Protocol specification"},{"key":"1209_CR46","unstructured":"Jurek, K.: What is a zero-knowledge proof? (2023). https:\/\/www.aleo.org\/post\/what-is-a-zero-knowledge-proof\/"},{"key":"1209_CR47","doi-asserted-by":"crossref","unstructured":"Kanjalkar, S., Zhang, Y., Gandlur, S., Miller, A.: Publicly Auditable MPC-as-a-Service with succinct verification and universal setup (2021). ArXiv:2107.04248 [cs]","DOI":"10.1109\/EuroSPW54576.2021.00048"},{"issue":"4","key":"1209_CR48","first-page":"769","volume":"82","author":"H Kikuchi","year":"1999","unstructured":"Kikuchi, H., Hakavy, M., Tygar, D.: Multi-round anonymous auction protocols. IEICE Trans. Inf. Syst. 82(4), 769\u2013777 (1999)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"1209_CR49","doi-asserted-by":"publisher","unstructured":"Kohlweiss, M., Maller, M., Siim, J., Volkhov, M.: Snarky ceremonies. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2021, pp. 98\u2013127. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_4","DOI":"10.1007\/978-3-030-92078-4_4"},{"key":"1209_CR50","unstructured":"Lee, J., Choi, J., Kim, J., Oh, H.: SAVER: SNARK-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization (2019). https:\/\/eprint.iacr.org\/2019\/1270. Publication info: Preprint. MINOR revision"},{"key":"1209_CR51","unstructured":"Lindell, Y.: Secure Multiparty Computation (MPC) (2020). https:\/\/eprint.iacr.org\/2020\/300"},{"key":"1209_CR52","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: Prover-efficient commit-and-prove zero-knowledge SNARKs. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) Progress in Cryptology - AFRICACRYPT 2016, pp. 185\u2013206. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31517-1_10","DOI":"10.1007\/978-3-319-31517-1_10"},{"key":"1209_CR53","unstructured":"Marrika van, B.: ING launches Zero-Knowledge Range Proof solution, a major addition to blockchain technology (2017). https:\/\/www.ingwb.com\/en\/insights\/distributed-ledger-technology\/ing-launches-major-addition-to-blockchain-technology"},{"key":"1209_CR54","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 4291\u20134308. USENIX Association, Boston, MA (2022). https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/ozdemir"},{"key":"1209_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2021.102815","volume":"59","author":"S Panja","year":"2021","unstructured":"Panja, S., Roy, B.: A secure end-to-end verifiable e-voting system using blockchain and cloud server. Journal of Information Security and Applications 59, 102,815 (2021). https:\/\/doi.org\/10.1016\/j.jisa.2021.102815","journal-title":"Journal of Information Security and Applications"},{"key":"1209_CR56","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2013). https:\/\/doi.org\/10.1145\/2856449","DOI":"10.1145\/2856449"},{"key":"1209_CR57","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Distributed Provers with Applications to Undeniable Signatures. In: Davies, D.W. (ed.) Advances in Cryptology \u2013 EUROCRYPT \u201991, pp. 221\u2013242. Springer, Berlin, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_20","DOI":"10.1007\/3-540-46416-6_20"},{"key":"1209_CR58","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPTO \u201991, Lecture Notes in Computer Science, pp. 129\u2013140. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"1209_CR59","doi-asserted-by":"publisher","unstructured":"Ramchen, K., Culnane, C., Pereira, O., Teague, V.: Universally verifiable mpc and irv ballot counting. In: Goldberg, I., Moore, T. (eds.) Financial Cryptography and Data Security, Lecture Notes in Computer Science, pp. 301\u2013319. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_19","DOI":"10.1007\/978-3-030-32101-7_19"},{"key":"1209_CR60","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B., Veeningen, M., de Vreede, N.: Trinocchio: privacy-preserving outsourcing by distributed verifiable computation. In: Manulis, M., Sadeghi, A.R., Schneider, S. (eds.) Applied Cryptography and Network Security, Lecture Notes in Computer Science, pp. 346\u2013366. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_19","DOI":"10.1007\/978-3-319-39555-5_19"},{"key":"1209_CR61","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) Advances in Cryptology \u2013 CRYPTO\u2019 99, Lecture Notes in Computer Science, pp. 148\u2013164. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10","DOI":"10.1007\/3-540-48405-1_10"},{"key":"1209_CR62","doi-asserted-by":"publisher","unstructured":"Smart, N.P., Talibi Alaoui, Y.: Distributing any elliptic curve based protocol. In: Albrecht, M. (ed.) Cryptography and Coding, Lecture Notes in Computer Science, pp. 342\u2013366. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_17","DOI":"10.1007\/978-3-030-35199-1_17"},{"key":"1209_CR63","doi-asserted-by":"crossref","unstructured":"Veeningen, M.: Pinocchio-Based Adaptive zk-SNARKs and Secure\/Correct Adaptive Function Evaluation (2017). https:\/\/eprint.iacr.org\/2017\/013. Publication info: Published elsewhere. Minor revision. Proceedings AFRICACRYPT 2017","DOI":"10.1007\/978-3-319-57339-7_2"},{"key":"1209_CR64","doi-asserted-by":"publisher","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), pp. 926\u2013943. IEEE, San Francisco, CA, USA (2018). https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"},{"key":"1209_CR65","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), pp. 926\u2013943. IEEE (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"1209_CR66","unstructured":"Wu, H., Zheng, W., Chiesa, A., Popa, R.A., Stoica, I.: DIZK: a distributed zero knowledge proof system. In: 27th USENIX Security Symposium (USENIX Security 18), pp. 675\u2013692. USENIX Association, Baltimore, MD, USA (2018). https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/wu"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-026-01209-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-026-01209-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-026-01209-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T09:22:02Z","timestamp":1776072122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-026-01209-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,3]]},"references-count":66,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["1209"],"URL":"https:\/\/doi.org\/10.1007\/s10207-026-01209-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-7133038\/v1","asserted-by":"object"}]},"ISSN":["1615-5270"],"issn-type":[{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,3]]},"assertion":[{"value":"15 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 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":"One of the authors (Fatih Turkmen ) is on the editorial board of the International Journal of Information Security.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"64"}}