{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:15Z","timestamp":1775794815975,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T00:00:00Z","timestamp":1750118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T00:00:00Z","timestamp":1750118400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00145-025-09543-8","type":"journal-article","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:44:56Z","timestamp":1750178696000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Threshold Computation in the Head: Improved Framework for Post-Quantum Signatures and Zero-Knowledge Arguments"],"prefix":"10.1007","volume":"38","author":[{"given":"Thibauld","family":"Feneuil","sequence":"first","affiliation":[]},{"given":"Matthieu","family":"Rivain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,17]]},"reference":[{"key":"9543_CR1","unstructured":"N. Aaraj, S. Bettaieb, L. Bidoux, A. Budroni, V. Dyseryn, A. Esser, P. Gaborit, M. Kulkarni, V. Mateu, M. Palumbi, L. Perin, J.-P. Tillich, PERK (2023). https:\/\/pqc-perk.org\/assets\/downloads\/PERK_specifications.pdf"},{"key":"9543_CR2","unstructured":"G. Adj, S. Barbero, E. Bellini, A. Esser, L. Rivera-Zamarripa, C. Sanna, J. Verbel, F. Zweydinger, MiRitH (MinRank in the Head). 29st May 2023 (2023). https:\/\/pqc-mirith.org\/assets\/downloads\/mirith_specifications_v1.0.0.pdf"},{"key":"9543_CR3","doi-asserted-by":"crossref","unstructured":"G. Adj, L. Rivera-Zamarripa, J.A. Verbel, MinRank in the head\u2014short signatures from zero-knowledge proofs, in Nadia El Mrabet, Luca De Feo, and Sylvain Duquesne, editors, AFRICACRYPT 23. LNCS, vol. 14064 (Springer, 2023), pp. 3\u201327","DOI":"10.1007\/978-3-031-37679-5_1"},{"key":"9543_CR4","unstructured":"C. Aguilar Melchor, T. Feneuil, N. Gama, S. Gueron, J. Howe, D. Joseph, A. Joux, E. Persichetti, T.H. Randrianarisoa, M. Rivain, D. Yue, The syndrome decoding in the head (SD-in-the-head) signature scheme\u2014algorithm specifications and supporting documentation. Version 1.0\u201431st May 2023 (2023). https:\/\/sdith.org\/docs\/sdith-v1.0.pdf"},{"key":"9543_CR5","doi-asserted-by":"crossref","unstructured":"C. Aguilar-Melchor, N. Gama, J. Howe, A. H\u00fclsing, D. Joseph, D. Yue, The return of the SDitH, in C. Hazay and M. Stam, editors, EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008 (Springer, Heidelberg, 2023), pp. 564\u2013596","DOI":"10.1007\/978-3-031-30589-4_20"},{"issue":"3","key":"9543_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"M.R. Albrecht, R. Player, S. Scott, On the concrete hardness of learning with errors. J. Math. Cryptol.9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"9543_CR7","unstructured":"E. Alkim, J.W. Bos, L. Ducas, K. Easterbrook, B. LaMacchia, P. Longa, I. Mironov, M. Naehrig, V. Nikolaenko, C. Peikert, A. Raghunathan, D. Stebila, Frodokem: learning with errors key encapsulation. March 14, 2023 (2023). https:\/\/frodokem.org\/files\/FrodoKEM-standard_proposal-20230314.pdf"},{"key":"9543_CR8","doi-asserted-by":"crossref","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, and D. Xu, editors, ACM CCS 2017 (ACM Press, 2017), pp. 2087\u20132104","DOI":"10.1145\/3133956.3134104"},{"issue":"11","key":"9543_CR9","first-page":"3379","volume":"91","author":"S Ames","year":"2023","unstructured":"S. Ames, C. Hazay, Y. Ishai, M. Venkitasubramaniam, Ligero: lightweight sublinear arguments without a trusted setup. DCC91(11), 3379\u20133424 (2023)","journal-title":"DCC"},{"key":"9543_CR10","unstructured":"N. Aragon, M. Bardet, L. Bidoux, J.-J. Chi-Dom\u00ednguez, V. Dyseryn, T. Feneuil, P. Gaborit, A. Joux, M. Rivain, J.-P. Tillich, A. Vin\u00e7otte, RYDE specifications (2023). https:\/\/pqc-ryde.org\/assets\/downloads\/ryde_spec.pdf"},{"key":"9543_CR11","unstructured":"N. Aragon, M. Bardet, L. Bidoux, J.-J. Chi-Dom\u00ednguez, V. Dyseryn, T. Feneuil, P. Gaborit, R. Neveu, M. Rivain, J.-P. Tillich, MIRA specifications (2023). https:\/\/pqc-mira.org\/assets\/downloads\/mira_spec.pdf"},{"key":"9543_CR12","unstructured":"N. Aragon, L. Bidoux, J.-J. Chi-Dom\u00ednguez, T. Feneuil, P. Gaborit, R. Neveu, M. Rivain, Mira: a digital signature scheme based on the minrank problem and the mpc-in-the-head paradigm (2023)"},{"key":"9543_CR13","unstructured":"R. Avanzi, J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J.M. Schanck, P. Schwabe, G. Seiler, D. Stehl\u00e9, Crypstals-kyber\u2014algorithm specifications and supporting documentation. Version 3.02\u2014August 4, 2021 (2021). https:\/\/pq-crystals.org\/kyber\/data\/kyber-specification-round3-20210804.pdf"},{"key":"9543_CR14","unstructured":"S. Bai, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, D. Stehl\u00e9, Crypstals-dilithium\u2014algorithm specifications and supporting documentation. Version 3.1\u2014February 8, 2021 (2021). https:\/\/pq-crystals.org\/dilithium\/data\/dilithium-specification-round3-20210208.pdf"},{"key":"9543_CR15","doi-asserted-by":"crossref","unstructured":"A. Barenghi, J.-F. Biasse, T. Ngo, E. Persichetti, P. Santini, Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory7(2), 112\u2013128 (2022)","DOI":"10.1080\/23799927.2022.2048206"},{"key":"9543_CR16","doi-asserted-by":"crossref","unstructured":"C. Baum, L. Braun, C.D. de\u00a0Saint\u00a0Guilhem, M. Kloo\u00df, E. Orsini, L. Roy, P. Scholl, Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head, in H. Handschuh and A. Lysyanskaya, editors, Advances in Cryptology\u2014CRYPTO 2023 (Springer, Cham, 2023), pp. 581\u2013615","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"9543_CR17","unstructured":"C. Baum, L. Braun, C.D. de Saint Guilhem, M. Kloo\u00df, C. Majenz, S. Mukherjee, E. Orsini, S. Ramacher, C. Rechberger, L. Roy, P. Scholl, FAEST: algorithm specifications\u2014Version 1.1 (2023). https:\/\/faest.info\/faest-spec-v1.1.pdf"},{"key":"9543_CR18","doi-asserted-by":"crossref","unstructured":"C. Baum, C.D. de Saint Guilhem, D. Kales, E. Orsini, P. Scholl, G. Zaverucha, Banquet: short and fast signatures from AES, in J. Garay, editor, PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710 (Springer, Heidelberg, 2021), pp. 266\u2013297","DOI":"10.1007\/978-3-030-75245-3_11"},{"key":"9543_CR19","doi-asserted-by":"crossref","unstructured":"C. Baum, A. Nof, Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography, in A. Kiayias, M. Kohlweiss, P. Wallden, and V. Zikas, editors, PKC\u00a02020, Part\u00a0I. LNCS, vol. 12110 (Springer, Heidelberg, 2020), pp. 495\u2013526","DOI":"10.1007\/978-3-030-45374-9_17"},{"key":"9543_CR20","doi-asserted-by":"crossref","unstructured":"E. Bellini, A. Esser, C. Sanna, J. Verbel. Mr-dss\u2014smaller minrank-based (ring-)signatures, in J.H. Cheon and T. Johansson, editors, Post-Quantum Cryptography (Springer, Cham, 2022), pp. 144\u2013169","DOI":"10.1007\/978-3-031-17234-2_8"},{"key":"9543_CR21","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, D. Carmon, Y. Ishai, S. Kopparty, S. Saraf, Proximity gaps for Reed\u2013Solomon codes, in 61st FOCS (IEEE Computer Society Press, 2020), pp. 900\u2013909","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"9543_CR22","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, A. Chiesa, M. Riabzev, N. Spooner, M. Virza, N.P. Ward, Aurora: transparent succinct arguments for R1CS, in Y. Ishai and V. Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0I. LNCS, vol. 11476 (Springer, Heidelberg, 2019), pp. 103\u2013128","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"9543_CR23","unstructured":"L. Bettale, D. Kahrobaei, L. Perret, J. Verbel, Biscuit: shorter MPC-based signature from PoSSo (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/Biscuit-spec-web.pdf"},{"key":"9543_CR24","doi-asserted-by":"crossref","unstructured":"W. Beullens, Sigma protocols for MQ, PKP and SIS, and Fishy signature schemes, in A. Canteaut and Y. Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107 (Springer, Heidelberg, 2020), pp. 183\u2013211","DOI":"10.1007\/978-3-030-45727-3_7"},{"key":"9543_CR25","doi-asserted-by":"crossref","unstructured":"W. Beullens, C.D. de Saint Guilhem, LegRoast: efficient post-quantum signatures from the Legendre PRF, in J. Ding and J.-P. Tillich, editors, Post-Quantum Cryptography\u201411th International Conference, PQCrypto 2020 (Springer, Heidelberg, 2020), pp. 130\u2013150","DOI":"10.1007\/978-3-030-44223-1_8"},{"key":"9543_CR26","doi-asserted-by":"crossref","unstructured":"W. Beullens, S. Katsumata, F. Pintore, Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices, in S. Moriai and H. Wang, editors, ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492 (Springer, Heidelberg, 2020), pp. 464\u2013492","DOI":"10.1007\/978-3-030-64834-3_16"},{"key":"9543_CR27","unstructured":"L. Bidoux, J.-J. Chi-Dom\u00ednguez, T. Feneuil, P. Gaborit, A. Joux, M. Rivain, A. Vin\u00e7otte, Ryde: a digital signature scheme based on rank-syndrome-decoding problem with mpcith paradigm (2023)"},{"key":"9543_CR28","doi-asserted-by":"crossref","unstructured":"N. Bitansky, R. Canetti, A. Chiesa, E. Tromer, From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again, in S. Goldwasser, editor, ITCS 2012 (ACM, 2012), pp. 326\u2013349","DOI":"10.1145\/2090236.2090263"},{"key":"9543_CR29","doi-asserted-by":"crossref","unstructured":"J. Bootle, V. Lyubashevsky, G. Seiler, Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs, in A. Boldyreva and D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0I. LNCS, vol. 11692 (Springer, Heidelberg, 2019), pp. 176\u2013202","DOI":"10.1007\/978-3-030-26948-7_7"},{"key":"9543_CR30","doi-asserted-by":"crossref","unstructured":"L. Braun, C.D. de\u00a0Saint\u00a0Guilhem, R. Jadoul, E. Orsini, N.P. Smart, T. Tanguy, Zk-for-z2k: Mpc-in-the-head zero-knowledge proofs for $${\\mathbb{Z}}_{2^{k}}$$, in E.A. Quaglia, editor, Cryptography and Coding (Springer, Cham, 2024), pp. 137\u2013157","DOI":"10.1007\/978-3-031-47818-5_8"},{"key":"9543_CR31","unstructured":"J. Cho, M. Cho, J. Ha, S. Kim, J. Kwon, B. Lee, J. Lee, J. Lee, S. Lee, D. Moon, M. Son, H. Yoon, The AIMer signature scheme\u2014submission to the NIST PQC project. Version 1.0\u20141st June 2023 (2023). https:\/\/aimer-signature.org\/docs\/AIMer-NIST-Document.pdf"},{"key":"9543_CR32","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, Y. Ishai, Share conversion, pseudorandom secret-sharing and applications to secure computation, in J. Kilian, editor, TCC\u00a02005. LNCS, vol. 3378 (Springer, Heidelberg, 2005), pp. 342\u2013362","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"9543_CR33","doi-asserted-by":"crossref","unstructured":"C.D. de Saint Guilhem, E. Orsini, T. Tanguy, Limbo: efficient zero-knowledge MPCitH-based arguments, in G. Vigna and E. Shi, editors, ACM CCS 2021 (ACM Press, 2021), pp. 3022\u20133036","DOI":"10.1145\/3460120.3484595"},{"key":"9543_CR34","doi-asserted-by":"crossref","unstructured":"M.F. Esgin, N.K. Nguyen, G. Seiler, Practical exact proofs from lattices: new techniques to exploit fully-splitting rings, in S. Moriai and H. Wang, editors, ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492 (Springer, Heidelberg, 2020), pp. 259\u2013288","DOI":"10.1007\/978-3-030-64834-3_9"},{"key":"9543_CR35","doi-asserted-by":"crossref","unstructured":"M.F. Esgin, R.K. Zhao, R. Steinfeld, J.K. Liu, D. Liu, MatRiCT: efficient, scalable and post-quantum blockchain confidential transactions protocol, in L. Cavallaro, J. Kinder, X. Wang, and J. Katz, editors, ACM CCS 2019 (ACM Press, 2019), pp. 567\u2013584","DOI":"10.1145\/3319535.3354200"},{"key":"9543_CR36","doi-asserted-by":"crossref","unstructured":"T. Feneuil, A. Joux, M. Rivain, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, in Y. Dodis and T. Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508 (Springer, Heidelberg, 2022), pp. 541\u2013572","DOI":"10.1007\/978-3-031-15979-4_19"},{"issue":"2","key":"9543_CR37","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10623-022-01116-1","volume":"91","author":"T Feneuil","year":"2023","unstructured":"T. Feneuil, A. Joux, M. Rivain, Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Des. Codes Cryptogr.91(2), 563\u2013608 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"9543_CR38","doi-asserted-by":"crossref","unstructured":"T. Feneuil, J. Maire, M. Rivain, D. Vergnaud, Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection, in S. Agrawal and D. Lin, editors, ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792 (Springer, Heidelberg, 2022), pp. 371\u2013402","DOI":"10.1007\/978-3-031-22966-4_13"},{"key":"9543_CR39","unstructured":"T. Feneuil, M. Rivain, Threshold linear secret sharing to the rescue of MPC-in-the-head. Cryptology ePrint Archive, Report 2022\/1407 (2022). https:\/\/eprint.iacr.org\/2022\/1407"},{"key":"9543_CR40","unstructured":"T. Feneuil, M. Rivain, MQOM: MQ on my Mind\u2014algorithm specifications and supporting documentation. Version 1.0\u201431st May 2023 (2023). https:\/\/mqom.org\/docs\/mqom-v1.0.pdf"},{"key":"9543_CR41","doi-asserted-by":"crossref","unstructured":"T. Feneuil, M. Rivain, Threshold linear secret sharing to the rescue of MPC-in-the-head, in J. Guo and R. Steinfeld, editors, Advances in Cryptology\u2014ASIACRYPT 2023\u201429th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14438 (Springer, 2023), pp. 441\u2013473","DOI":"10.1007\/978-981-99-8721-4_14"},{"key":"9543_CR42","doi-asserted-by":"crossref","unstructured":"M.K. Franklin, M. Yung, Communication complexity of secure computation (extended abstract), in 24th ACM STOC (ACM Press, 1992), pp. 699\u2013710","DOI":"10.1145\/129712.129780"},{"key":"9543_CR43","first-page":"304","volume":"2022","author":"A Goel","year":"2022","unstructured":"A. Goel, M. Green, M. Hall-Andersen, G. Kaptchuk, Efficient set membership proofs using mpc-in-the-head. Proc. Priv. Enhanc. Technol.2022, 304\u2013324 (2022)","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"9543_CR44","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions (extended abstract), in 25th FOCS (IEEE Computer Society Press, 1984), pp. 464\u2013479","DOI":"10.1109\/SFCS.1984.715949"},{"key":"9543_CR45","doi-asserted-by":"crossref","unstructured":"J. Groth, On the size of pairing-based non-interactive arguments, in M. Fischlin and J.-S. Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol. 9666 (Springer, Heidelberg, 2016), pp. 305\u2013326","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"9543_CR46","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in D.S. Johnson and U. Feige, editors, 39th ACM STOC (ACM Press, 2007), pp. 21\u201330","DOI":"10.1145\/1250790.1250794"},{"key":"9543_CR47","doi-asserted-by":"crossref","unstructured":"M. Ito, A. Saito, T. Nishizeki, Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. (Part III Fundam. Electron. Sci.)72(9), 56\u201364 (1989)","DOI":"10.1002\/ecjc.4430720906"},{"key":"9543_CR48","doi-asserted-by":"crossref","unstructured":"D. Kales, G. Zaverucha, An attack on some signature schemes constructed from five-pass identification schemes, in S. Krenn, H. Shulman, and S. Vaudenay, editors, CANS 20. LNCS, vol. 12579(Springer, Heidelberg, 2020), pp. 3\u201322","DOI":"10.1007\/978-3-030-65411-5_1"},{"key":"9543_CR49","doi-asserted-by":"crossref","unstructured":"D. Kales, G. Zaverucha, Improving the performance of the Picnic signature scheme. IACR TCHES2020(4), 154\u2013188 (2020). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8680","DOI":"10.46586\/tches.v2020.i4.154-188"},{"key":"9543_CR50","doi-asserted-by":"crossref","unstructured":"J. Katz, V. Kolesnikov, X. Wang, Improved non-interactive zero knowledge with applications to post-quantum signatures, in D. Lie, M. Mannan, M. Backes, and X. Wang, editors, ACM CCS 2018 (ACM Press, 2018), pp. 525\u2013537","DOI":"10.1145\/3243734.3243805"},{"key":"9543_CR51","unstructured":"S. Kim, J. Ha, M. Son, B. Lee, D. Moon, J. Lee, S. Lee, J. Kwon, J. Cho, H. Yoon, J. Lee, AIM: symmetric primitive for shorter signatures with stronger security. Cryptology ePrint Archive, Report 2022\/1387 (2022). https:\/\/eprint.iacr.org\/2022\/1387"},{"key":"9543_CR52","doi-asserted-by":"crossref","unstructured":"S. Ling, K. Nguyen, D. Stehl\u00e9, H. Wang, Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications, in K. Kurosawa and G. Hanaoka, editors, PKC\u00a02013. LNCS, vol. 7778 (Springer, Heidelberg, 2013), pp. 107\u2013124","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"9543_CR53","doi-asserted-by":"crossref","unstructured":"X. Lu, M.H. Au, Z. Zhang, Raptor: a practical lattice-based (linkable) ring signature, in R.H. Deng, V. Gauthier-Uma\u00f1a, M. Ochoa, and M. Yung, editors, ACNS 19. LNCS, vol. 11464 (Springer, Heidelberg, 2019), pp. 110\u2013130","DOI":"10.1007\/978-3-030-21568-2_6"},{"key":"9543_CR54","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, N.K. Nguyen, M. Plan\u00e7on, Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general, in Y. Dodis and T. Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508 (Springer, Heidelberg, 2022), pp. 71\u2013101","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"9543_CR55","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, N.K. Nguyen, G. Seiler, Shorter lattice-based zero-knowledge proofs via one-time commitments, in J. Garay, editor, PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710 (Springer, Heidelberg, 2021), pp. 215\u2013241","DOI":"10.1007\/978-3-030-75245-3_9"},{"key":"9543_CR56","unstructured":"NIST. Call for additional digital signature schemes for the post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf"},{"issue":"11","key":"9543_CR57","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. Assoc. Comput. Mach.22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"9543_CR58","unstructured":"W. Wang, Shorter signatures from MQ. Cryptology ePrint Archive, Report 2022\/344 (2022). https:\/\/eprint.iacr.org\/2022\/344"},{"key":"9543_CR59","doi-asserted-by":"crossref","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 and E. Shi, editors, ACM CCS 2021 (ACM Press, 2021), pp. 2986\u20133001","DOI":"10.1145\/3460120.3484556"},{"key":"9543_CR60","unstructured":"G. Zaverucha, M. Chase, D. Derler, S. Goldfeder, C. Orlandi, S. Ramacher, C. Rechberger, D. Slamanig, Picnic. Technical report, National Institute of Standards and Technology (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-025-09543-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-025-09543-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-025-09543-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T21:12:20Z","timestamp":1757193140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-025-09543-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["9543"],"URL":"https:\/\/doi.org\/10.1007\/s00145-025-09543-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]},"assertion":[{"value":"2 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"28"}}