{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:38:46Z","timestamp":1784831926977,"version":"3.55.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031577208","type":"print"},{"value":"9783031577185","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-57718-5_8","type":"book-chapter","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T22:01:17Z","timestamp":1712959277000},"page":"229-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["$$\\textsf{ReSolveD} $$: Shorter Signatures from\u00a0Regular Syndrome Decoding and\u00a0VOLE-in-the-Head"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6203-413X","authenticated-orcid":false,"given":"Hongrui","family":"Cui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3843-1394","authenticated-orcid":false,"given":"Hanlin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3372-1256","authenticated-orcid":false,"given":"Di","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2294-3523","authenticated-orcid":false,"given":"Kaiyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Aguilar Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. LNCS, vol. 14008, pp. 564\u2013596. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_20","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Alaoui, S.M.E.Y., Cayrel, P., Bansarkhani, R.E., Hoffmann, G.: Code-based identification and signature schemes in software. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E.R., Xu, L. (eds.) Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, Regensburg, Germany, 2\u20136 September 2013, Proceedings. LNCS, vol.\u00a08128, pp. 122\u2013136. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40588-4_9","DOI":"10.1007\/978-3-642-40588-4_9"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Aragon, N., Blazy, O., Gaborit, P., Hauteville, A., Z\u00e9mor, G.: Durandal: a rank metric based signature scheme. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478, pp. 728\u2013758. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_25","DOI":"10.1007\/978-3-030-17659-4_25"},{"key":"8_CR4","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. Cryptology ePrint Archive, Report 2003\/230 (2003). https:\/\/eprint.iacr.org\/2003\/230"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Barenghi, A., Biasse, J.F., Persichetti, E., Santini, P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: Cheon, J.H., Tillich, J.P. (eds.) Post-Quantum Cryptography - 12th International Workshop, PQCrypto 2021. LNCS, vol. 12841, pp. 23\u201343. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_2","DOI":"10.1007\/978-3-030-81293-5_2"},{"issue":"3","key":"8_CR6","first-page":"209","volume":"30","author":"S Barg","year":"1994","unstructured":"Barg, S.: Some new NP-complete coding problems. Probl. Inf. Transm. 30(3), 209\u2013214 (1994)","journal-title":"Probl. Inf. Transm."},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Razet, B., Scholl, P.: Appenzeller to Brie: efficient zero-knowledge proofs for mixed-mode arithmetic and Z2k. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 192\u2013211. ACM Press, November 2021. https:\/\/doi.org\/10.1145\/3460120.3484812","DOI":"10.1145\/3460120.3484812"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz$$\\mathbb{Z}_{2^k}$$arella: efficient vector-OLE and zero-knowledge proofs over $$\\mathbb{Z}_{2^k}$$. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, pp. 329\u2013358. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"8_CR9","unstructured":"Baum, C., et al.: FAEST: algorithm specifications. Technical report, National Institute of Standards and Technology (2023). https:\/\/faest.info\/faest-spec-v1.1.pdf"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-Head. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 581\u2013615. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: Mac\u2019n\u2019Cheese: zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0IV. LNCS, vol. 12828, pp. 92\u2013122. Springer, Heidelberg (2021). Virtual Event, https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Biasse, J.F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A.M. (eds.) AFRICACRYPT 2020. LNCS, vol. 12174, pp. 45\u201365. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3","DOI":"10.1007\/978-3-030-51938-4_3"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10623-022-01114-3","volume":"91","author":"L Bidoux","year":"2023","unstructured":"Bidoux, L., Gaborit, P., Kulkarni, M., Mateu, V.: Code-based signatures from new proofs of knowledge for the syndrome decoding problem. Des. Codes Cryptogr. 91(2), 497\u2013544 (2023). https:\/\/doi.org\/10.1007\/s10623-022-01114-3","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1292\u20131303. ACM Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Briaud, P., \u00d8ygarden, M.: A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. LNCS, vol. 14008, pp. 391\u2013422. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_14","DOI":"10.1007\/978-3-031-30589-4_14"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. LNCS, vol. 14008, pp. 532\u2013563. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_19","DOI":"10.1007\/978-3-031-30589-4_19"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Damg\u00e5rd, I., David, B., D\u00f6ttling, N., Dowsley, R., Giacomelli, I.: Efficient UC commitment extension with homomorphism for free (and applications). In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11922, pp. 606\u2013635. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_22","DOI":"10.1007\/978-3-030-34621-8_22"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Cayrel, P., V\u00e9ron, P., Alaoui, S.M.E.Y.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 171\u2013186. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_12","DOI":"10.1007\/978-3-642-19574-7_12"},{"key":"8_CR21","unstructured":"Chou, T., Persichetti, E., Santini, P.: On linear equivalence, canonical forms, and digital signatures. Cryptology ePrint Archive, Paper 2023\/1533 (2023). https:\/\/eprint.iacr.org\/2023\/1533"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.P.: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0I. LNCS, vol. 11921, pp. 21\u201351. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_2","DOI":"10.1007\/978-3-030-34578-5_2"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Improving line-point zero knowledge: two multiplications for the price of one, pp. 829\u2013841. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3559385","DOI":"10.1145\/3548606.3559385"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: 2nd Conference on Information-Theoretic Cryptography (2021)","DOI":"10.1145\/3548606.3559385"},{"key":"8_CR25","unstructured":"Esser, A., Santini, P.: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks. Cryptology ePrint Archive, Paper 2023\/1568 (2023). https:\/\/eprint.iacr.org\/2023\/1568"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs. In: CRYPTO\u00a02022, Part\u00a0II, pp. 541\u2013572. LNCS, Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_19","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Des. Codes Cryptogr. 91(2), 563\u2013608 (2023). https:\/\/doi.org\/10.1007\/s10623-022-01116-1, First appeared online at https:\/\/eprint.iacr.org\/2021\/1576","DOI":"10.1007\/s10623-022-01116-1"},{"key":"8_CR28","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.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Gaborit, P., Girault, M.: Lightweight code-based identification and signature. In: IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 24\u201329 June 2007, pp. 191\u2013195. IEEE (2007). https:\/\/doi.org\/10.1109\/ISIT.2007.4557225","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Gueron, S., Persichetti, E., Santini, P.: Designing a practical code-based signature scheme from zero-knowledge proofs with trusted setup. Cryptography 6(1), 5 (2022). https:\/\/doi.org\/10.3390\/cryptography6010005","DOI":"10.3390\/cryptography6010005"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Guo, C., Katz, J., Wang, X., Yu, Y.: Efficient and secure multiparty computation from fixed-key block ciphers. In: 2020 IEEE Symposium on Security and Privacy, pp. 825\u2013841. IEEE Computer Society Press, May 2020. https:\/\/doi.org\/10.1109\/SP40000.2020.00016","DOI":"10.1109\/SP40000.2020.00016"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Guo, X., et al.: Half-Tree: halving the cost of tree expansion in COT and DPF. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 330\u2013362. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: TinyKeys: a new approach to efficient multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993, pp. 3\u201333. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_1","DOI":"10.1007\/978-3-319-96878-0_1"},{"key":"8_CR34","unstructured":"H\u00fclsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, June 2007. https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Kales, D., Zaverucha, G.: Improving the performance of the Picnic signature scheme. IACR TCHES 2020(4), 154\u2013188 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i4.154-188, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8680","DOI":"10.13154\/tches.v2020.i4.154-188"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: Actively secure OT extension with optimal overhead. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 724\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_35","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"8_CR38","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. Cryptology ePrint Archive, Report 2022\/712 (2022). https:\/\/eprint.iacr.org\/2022\/712"},{"key":"8_CR39","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"8_CR40","unstructured":"Melchor, C.A., et al.: The Syndrome Decoding in the Head (SD-in-the-Head) signature scheme. Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/SDitH-spec-web.pdf"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"Melchor, C.A., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. In: 2011 IEEE Information Theory Workshop, ITW 2011, Paraty, Brazil, 16\u201320 October 2011, pp. 648\u2013652. IEEE (2011). https:\/\/doi.org\/10.1109\/ITW.2011.6089577","DOI":"10.1109\/ITW.2011.6089577"},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Melchor, C.A., H\u00fclsing, A., Joseph, D., Majenz, C., Ronen, E., Yue, D.: SDitH in the QROM. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part VII. LNCS, vol. 14444, pp. 317\u2013350. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_11","DOI":"10.1007\/978-981-99-8739-9_11"},{"key":"8_CR43","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"8_CR44","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"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively secure 1-out-of-N OT extension with application to private set intersection. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 381\u2013396. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_22","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Patra, A., Sarkar, P., Suresh, A.: Fast actively secure OT extension for short secrets. In: NDSS 2017. The Internet Society, February\/March 2017","DOI":"10.14722\/ndss.2017.23089"},{"key":"8_CR47","doi-asserted-by":"crossref","unstructured":"Persichetti, E., Santini, P.: A new formulation of the linear equivalence problem and shorter less signatures. Cryptology ePrint Archive, Paper 2023\/847 (2023). https:\/\/eprint.iacr.org\/2023\/847","DOI":"10.1007\/978-981-99-8739-9_12"},{"key":"8_CR48","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"8_CR49","doi-asserted-by":"publisher","unstructured":"Roy, L.: SoftSpokenOT: quieter OT extension from small-field silent VOLE in the minicrypt model. In: CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 657\u2013687. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"issue":"4","key":"8_CR50","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980). https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"},{"key":"8_CR51","doi-asserted-by":"publisher","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13\u201321. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_2","DOI":"10.1007\/3-540-48329-2_2"},{"key":"8_CR52","doi-asserted-by":"publisher","unstructured":"V\u00e9ron, P.: Improved identification schemes based on error-correcting codes. Appl. Algebra Eng. Commun. Comput. 8(1), 57\u201369 (1996). https:\/\/doi.org\/10.1007\/s002000050053","DOI":"10.1007\/s002000050053"},{"key":"8_CR53","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, pp. 1074\u20131091. IEEE Computer Society Press, May 2021. https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"8_CR54","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: efficient conversions for zero-knowledge proofs with applications to machine learning. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 501\u2013518. USENIX Association, August 2021"},{"key":"8_CR55","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: AntMan: interactive zero-knowledge proofs with sublinear communication, pp. 2901\u20132914. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560667","DOI":"10.1145\/3548606.3560667"},{"key":"8_CR56","doi-asserted-by":"publisher","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2986\u20133001. ACM Press, November 2021. https:\/\/doi.org\/10.1145\/3460120.3484556","DOI":"10.1145\/3460120.3484556"},{"key":"8_CR57","unstructured":"Zaverucha, G., et al.: Picnic. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"8_CR58","unstructured":"Zhang, K., Cui, H., Yu, Y.: SPHINCS-alpha. Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"8_CR59","doi-asserted-by":"publisher","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation, EUROSAM 1979, An International Symposium on Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57718-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T22:02:01Z","timestamp":1712959321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57718-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577208","9783031577185"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57718-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}