{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:56:52Z","timestamp":1770231412564,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911330","type":"print"},{"value":"9783031911347","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91134-7_15","type":"book-chapter","created":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:30Z","timestamp":1745665470000},"page":"427-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Relaxed Vector Commitment for\u00a0Shorter Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9091-4054","authenticated-orcid":false,"given":"Seongkwang","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2736-6830","authenticated-orcid":false,"given":"Byeonghak","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3651-2425","authenticated-orcid":false,"given":"Mincheol","family":"Son","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. In: EUROCRYPT 2023, pp. 564\u2013596. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"15_CR2","unstructured":"Baum, C., et al.: One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. Cryptology ePrint Archive, Paper 2024\/490 (2024). https:\/\/eprint.iacr.org\/2024\/490"},{"key":"15_CR3","unstructured":"Baum, C., et al.: FAEST. Technical report, National Institute of Standards and Technology, 2023 (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"15_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-031-38554-4_19","volume-title":"CRYPTO 2023","author":"C Baum","year":"2023","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. LNCS, vol. 14085, pp. 581\u2013615. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-030-45374-9_17","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Nof, A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 495\u2013526. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_17"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-75245-3_11","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., de Saint Guilhem, C.D., Kales, D., Orsini, E., Scholl, P., Zaverucha, G.: Banquet: short and fast signatures from AES. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 266\u2013297. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_11"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-45727-3_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"W Beullens","year":"2020","unstructured":"Beullens, W.: Sigma protocols for MQ, PKP and SIS, and fishy signature schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 183\u2013211. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_7"},{"key":"15_CR8","unstructured":"Bui, D., Carozza, E., Couteau, G., Goudarzi, D., Joux, A.: Short Signatures from Regular Syndrome Decoding, Revisited. Cryptology ePrint Archive, Paper 2024\/252 (2024). https:\/\/eprint.iacr.org\/2024\/252"},{"key":"15_CR9","unstructured":"Bui, D., Cong, K., de\u00a0Saint\u00a0Guilhem, C.D.: Improved all-but-one vector commitment with applications to post-quantum signatures. Cryptology ePrint Archive, Paper 2024\/097 (2024). https:\/\/eprint.iacr.org\/2024\/097"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Cui, H., Liu, H., Yan, D., Yang, K., Yu, Y., Zhang, K.: ResolveD: shorter signatures from regular syndrome decoding and vole-in-the-head. In: PKC 2024, pp. 229\u2013258. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-57718-5_8"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., Kales, D., Rechberger, C., Schofnegger, M., Zaverucha, G.: Shorter signatures based on tailor-made minimalist symmetric-key crypto. In: ACM CCS 2022, pp. 843\u2013857. Association of Computing Machinery (2022). https:\/\/www.microsoft.com\/en-us\/research\/publication\/shorter-signatures-based-on-tailor-made-minimalist-symmetric-key-crypto\/","DOI":"10.1145\/3548606.3559353"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-030-56877-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Don","year":"2020","unstructured":"Don, J., Fehr, S., Majenz, C.: The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 602\u2013631. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_21"},{"key":"15_CR13","unstructured":"Feneuil, T.: Building MPCitH-based Signatures from MQ, MinRank, Rank SD and PKP. Cryptology ePrint Archive (2022)"},{"key":"15_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-031-15979-4_19","volume-title":"CRYPTO 2022","author":"T Feneuil","year":"2022","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 541\u2013572. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_19"},{"key":"15_CR15","unstructured":"Feneuil, T., Rivain, M.: Threshold Computation in the Head: Improved Framework for Post-Quantum Signatures and Zero-Knowledge Arguments. Cryptology ePrint Archive, Paper 2023\/1573 (2023). https:\/\/eprint.iacr.org\/2023\/1573"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792-807 (1986). https:\/\/doi.org\/10.1145\/6490.6503","DOI":"10.1145\/6490.6503"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: EUROCRYPT 2023, pp. 330\u2013362. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"15_CR18","unstructured":"Hulsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology, 2022 (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"15_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-031-68376-3_2","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"J Huth","year":"2024","unstructured":"Huth, J., Joux, A.: MPC in the head using the subfield bilinear collision problem. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14920, pp. 39\u201370. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_2"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: ACM STOC 2007, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-65411-5_1","volume-title":"Cryptology and Network Security","author":"D Kales","year":"2020","unstructured":"Kales, D., Zaverucha, G.: An attack on some signature schemes constructed from five-pass identification schemes. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 3\u201322. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_1"},{"key":"15_CR22","unstructured":"Kales, D., Zaverucha, G.: Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures. Cryptology ePrint Archive, Paper 2022\/588 (2022). https:\/\/eprint.iacr.org\/2022\/588"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: ACM CCS 2018, pp. 525\u2013537. ACM (2018)","DOI":"10.1145\/3243734.3243805"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Kim, S., et al.: Aim: symmetric primitive for shorter signatures with stronger security. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, pp. 401\u2013415. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3576915.3616579","DOI":"10.1145\/3576915.3616579"},{"key":"15_CR25","unstructured":"Kim, S., Lee, B., Son, M.: Relaxed vector commitment for shorter signatures. Cryptology ePrint Archive, Paper 2024\/1004 (2024). https:\/\/eprint.iacr.org\/2024\/1004"},{"key":"15_CR26","unstructured":"Lee, J., et al.: The AIMer Signature Scheme (2024). Version 2.0. https:\/\/kpqc.or.kr\/competition_02.html"},{"key":"15_CR27","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology, 2022 (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"15_CR28","unstructured":"Melchor, C.A., et al.: The Syndrome Decoding in the Head (SD-in-the-Head) Signature Scheme (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"de\u00a0Saint\u00a0Guilhem, C.D., Orsini, E., Tanguy, T.: Limbo: efficient zero-knowledge MPCitH-based arguments. In: ACM CCS 2021, pp. 3022\u20133036. Association for Computing Machinery (2021)","DOI":"10.1145\/3460120.3484595"},{"key":"15_CR30","unstructured":"Zaverucha, G., et al.: Picnic. Technical report, National Institute of Standards and Technology, 2020 (2022). https:\/\/csrc.nist.gov\/ projects\/post-quantum-cryptography\/round-3-submissions"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91134-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:41Z","timestamp":1745665481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91134-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911330","9783031911347"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91134-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}