{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:39Z","timestamp":1765113039427,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":83,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609345"},{"type":"electronic","value":"9789819609352"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0935-2_14","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:34Z","timestamp":1733680894000},"page":"436-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Code-Based Zero-Knowledge from\u00a0VOLE-in-the-Head and\u00a0Their Applications: Simpler, Faster, and\u00a0Smaller"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9036-9788","authenticated-orcid":false,"given":"Ying","family":"Ouyang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8373-9200","authenticated-orcid":false,"given":"Deng","family":"Tang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7937-3779","authenticated-orcid":false,"given":"Yanhong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"G.\u00a0Adj, L.\u00a0Rivera-Zamarripa, and J.\u00a0A. Verbel. Minrank in the head - short signatures from zero-knowledge proofs. In AFRICACRYPT 2023, volume 14064 of LNCS, pages 3\u201327. Springer, 2023.","DOI":"10.1007\/978-3-031-37679-5_1"},{"key":"14_CR2","unstructured":"M.\u00a0R. Albrecht, D.\u00a0J. Bernstein, T.\u00a0Chou, C.\u00a0Cid, J.\u00a0Gilcher, T.\u00a0Lange, V.\u00a0Maram, I.\u00a0Von\u00a0Maurich, R.\u00a0Misoczki, R.\u00a0Niederhagen, et\u00a0al. Classic mceliece: conservative code-based cryptography. 2022. https:\/\/classic.mceliece.org\/nist.html."},{"key":"14_CR3","unstructured":"D.\u00a0Augot, M.\u00a0Finiasz, P.\u00a0Gaborit, S.\u00a0Manuel, and N.\u00a0Sendrier. Sha-3 proposal: Fsb. Submission to NIST, pages 81\u201385, 2008. https:\/\/www.rocq.inria.fr\/secret\/CBCrypto\/fsbdoc.pdf."},{"key":"14_CR4","unstructured":"D.\u00a0Augot, M.\u00a0Finiasz, and N.\u00a0Sendrier. A fast provably secure cryptographic hash function. IACR Cryptol. ePrint Arch., page 230, 2003."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"D.\u00a0Augot, M.\u00a0Finiasz, and N.\u00a0Sendrier. A family of fast syndrome based cryptographic hash functions. In Mycrypt 2005, volume 3715 of LNCS, pages 64\u201383. Springer, 2005.","DOI":"10.1007\/11554868_6"},{"key":"14_CR6","unstructured":"C.\u00a0Baum, W.\u00a0Beullens, S.\u00a0Mukherjee, E.\u00a0Orsini, S.\u00a0Ramacher, C.\u00a0Rechberger, L.\u00a0Roy, and P.\u00a0Scholl. One tree to rule them all: Optimizing GGM trees and owfs for post-quantum signatures. IACR Cryptol. ePrint Arch., page 490, 2024."},{"key":"14_CR7","unstructured":"C.\u00a0Baum, L.\u00a0Braun, C.\u00a0D. de\u00a0Saint\u00a0Guilhem, M.\u00a0Kloo\u00df, C.\u00a0Majenz, S.\u00a0Mukherjee, S.\u00a0Ramacher, C.\u00a0Rechberger, E.\u00a0Orsini, L.\u00a0Roy, et\u00a0al. Faest: Algorithm specifications. 2023."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"C.\u00a0Baum, L.\u00a0Braun, C.\u00a0D. de\u00a0Saint\u00a0Guilhem, M.\u00a0Kloo\u00df, E.\u00a0Orsini, L.\u00a0Roy, and P.\u00a0Scholl. Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In CRYPTO 2023, volume 14085 of LNCS, pages 581\u2013615. Springer, 2023.","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"C.\u00a0Baum, L.\u00a0Braun, A.\u00a0Munch-Hansen, and P.\u00a0Scholl. Moz$${\\mathbb{Z}}_{2^k}$$arella: Efficient vector-ole and zero-knowledge proofs over $${\\mathbb{Z}}_{2^k}$$. In CRYPTO 2022, volume 13510 of LNCS, pages 329\u2013358. Springer, 2022.","DOI":"10.1007\/978-3-031-15985-5_12"},{"issue":"11","key":"14_CR10","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1007\/s10623-023-01292-8","volume":"91","author":"C Baum","year":"2023","unstructured":"C.\u00a0Baum, S.\u00a0Dittmer, P.\u00a0Scholl, and X.\u00a0Wang. Sok: vector ole-based zero-knowledge protocols. Des. Codes Cryptogr., 91(11):3527\u20133561, 2023.","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"C.\u00a0Baum, A.\u00a0J. Malozemoff, M.\u00a0B. Rosen, and P.\u00a0Scholl. Mac\u2019n\u2019cheese: Zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions. In CRYPTO 2021, volume 12828 of LNCS, pages 92\u2013122. Springer, 2021.","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare and G.\u00a0Fuchsbauer. Policy-based signatures. In PKC 2014, volume 8383 of LNCS, pages 520\u2013537. Springer, 2014.","DOI":"10.1007\/978-3-642-54631-0_30"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, D.\u00a0Micciancio, and B.\u00a0Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In EUROCRYPT 2003,, volume 2656 of LNCS, pages 614\u2013629. Springer, 2003.","DOI":"10.1007\/3-540-39200-9_38"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"J.\u00a0C. Benaloh and M.\u00a0de\u00a0Mare. One-way accumulators: A decentralized alternative to digital sinatures (extended abstract). In EUROCRYPT 1993, volume 765 of LNCS, pages 274\u2013285. Springer, 1993.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"D.\u00a0J. Bernstein, T.\u00a0Lange, R.\u00a0Niederhagen, C.\u00a0Peters, and P.\u00a0Schwabe. Fsbday: Implementing wagner\u2019s generalized birthday attack against the sha-3 round-1 candidate fsb. In INDOCRYPT 2009, volume 5922 of LNCS, pages 18\u201338. Springer, 2009.","DOI":"10.1007\/978-3-642-10628-6_2"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"D.\u00a0J. Bernstein, T.\u00a0Lange, C.\u00a0Peters, and P.\u00a0Schwabe. Faster 2-regular information-set decoding. In IWCC 2011, volume 6639 of LNCS, pages 81\u201398. Springer, 2011.","DOI":"10.1007\/978-3-642-20901-7_5"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"D.\u00a0J. Bernstein, T.\u00a0Lange, C.\u00a0Peters, and P.\u00a0Schwabe. Really fast syndrome-based hashing. In AFRICACRYPT 2011, volume 6737 of LNCS, pages 134\u2013152. Springer, 2011.","DOI":"10.1007\/978-3-642-21969-6_9"},{"key":"14_CR18","unstructured":"L.\u00a0Bidoux, T.\u00a0Feneuil, P.\u00a0Gaborit, R.\u00a0Neveu, and M.\u00a0Rivain. Dual support decomposition in the head: Shorter signatures from rank SD and minrank. IACR Cryptol. ePrint Arch., page 541, 2024."},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10623-022-01114-3","volume":"91","author":"L Bidoux","year":"2023","unstructured":"L.\u00a0Bidoux, P.\u00a0Gaborit, M.\u00a0Kulkarni, and V.\u00a0Mateu. Code-based signatures from new proofs of knowledge for the syndrome decoding problem. Des. Codes Cryptogr., 91(2):497\u2013544, 2023.","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, S.\u00a0Eskandarian, and B.\u00a0Fisch. Post-quantum EPID signatures from symmetric primitives. In M.\u00a0Matsui, editor, CT-RSA 2019, volume 11405 of LNCS, pages 251\u2013271. Springer, 2019.","DOI":"10.1007\/978-3-030-12612-4_13"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, G.\u00a0Couteau, N.\u00a0Gilboa, and Y.\u00a0Ishai. Compressing vector OLE. In CCS 2018, pages 896\u2013912. ACM, 2018.","DOI":"10.1145\/3243734.3243868"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, G.\u00a0Couteau, N.\u00a0Gilboa, Y.\u00a0Ishai, L.\u00a0Kohl, P.\u00a0Rindal, and P.\u00a0Scholl. Efficient two-round OT extension and silent non-interactive secure computation. In CCS 2019, pages 291\u2013308. ACM, 2019.","DOI":"10.1145\/3319535.3354255"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, G.\u00a0Couteau, N.\u00a0Gilboa, Y.\u00a0Ishai, L.\u00a0Kohl, and P.\u00a0Scholl. Efficient pseudorandom correlation generators: Silent OT extension and more. In CRYPTO 2019, volume 11694 of LNCS, pages 489\u2013518. Springer, 2019.","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"P.\u00a0Briaud and M.\u00a0\u00d8ygarden. A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions. In EUROCRYPT 2023, volume 14008 of LNCS, pages 391\u2013422. Springer, 2023.","DOI":"10.1007\/978-3-031-30589-4_14"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"E.\u00a0F. Brickell, J.\u00a0Camenisch, and L.\u00a0Chen. Direct anonymous attestation. In CCS 2004, pages 132\u2013145. ACM, 2004.","DOI":"10.1145\/1030083.1030103"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"D.\u00a0Bui, E.\u00a0Carozza, G.\u00a0Couteau, D.\u00a0Goudarzi, and A.\u00a0Joux. Short signatures from regular syndrome decoding, revisited. IACR Cryptol. ePrint Arch., page 252, 2024.","DOI":"10.1007\/978-3-031-30589-4_19"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch and A.\u00a0Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology - CRYPTO 2002, volume 2442 of LNCS, pages 61\u201376. Springer, 2002.","DOI":"10.1007\/3-540-45708-9_5"},{"volume-title":"Boolean Functions for Cryptography and Coding Theory","year":"2020","key":"14_CR28","unstructured":"C.\u00a0Carlet, editor. Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge, 2020."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"E.\u00a0Carozza, G.\u00a0Couteau, and A.\u00a0Joux. Short signatures from regular syndrome decoding in the head. In EUROCRYPT 2023, volume 14008 of LNCS, pages 532\u2013563. Springer, 2023.","DOI":"10.1007\/978-3-031-30589-4_19"},{"issue":"10","key":"14_CR30","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D Chaum","year":"1985","unstructured":"D.\u00a0Chaum. Security without identification: Transaction systems to make big brother obsolete. Commun. ACM, 28(10):1030\u20131044, 1985.","journal-title":"Commun. ACM"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum and E.\u00a0van Heyst. Group signatures. In Advances in Cryptology - EUROCRYPT 1991, volume 547 of LNCS, pages 257\u2013265. Springer, 1991.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"H.\u00a0Cui, H.\u00a0Liu, D.\u00a0Yan, K.\u00a0Yang, Y.\u00a0Yu, and K.\u00a0Zhang. Resolved: Shorter signatures from regular syndrome decoding and vole-in-the-head. In PKC 2024, volume 14601 of LNCS, pages 229\u2013258. Springer, 2024.","DOI":"10.1007\/978-3-031-57718-5_8"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"D.\u00a0Derler, S.\u00a0Ramacher, and D.\u00a0Slamanig. Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives. In PQCrypto 2018, volume 10786 of LNCS, pages 419\u2013440. Springer, 2018.","DOI":"10.1007\/978-3-319-79063-3_20"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"S.\u00a0Dittmer, Y.\u00a0Ishai, S.\u00a0Lu, and R.\u00a0Ostrovsky. Improving line-point zero knowledge: Two multiplications for the price of one. In CCS 2022, pages 829\u2013841. ACM, 2022.","DOI":"10.1145\/3548606.3559385"},{"key":"14_CR35","unstructured":"S.\u00a0Dittmer, Y.\u00a0Ishai, and R.\u00a0Ostrovsky. Line-point zero knowledge and its applications. In ITC 2021, volume 199 of LIPIcs, pages 5:1\u20135:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"A.\u00a0El Kaafarani and S.\u00a0Katsumata. Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices. In PKC 2018, volume 10770 of LNCS, pages 89\u2013119. Springer, 2018.","DOI":"10.1007\/978-3-319-76581-5_4"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"A.\u00a0Esser, R.\u00a0K\u00fcbler, and A.\u00a0May. LPN decoded. In CRYPTO 2017, volume 10402 of LNCS, pages 486\u2013514. Springer, 2017.","DOI":"10.1007\/978-3-319-63715-0_17"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"A.\u00a0Esser and P.\u00a0Santini. Not just regular decoding: Asymptotics and improvements of regular syndrome decoding attacks. IACR Cryptol. ePrint Arch., page 1568, 2023.","DOI":"10.1007\/978-3-031-68391-6_6"},{"issue":"9","key":"14_CR39","doi-asserted-by":"publisher","first-page":"5754","DOI":"10.1109\/TIT.2020.2976073","volume":"66","author":"MF Ezerman","year":"2020","unstructured":"M.\u00a0F. Ezerman, H.\u00a0T. Lee, S.\u00a0Ling, K.\u00a0Nguyen, and H.\u00a0Wang. Provably secure group signature schemes from code-based assumptions. IEEE Trans. Inf. Theory, 66(9):5754\u20135773, 2020.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"T.\u00a0Feneuil, A.\u00a0Joux, and M.\u00a0Rivain. Syndrome decoding in the head: Shorter signatures from zero-knowledge proofs. In CRYPTO 2022, volume 13508 of LNCS, pages 541\u2013572. Springer, 2022.","DOI":"10.1007\/978-3-031-15979-4_19"},{"issue":"2","key":"14_CR41","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10623-022-01116-1","volume":"91","author":"T Feneuil","year":"2023","unstructured":"T.\u00a0Feneuil, A.\u00a0Joux, and M.\u00a0Rivain. 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":"14_CR42","doi-asserted-by":"crossref","unstructured":"T.\u00a0Feneuil and M.\u00a0Rivain. Threshold linear secret sharing to the rescue of mpc-in-the-head. In ASIACRYPT 2023, volume 14438 of LNCS, pages 441\u2013473. Springer, 2023.","DOI":"10.1007\/978-981-99-8721-4_14"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"H.\u00a0Feng, J.\u00a0Liu, and Q.\u00a0Wu. Secure stern signatures in quantum random oracle model. In Information Security - ISC 2019, volume 11723 of LNCS, pages 425\u2013444. Springer, 2019.","DOI":"10.1007\/978-3-030-30215-3_21"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"A.\u00a0Fiat and A.\u00a0Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO 1986, volume 263 of LNCS, pages 186\u2013194. Springer, 1986.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"C.\u00a0Ganesh, C.\u00a0Orlandi, M.\u00a0Pancholi, A.\u00a0Takahashi, and D.\u00a0Tschudi. Fiat-shamir bulletproofs are non-malleable (in the random oracle model). IACR Cryptol. ePrint Arch., page 147, 2023.","DOI":"10.1007\/s00145-024-09525-2"},{"issue":"1","key":"14_CR46","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"S.\u00a0Goldwasser, S.\u00a0Micali, and C.\u00a0Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186\u2013208, 1989.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR47","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3390\/cryptography6010005","volume":"6","author":"S Gueron","year":"2022","unstructured":"S.\u00a0Gueron, E.\u00a0Persichetti, and P.\u00a0Santini. Designing a practical code-based signature scheme from zero-knowledge proofs with trusted setup. Cryptogr., 6(1):5, 2022.","journal-title":"Cryptogr."},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay, E.\u00a0Orsini, P.\u00a0Scholl, and E.\u00a0Soria-Vazquez. Tinykeys: A new approach to efficient multi-party computation. In CRYPTO 2018, volume 10993 of LNCS, pages 3\u201333. Springer, 2018.","DOI":"10.1007\/978-3-319-96878-0_1"},{"issue":"3","key":"14_CR49","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Y.\u00a0Ishai, E.\u00a0Kushilevitz, R.\u00a0Ostrovsky, and A.\u00a0Sahai. Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput., 39(3):1121\u20131152, 2009.","journal-title":"SIAM J. Comput."},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"C.\u00a0Jeudy, A.\u00a0Roux-Langlois, and O.\u00a0Sanders. Lattice signature with efficient protocols, application to anonymous credentials. In CRYPTO 2023, volume 14082 of LNCS, pages 351\u2013383. Springer, 2023.","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"14_CR51","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, V.\u00a0Kolesnikov, and X.\u00a0Wang. Improved non-interactive zero knowledge with applications to post-quantum signatures. In CCS 2018, pages 525\u2013537. ACM, 2018.","DOI":"10.1145\/3243734.3243805"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kiayias, Y.\u00a0Tsiounis, and M.\u00a0Yung. Group encryption. In ASIACRYPT 2007, volume 4833 of LNCS, pages 181\u2013199. Springer, 2007.","DOI":"10.1007\/978-3-540-76900-2_11"},{"key":"14_CR53","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, S.\u00a0Ling, F.\u00a0Mouhartem, K.\u00a0Nguyen, and H.\u00a0Wang. Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In ASIACRYPT 2016, volume 10032 of LNCS, pages 373\u2013403, 2016.","DOI":"10.1007\/978-3-662-53890-6_13"},{"key":"14_CR54","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, S.\u00a0Ling, K.\u00a0Nguyen, and H.\u00a0Wang. Zero-knowledge arguments for lattice-based accumulators: Logarithmic-size ring signatures and group signatures without trapdoors. In EUROCRYPT 2016, volume 9666 of LNCS, pages 1\u201331. Springer, 2016.","DOI":"10.1007\/978-3-662-49896-5_1"},{"key":"14_CR55","doi-asserted-by":"crossref","unstructured":"F.\u00a0Lin, C.\u00a0Xing, and Y.\u00a0Yao. More efficient zero-knowledge protocols over $${\\mathbb{Z}}_{2^k}$$ via galois rings. IACR Cryptol. ePrint Arch., page 150, 2023.","DOI":"10.1007\/978-3-031-68400-5_13"},{"key":"14_CR56","doi-asserted-by":"crossref","unstructured":"S.\u00a0Ling, K.\u00a0Nguyen, D.\u00a0H. Phan, K.\u00a0H. Tang, H.\u00a0Wang, and Y.\u00a0Xu. Fully dynamic attribute-based signatures for circuits from codes. In PKC 2024, volume 14601 of LNCS, pages 37\u201373. Springer, 2024.","DOI":"10.1007\/978-3-031-57718-5_2"},{"key":"14_CR57","doi-asserted-by":"crossref","unstructured":"S.\u00a0Ling, K.\u00a0Nguyen, D.\u00a0Stehl\u00e9, and H.\u00a0Wang. Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications. In PKC 2013, volume 7778 of LNCS, pages 107\u2013124. Springer, 2013.","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"14_CR58","unstructured":"H.\u00a0Liu, X.\u00a0Wang, K.\u00a0Yang, and Y.\u00a0Yu. The hardness of LPN over any integer ring and field for PCG applications. IACR Cryptol. ePrint Arch., page 712, 2022."},{"key":"14_CR59","doi-asserted-by":"crossref","unstructured":"H.\u00a0Liu, X.\u00a0Wang, K.\u00a0Yang, and Y.\u00a0Yu. The hardness of LPN over any integer ring and field for PCG applications. In EUROCRYPT 2024, volume 14656 of LNCS, pages 149\u2013179. Springer, 2024.","DOI":"10.1007\/978-3-031-58751-1_6"},{"key":"14_CR60","doi-asserted-by":"crossref","unstructured":"X.\u00a0Liu and L.\u00a0Wang. Short code-based one-out-of-many proofs and applications. In PKC 2024, volume 14602 of LNCS, pages 370\u2013399. Springer, 2024.","DOI":"10.1007\/978-3-031-57722-2_12"},{"key":"14_CR61","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky. Fiat-shamir with aborts: Applications to lattice and factoring-based signatures. In ASIACRYPT 2009, volume 5912 of LNCS, pages 598\u2013616. Springer, 2009.","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"14_CR62","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky and N.\u00a0K. Nguyen. BLOOM: bimodal lattice one-out-of-many proofs and applications. In S.\u00a0Agrawal and D.\u00a0Lin, editors, ASIACRYPT 2022, volume 13794 of LNCS, pages 95\u2013125. Springer, 2022.","DOI":"10.1007\/978-3-031-22972-5_4"},{"key":"14_CR63","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"R.\u00a0J. McEliece. A public-key cryptosystem based on algebraic. Coding Thv, 4244:114\u2013116, 1978.","journal-title":"Coding Thv"},{"key":"14_CR64","doi-asserted-by":"crossref","unstructured":"C.\u00a0A. Melchor, N.\u00a0Gama, J.\u00a0Howe, A.\u00a0H\u00fclsing, D.\u00a0Joseph, and D.\u00a0Yue. The return of the sdith. In EUROCRYPT 2023, volume 14008 of LNCS, pages 564\u2013596. Springer, 2023.","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"14_CR65","doi-asserted-by":"crossref","unstructured":"C.\u00a0A. Melchor, A.\u00a0H\u00fclsing, D.\u00a0Joseph, C.\u00a0Majenz, E.\u00a0Ronen, and D.\u00a0Yue. Sdith in the QROM. In ASIACRYPT 2023, volume 14444 of LNCS, pages 317\u2013350. Springer, 2023.","DOI":"10.1007\/978-981-99-8739-9_11"},{"key":"14_CR66","doi-asserted-by":"crossref","unstructured":"R.\u00a0C. Merkle. A certified digital signature. In CRYPTO 1989, volume 435 of LNCS, pages 218\u2013238. Springer, 1989.","DOI":"10.1007\/0-387-34805-0_21"},{"key":"14_CR67","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and M.\u00a0Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In STOC 1990, pages 427\u2013437. ACM, 1990.","DOI":"10.1145\/100216.100273"},{"key":"14_CR68","doi-asserted-by":"crossref","unstructured":"K.\u00a0Nguyen, R.\u00a0Safavi-Naini, W.\u00a0Susilo, H.\u00a0Wang, Y.\u00a0Xu, and N.\u00a0Zeng. Group encryption: Full dynamicity, message filtering and code-based instantiation. In PKC 2021, volume 12711 of LNCS, pages 678\u2013708. Springer, 2021. Full version is available at https:\/\/eprint.iacr.org\/2021\/226.","DOI":"10.1007\/978-3-030-75248-4_24"},{"key":"14_CR69","doi-asserted-by":"crossref","unstructured":"K.\u00a0Nguyen, H.\u00a0Tang, H.\u00a0Wang, and N.\u00a0Zeng. New code-based privacy-preserving cryptographic constructions. In ASIACRYPT 2019, volume 11922 of LNCS, pages 25\u201355. Springer, 2019.","DOI":"10.1007\/978-3-030-34621-8_2"},{"issue":"1\u20133","key":"14_CR70","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R Nojima","year":"2008","unstructured":"R.\u00a0Nojima, H.\u00a0Imai, K.\u00a0Kobara, and K.\u00a0Morozov. Semantic security for the mceliece cryptosystem without random oracles. Des. Codes Cryptogr., 49(1-3):289\u2013305, 2008.","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR71","unstructured":"R.\u00a0O\u2019Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014."},{"issue":"5","key":"14_CR72","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"E.\u00a0Prange. The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory, 8(5):5\u20139, 1962.","journal-title":"IRE Trans. Inf. Theory"},{"key":"14_CR73","doi-asserted-by":"crossref","unstructured":"R.\u00a0L. Rivest, A.\u00a0Shamir, and Y.\u00a0Tauman. How to leak a secret. In ASIACRYPT 2001, volume 2248 of LNCS, pages 552\u2013565. Springer, 2001.","DOI":"10.1007\/3-540-45682-1_32"},{"key":"14_CR74","doi-asserted-by":"crossref","unstructured":"L.\u00a0Roy. Softspokenot: Quieter OT extension from small-field silent VOLE in the minicrypt model. In CRYPTO 2022, volume 13507 of LNCS, pages 657\u2013687. Springer, 2022.","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"14_CR75","doi-asserted-by":"crossref","unstructured":"A.\u00a0Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In FOCS 1999, pages 543\u2013553. IEEE Computer Society, 1999.","DOI":"10.1109\/SFFCS.1999.814628"},{"issue":"6","key":"14_CR76","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.556672","volume":"42","author":"J Stern","year":"1996","unstructured":"J.\u00a0Stern. A new paradigm for public key identification. IEEE Trans. Inf. Theory, 42(6):1757\u20131768, 1996.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR77","doi-asserted-by":"crossref","unstructured":"D.\u00a0Unruh. Non-interactive zero-knowledge proofs in the quantum random oracle model. In EUROCRYPT 2015, volume 9057 of Lecture Notes in Computer Science, pages 755\u2013784. Springer, 2015.","DOI":"10.1007\/978-3-662-46803-6_25"},{"key":"14_CR78","doi-asserted-by":"crossref","unstructured":"D.\u00a0A. Wagner. A generalized birthday problem. In CRYPTO 2002, volume 2442 of LNCS, pages 288\u2013303. Springer, 2002.","DOI":"10.1007\/3-540-45708-9_19"},{"key":"14_CR79","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114407","volume":"990","author":"L Wang","year":"2024","unstructured":"L.\u00a0Wang, J.\u00a0Chen, H.\u00a0Dai, and C.\u00a0Tao. Efficient code-based fully dynamic group signature scheme. Theor. Comput. Sci., 990:114407, 2024.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR80","doi-asserted-by":"crossref","unstructured":"C.\u00a0Weng, K.\u00a0Yang, J.\u00a0Katz, and X.\u00a0Wang. Wolverine: Fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In IEEE Symposium on Security and Privacy 2021, pages 1074\u20131091. IEEE, 2021.","DOI":"10.1109\/SP40001.2021.00056"},{"key":"14_CR81","doi-asserted-by":"crossref","unstructured":"C.\u00a0Weng, K.\u00a0Yang, Z.\u00a0Yang, X.\u00a0Xie, and X.\u00a0Wang. Antman: Interactive zero-knowledge proofs with sublinear communication. In CCS 2022, pages 2901\u20132914. ACM, 2022.","DOI":"10.1145\/3548606.3560667"},{"key":"14_CR82","doi-asserted-by":"crossref","unstructured":"K.\u00a0Yang, P.\u00a0Sarkar, C.\u00a0Weng, and X.\u00a0Wang. Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In CCS 2021, pages 2986\u20133001. ACM, 2021.","DOI":"10.1145\/3460120.3484556"},{"key":"14_CR83","doi-asserted-by":"crossref","unstructured":"R.\u00a0Yang, M.\u00a0H. Au, Z.\u00a0Zhang, Q.\u00a0Xu, Z.\u00a0Yu, and W.\u00a0Whyte. Efficient lattice-based zero-knowledge arguments with standard soundness: Construction and applications. In CRYPTO 2019, volume 11692 of LNCS, pages 147\u2013175. Springer, 2019.","DOI":"10.1007\/978-3-030-26948-7_6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:03:08Z","timestamp":1733680988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}