{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:08:51Z","timestamp":1772240931463,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002744","name":"Bar-Ilan University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002744","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Distributed zero-knowledge (dZK) proofs, recently introduced by Boneh et al. (CRYPTO\u201819), allow a prover\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal{P}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>P<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    to prove NP statements on an input\n                    <jats:italic>x<\/jats:italic>\n                    , which is distributed between\n                    <jats:italic>k<\/jats:italic>\n                    verifiers\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal{V}_1,\\ldots ,\\mathcal{V}_k$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>V<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mo>\u2026<\/mml:mo>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>V<\/mml:mi>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , where each\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal{V}_i$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>V<\/mml:mi>\n                            <mml:mi>i<\/mml:mi>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    holds only a piece of\n                    <jats:italic>x<\/jats:italic>\n                    . As in standard ZK proofs, dZK proofs guarantee Completeness when all parties are honest; Soundness against a malicious prover colluding with\n                    <jats:italic>t<\/jats:italic>\n                    verifiers; and Zero Knowledge against a subset of\n                    <jats:italic>t<\/jats:italic>\n                    malicious verifiers, in the sense that they learn nothing about the NP witness and the input pieces of the honest verifiers. Unfortunately, dZK proofs provide no correctness guarantee for an honest prover against a subset of maliciously corrupted verifiers. In particular, such verifiers might be able to \u201cframe\u201d the prover, causing honest verifiers to reject a true claim. This is a significant limitation, since such scenarios arise naturally in dZK applications, e.g., for proving honest behavior, and such attacks are indeed possible in existing dZKs (Boneh et al., CRYPTO\u201819). We put forth and study the notion of strong completeness for dZKs, guaranteeing that true claims are accepted even when\n                    <jats:italic>t<\/jats:italic>\n                    verifiers are maliciously corrupted. We then design strongly-complete dZK proofs in the honest-majority setting using the \u201cMPC-in-the-head\u201d paradigm of Ishai et al. (STOC\u201807), providing a novel analysis that exploits the unique properties of the distributed setting. To demonstrate the usefulness of strong completeness, we present several applications in which it is instrumental in obtaining security. First, we construct a certifiable version of Verifiable Secret Sharing (VSS), which is a VSS in which the dealer additionally proves that the shared secret satisfies a given NP relation. Our construction withstands a constant fraction of corruptions, whereas a previous construction of Ishai et al. (TCC\u201814) required\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$k={\\textsf{poly}}\\left( t\\right) $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>k<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mi>poly<\/mml:mi>\n                            <mml:mfenced>\n                              <mml:mi>t<\/mml:mi>\n                            <\/mml:mfenced>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . We also design a reusable version of certifiable VSS that we introduce, in which the dealer can prove an unlimited number of predicates on the same shared secret. Finally, we extend a compiler of Boneh et al. (CRYPTO\u201819), who used dZKs to transform a class of \u201cnatural\u201d semi-honest protocols in the honest-majority setting into maliciously secure ones with abort. Our compiler uses strongly-complete dZKs to obtain identifiable abort.\n                  <\/jats:p>","DOI":"10.1007\/s00145-026-09576-7","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:25:39Z","timestamp":1772238339000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Your Reputation\u2019s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs"],"prefix":"10.1007","volume":"39","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]},{"given":"Mor","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,28]]},"reference":[{"key":"9576_CR1","doi-asserted-by":"crossref","unstructured":"B. Applebaum, Z. Brakerski, R. Tsabary, Degree 2 is complete for the round-complexity of malicious MPC, In EUROCRYPT, Proceedings, Part II (Springer, 2019), pp. 504\u2013531","DOI":"10.1007\/978-3-030-17656-3_18"},{"key":"9576_CR2","doi-asserted-by":"crossref","unstructured":"P. Ananth, A.R. Choudhuri, A. Goel, A. Jain, Round-optimal secure multiparty computation with honest majority, In CRYPTO, Proceedings, Part II (Springer, 2018), pp. 395\u2013424","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"9576_CR3","doi-asserted-by":"crossref","unstructured":"P. Ananth, A.R. Choudhuri, A. Goel, A. Jain, Two round information-theoretic MPC with malicious security, in EUROCRYPT, Proceedings, Part II (Springer, 2019), pp. 532\u2013561","DOI":"10.1007\/978-3-030-17656-3_19"},{"key":"9576_CR4","doi-asserted-by":"crossref","unstructured":"S. Ames, C. Hazay, Y. Ishai, M. Venkitasubramaniam, Ligero: lightweight sublinear arguments without a trusted setup, In CCS (2017), pp. 2087\u20132104","DOI":"10.1145\/3133956.3134104"},{"key":"9576_CR5","doi-asserted-by":"crossref","unstructured":"B. Applebaum, E. Kachlon, A. Patra, The resiliency of MPC with low interaction: the benefit of making errors (extended abstract), In TCC, Proceedings, Part II (Springer, 2020), pp. 562\u2013594","DOI":"10.1007\/978-3-030-64378-2_20"},{"key":"9576_CR6","doi-asserted-by":"crossref","unstructured":"B. Applebaum, E. Kachlon, A. Patra, The round complexity of perfect MPC with active security and optimal resiliency, In FOCS (IEEE, 2020), pp. 1277\u20131284","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"9576_CR7","doi-asserted-by":"crossref","unstructured":"B. Applebaum, E. Kachlon, A. Patra, Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority\u2014(extended abstract), in CRYPTO, Proceedings, Part IV (Springer, 2022), pp. 33\u201356","DOI":"10.1007\/978-3-031-15985-5_2"},{"key":"9576_CR8","unstructured":"B. Applebaum, Private communication (2022)"},{"key":"9576_CR9","doi-asserted-by":"crossref","unstructured":"D. Boneh, E. Boyle, H. Corrigan-Gibbs, N. Gilboa, Y. Ishai, How to prove a secret: zero-knowledge proofs on distributed data via fully linear PCPs. Cryptol. ePrint Arch., Report 2019\/188 (2019). https:\/\/eprint.iacr.org\/2019\/188","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"9576_CR10","doi-asserted-by":"crossref","unstructured":"D. Boneh, E. Boyle, H. Corrigan-Gibbs, N. Gilboa, Y. Ishai, Zero-knowledge proofs on secret-shared data via fully linear PCPs, In CRYPTO (2019), pp. 67\u201397","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"9576_CR11","unstructured":"E. Ben-Sasson, I. Bentov, Y. Horesh, M. Riabzev, Fast Reed\u2013Solomon interactive oracle proofs of proximity, In ICALP (2018), pp. 14:1\u201314:17"},{"key":"9576_CR12","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, D. Carmon, Y. Ishai, S. Kopparty, S. Saraf, Proximity gaps for Reed\u2013Solomon codes, In FOCS (2020), pp. 900\u2013909","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"9576_CR13","doi-asserted-by":"crossref","unstructured":"M. Burmester, Y. Desmedt, Broadcast interactive proofs (extended abstract), in EUROCRYPT (Springer, 1991), pp. 81\u201395","DOI":"10.1007\/3-540-46416-6_7"},{"key":"9576_CR14","doi-asserted-by":"crossref","unstructured":"R. Bhadauria, Z. Fang, C. Hazay, M. Venkitasubramaniam, T. Xie, Y. Zhang, Ligero++: a new optimized sublinear IOP, In CCS (2020), pp. 2025\u20132038","DOI":"10.1145\/3372297.3417893"},{"key":"9576_CR15","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, Function secret sharing: improvements and extensions, In CCS (ACM, 2016), pp. 1292\u20131303","DOI":"10.1145\/2976749.2978429"},{"key":"9576_CR16","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, A. Nof, Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs, In CCS (ACM, 2019), pp. 869\u2013886","DOI":"10.1145\/3319535.3363227"},{"key":"9576_CR17","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, A. Nof, Efficient fully secure computation via distributed zero-knowledge proofs, In ASIACRYPT (2020), pp. 244\u2013276","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"9576_CR18","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, A. Nof, Sublinear GMW-style compiler for MPC with preprocessing, In CRYPTO (2021), pp. 457\u2013485","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"9576_CR19","doi-asserted-by":"crossref","unstructured":"M. Bellare, J.A. Garay, T. Rabin, Fast batch verification for modular exponentiation and digital signatures, In EUROCRYPT (Springer, 1998), pp. 236\u2013250","DOI":"10.1007\/BFb0054130"},{"key":"9576_CR20","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), In STOC (ACM, 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9576_CR21","doi-asserted-by":"crossref","unstructured":"C. Baum, R. Jadoul, E. Orsini, P. Scholl, N.P. Smart, Feta: efficient threshold designated-verifier zero-knowledge proofs, In CCS (ACM, 2022), pp. 293\u2013306","DOI":"10.1145\/3548606.3559354"},{"key":"9576_CR22","unstructured":"N.-P. Brandt, S. Maier, T. M\u00fcller, J. M\u00fcller-Quade, Constructing secure multi-party computation with identifiable abort. IACR Cryptol. ePrint Arch., p. 153 (2020)"},{"key":"9576_CR23","doi-asserted-by":"crossref","unstructured":"C. Baum, E. Orsini, P. Scholl, Efficient secure multiparty computation with identifiable abort, In TCC (2016), pp. 461\u2013490","DOI":"10.1007\/978-3-662-53641-4_18"},{"key":"9576_CR24","doi-asserted-by":"crossref","unstructured":"C. Baum, E. Orsini, P. Scholl, E. Soria-Vazquez, Efficient constant-round MPC with identifiable abort and public verifiability, In CRYPTO (2020), pp. 562\u2013592","DOI":"10.1007\/978-3-030-56880-1_20"},{"key":"9576_CR25","unstructured":"N. Brandt, Tight setup bounds for identifiable abort. IACR Cryptol. ePrint Arch., p. 684 (2021)"},{"key":"9576_CR26","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, A. Chiesa, A. Gabizon, M. Virza, Quasi-linear size zero knowledge from linear-algebraic PCPs. Cryptol. ePrint Arch., Paper 2016\/021 (2016)","DOI":"10.1007\/978-3-662-49099-0_2"},{"key":"9576_CR27","unstructured":"H. Corrigan-Gibbs, D. Boneh, Prio: private, robust, and scalable computation of aggregate statistics, In USENIX (2017), pp. 259\u2013282"},{"key":"9576_CR28","doi-asserted-by":"crossref","unstructured":"H. Corrigan-Gibbs, D. Boneh, D. Mazi\u00e8res, Riposte: an anonymous messaging system handling millions of users, In SP (2015), pp. 321\u2013338","DOI":"10.1109\/SP.2015.27"},{"key":"9576_CR29","doi-asserted-by":"crossref","unstructured":"H. Chen, R. Cramer, Algebraic geometric secret sharing schemes and secure multi-party computations over small fields, In CRYPTO (2006), pp. 521\u2013536","DOI":"10.1007\/11818175_31"},{"key":"9576_CR30","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), In STOC (ACM, 1988), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9576_CR31","unstructured":"Anirudh C, A. Choudhury, A. Patra, A survey on perfectly-secure verifiable secret-sharing. IACR Cryptol. ePrint Arch., p. 445 (2021)"},{"key":"9576_CR32","doi-asserted-by":"crossref","unstructured":"M. Chase, D. Derler, S. Goldfeder, C. Orlandi, S. Ramacher, C. Rechberger, D. Slamanig, G. Zaverucha, Post-quantum zero-knowledge and signatures from symmetric-key primitives, In CCS (2017), pp. 1825\u20131842","DOI":"10.1145\/3133956.3133997"},{"key":"9576_CR33","doi-asserted-by":"crossref","unstructured":"R.K. Cunningham, B. Fuller, S. Yakoubov, Catching MPC cheaters: identification and openability, In ICITS (2017), pp. 110\u2013134","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"9576_CR34","doi-asserted-by":"crossref","unstructured":"R. Cohen, Y. Lindell, Fairness versus guaranteed output delivery in secure multiparty computation, In ASIACRYPT (2014), pp. 466\u2013485","DOI":"10.1007\/978-3-662-45608-8_25"},{"key":"9576_CR35","doi-asserted-by":"crossref","unstructured":"R. Cleve, Limits on the security of coin flips when half the processors are faulty (extended abstract), In STOC (1986)","DOI":"10.1145\/12130.12168"},{"key":"9576_CR36","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Y. Ishai, Scalable secure multiparty computation, In CRYPTO (2006), pp. 501\u2013520","DOI":"10.1007\/11818175_30"},{"key":"9576_CR37","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Y. Ishai, M. Kr\u00f8igaard, Perfectly secure multiparty computation and the computational overhead of cryptography, In EUROCRYPT (2010), pp. 445\u2013465","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"9576_CR38","doi-asserted-by":"crossref","unstructured":"Y. Dodis, S. Micali, Parallel reducibility for information-theoretically secure computation, In CRYPTO, Proceedings (Springer, 2000), pp. 74\u201392","DOI":"10.1007\/3-540-44598-6_5"},{"key":"9576_CR39","doi-asserted-by":"crossref","unstructured":"R. Gennaro, Y. Ishai, E. Kushilevitz, T. Rabin, The round complexity of verifiable secret sharing and secure multicast, In STOC, Proceedings (ACM, 2001), pp. 580\u2013589","DOI":"10.1145\/380752.380853"},{"key":"9576_CR40","doi-asserted-by":"crossref","unstructured":"R. Gennaro, Y. Ishai, E. Kushilevitz, T. Rabin, On 2-round secure multiparty computation, In CRYPTO (Springer, 2002), pp. 178\u2013193","DOI":"10.1007\/3-540-45708-9_12"},{"key":"9576_CR41","unstructured":"I. Giacomelli, J. Madsen, C. Orlandi, ZKBoo: faster zero-knowledge for Boolean circuits, In USENIX (2016), pp. 1069\u20131083"},{"key":"9576_CR42","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract), In STOC (ACM, 1985), pp. 291\u2013304","DOI":"10.1145\/22145.22178"},{"key":"9576_CR43","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, In STOC (ACM, 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9576_CR44","doi-asserted-by":"crossref","unstructured":"J. Groth, R. Ostrovsky, Cryptography in the multi-string model, In CRYPTO (Springer, 2007), pp. 323\u2013341","DOI":"10.1007\/978-3-540-74143-5_18"},{"key":"9576_CR45","doi-asserted-by":"crossref","unstructured":"Y. Gvili, S. Scheffler, M. Varia, BooLigero: improved sublinear zero knowledge proofs for boolean circuits, In FC (2021), pp. 476\u2013496","DOI":"10.1007\/978-3-662-64322-8_23"},{"key":"9576_CR46","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, Perfect constant-round secure computation via perfect randomizing polynomials, In ICALP (Springer, 2002), pp. 244\u2013256","DOI":"10.1007\/3-540-45465-9_22"},{"key":"9576_CR47","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, In STOC, Proceedings (2007), pp. 21\u201330","DOI":"10.1145\/1250790.1250794"},{"issue":"3","key":"9576_CR48","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"key":"9576_CR49","doi-asserted-by":"crossref","unstructured":"Y. Ishai, R. Ostrovsky, V. Zikas, Secure multi-party computation with identifiable abort, In CRYPTO (Springer, 2014), pp. 369\u2013386","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"9576_CR50","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Weiss, Probabilistically checkable proofs of proximity with zero-knowledge, In TCC (2014), pp. 121\u2013145","DOI":"10.1007\/978-3-642-54242-8_6"},{"issue":"8","key":"9576_CR51","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ic.2009.03.007","volume":"207","author":"J Katz","year":"2009","unstructured":"J. Katz, C.-Y. Koo, R. Kumaresan, Improving the round complexity of VSS in point-to-point networks. Inf. Comput. 207(8), 889\u2013899 (2009)","journal-title":"Inf. Comput."},{"key":"9576_CR52","doi-asserted-by":"crossref","unstructured":"J. Katz, V. Kolesnikov, X. Wang, Improved non-interactive zero knowledge with applications to post-quantum signatures, In CCS (2018), pp. 525\u2013537","DOI":"10.1145\/3243734.3243805"},{"key":"9576_CR53","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, Y. Lindell, T. Rabin, Information-theoretically secure protocols and security under composition, In STOC (2006), pp. 109\u2013118","DOI":"10.1145\/1132516.1132532"},{"key":"9576_CR54","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank, G. Tardos, Probabilistically checkable proofs with zero knowledge, In STOC (ACM, 1997), pp. 496\u2013505","DOI":"10.1145\/258533.258643"},{"key":"9576_CR55","doi-asserted-by":"crossref","unstructured":"S. Micali, P. Rogaway, Secure computation (abstract), In CRYPTO, Proceedings (Springer, 1991), pp. 392\u2013404","DOI":"10.1007\/3-540-46766-1_32"},{"key":"9576_CR56","doi-asserted-by":"crossref","unstructured":"G. Spini, S. Fehr, Cheater detection in SPDZ multiparty computation, In ICITS (2016), pp. 151\u2013176","DOI":"10.1007\/978-3-319-49175-2_8"},{"key":"9576_CR57","doi-asserted-by":"crossref","unstructured":"M. Simkin, L. Siniscalchi, S. Yakoubov, On sufficient oracles for secure computation with identifiable abort, In SCN (Springer, 2022), pp. 494\u2013515","DOI":"10.1007\/978-3-031-14791-3_22"},{"key":"9576_CR58","doi-asserted-by":"crossref","unstructured":"K. Yang, X. Wang, Non-interactive zero-knowledge proofs to multiple verifiers, In ASIACRYPT, Proceedings, Part III (2022), pp. 517\u2013546","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-026-09576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-026-09576-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-026-09576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:25:48Z","timestamp":1772238348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-026-09576-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,28]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["9576"],"URL":"https:\/\/doi.org\/10.1007\/s00145-026-09576-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,28]]},"assertion":[{"value":"20 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}