{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:22:41Z","timestamp":1778127761888,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550982","type":"print"},{"value":"9789819550999","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5099-9_7","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:38:12Z","timestamp":1765107492000},"page":"200-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Worst-Case Lattice Sampler with\u00a0Truncated Gadgets and\u00a0Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2869-3833","authenticated-orcid":false,"given":"Corentin","family":"Jeudy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1283-7257","authenticated-orcid":false,"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Argo, S., G\u00fcneysu, T., Jeudy, C., Land, G., Roux-Langlois, A., Sanders, O.: Practical post-quantum signatures for privacy. In: CCS (2024). https:\/\/doi.org\/10.1145\/3658644.3670297","DOI":"10.1145\/3658644.3670297"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-81293-5_11","volume-title":"Post-Quantum Cryptography","author":"P Bert","year":"2021","unstructured":"Bert, P., Eberhart, G., Prabel, L., Roux-Langlois, A., Sabt, M.: Implementation of lattice trapdoors on modules and applications. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021. LNCS, vol. 12841, pp. 195\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_11"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology","author":"D Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 199\u2013203. Springer, Boston, MA (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373","author":"D Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Commun. ACM (1985). https:\/\/doi.org\/10.1145\/4372.4373","journal-title":"Commun. ACM"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-34618-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Genise, N., Mukherjee, P.: Approximate trapdoors for lattices and\u00a0smaller hash-and-sign signatures. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_1"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. TCHES (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-981-99-8739-9_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2023","author":"T Espitau","year":"2023","unstructured":"Espitau, T., Wallet, A., Yu, Y.: On Gaussian sampling, smoothing parameter and application to signatures. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14444, pp. 65\u201397. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_3"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-030-45374-9_21","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"N Genise","year":"2020","unstructured":"Genise, N., Micciancio, D., Peikert, C., Walter, M.: Improved discrete gaussian and subgaussian analysis for lattice cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 623\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_21"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-78381-9_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"N Genise","year":"2018","unstructured":"Genise, N., Micciancio, D.: Faster Gaussian sampling for trapdoor lattices with arbitrary modulus. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 174\u2013203. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_7"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"7_CR13","unstructured":"Jeudy, C.: Design of advanced post-quantum signatures schemes. Ph.D. thesis, Universit\u00e9 de Rennes 1, Rennes, France (2024). https:\/\/tel.archives-ouvertes.fr\/tel-04727543v1"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols. application to anonymous credentials. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 351\u2013383. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_12","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-031-62743-9_9","volume-title":"Post-Quantum Cryptography - PQCrypto 2024","author":"C Jeudy","year":"2024","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Phoenix: hash-and-sign with aborts from lattice gadgets. In: Saarinen, M.J., Smith-Tone, D. (eds.) PQCrypto 2024. LNCS, vol. 14771, pp. 265\u2013299. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_9"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Jeudy, C., Sanders, O.: Worst-case lattice sampler with truncated gadgets and applications. IACR Cryptology ePrint Archive, p.\u00a01952 (2024)","DOI":"10.1007\/978-981-95-5099-9_7"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Sanders, O.: Improved Lattice Blind Signatures from Recycled Entropy. In: Tauman Kalai, Y., Kamara, S.F. (eds) CRYPTO 2025. LNCS, vol. 16000, pp. 477\u2013513. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01855-7_16","DOI":"10.1007\/978-3-032-01855-7_16"},{"key":"7_CR18","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA (2000)"},{"key":"7_CR19","unstructured":"Lai, Q., Chen, C., Liu, F.H., Lysyanskaya, A., Wang, Z.: Lattice-based commit-transferrable signatures and applications to anonymous credentials. IACR Cryptology ePrint Archive, p.\u00a0766 (2023)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0898-1221(01)00278-4","volume":"43","author":"TT Lu","year":"2002","unstructured":"Lu, T.T., Shiou, S.H.: Inverses of 2 $$\\times $$ 2 Block Matrices. Comput. Math. Appl. 43, 119\u2013129 (2002)","journal-title":"Comput. Math. Appl."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K.: BLOOM: bimodal lattice one-out-of-many proofs and applications. Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794, pp. 95\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_4","DOI":"10.1007\/978-3-031-22972-5_4"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-92068-5_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plancon, M., Seiler, G.: Shorter lattice-based group signatures via\u00a0\u201calmost free\u2019\u2019 encryption and\u00a0other optimizations. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 218\u2013248. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_8"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"7_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel Gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"del Pino, R., Lyubashevsky, V., Seiler, G.: Lattice-based group signatures and zero-knowledge proofs of automorphism stability. In: CCS (2018). https:\/\/doi.org\/10.1145\/3243734.3243852","DOI":"10.1145\/3243734.3243852"},{"key":"7_CR28","unstructured":"Prest, T., et al.: FALCON. Technical report (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. ACM Commun. (1978)","DOI":"10.21236\/ADA606588"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Yu, Y., Jia, H., Wang, X.: Compact lattice gadget and its applications to hash-and-sign signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 390\u2013420. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_13","DOI":"10.1007\/978-3-031-38554-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5099-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:49:05Z","timestamp":1770659345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}