{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:29:18Z","timestamp":1769524158717,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","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-032-01855-7_17","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:33Z","timestamp":1755373293000},"page":"514-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compact Lattice Signatures via\u00a0Iterative Rejection Sampling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3724-2914","authenticated-orcid":false,"given":"Joel","family":"G\u00e4rtner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Bai, S., Beard, A., Johnson, F., Vidhanalage, S.K.B., Ngo, T.: Fiat-shamir signatures based on module-NTRU. In: Nguyen, K., Yang, G., Guo, F., Susilo, W. (eds.) ACISP 22: 27th Australasian Conference on Information Security and Privacy. Lecture Notes in Computer Science, vol. 13494, pp. 289\u2013308. Springer, Cham, Switzerland, Wollongong, NSW, Australia (2022). https:\/\/doi.org\/10.1007\/978-3-031-22301-3_15","DOI":"10.1007\/978-3-031-22301-3_15"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bai, S., Galbraith, S.D.: An improved compression technique for signatures based on learning with errors. In: Benaloh, J. (ed.) Topics in Cryptology \u2013CT-RSA\u00a02014. Lecture Notes in Computer Science, vol.\u00a08366, pp. 28\u201347. Springer, Cham, Switzerland, San Francisco, CA, USA (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_2","DOI":"10.1007\/978-3-319-04852-9_2"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Bai, S., Jangir, H., Lin, H., Ngo, T., Wen, W., Zheng, J.: Compact encryption based on module-NTRU problems. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography - 15th International Workshop, PQCrypto 2024, Part\u00a0I, pp. 371\u2013405. Springer, Cham, Switzerland, Oxford, UK (2024).https:\/\/doi.org\/10.1007\/978-3-031-62743-9_13","DOI":"10.1007\/978-3-031-62743-9_13"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Behnia, R., Chen, Y., Masny, D.: On removing rejection conditions in practical lattice-based signatures. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 380\u2013398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_20","DOI":"10.1007\/978-3-030-81293-5_20"},{"key":"17_CR6","unstructured":"Bos, J.W., et al.: HAWK. Tech. rep., National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Bruinderink, L.G., H\u00fclsing, A., Lange, T., Yarom, Y.: Flush, gauss, and reload - a cache attack on the BLISS lattice-based signature scheme. In: Gierlichs, B., Poschmann, A.Y. (eds.) Cryptographic Hardware and Embedded Systems \u2013 CHES\u00a02016. Lecture Notes in Computer Science, vol.\u00a09813, pp. 323\u2013345. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_16","DOI":"10.1007\/978-3-662-53140-2_16"},{"key":"17_CR8","unstructured":"Cheon, J.H., et al.: HAETAE. Tech. rep., National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., et al.: HAETAE: shorter lattice-based fiat-shamir signatures. IACR Trans. Cryptographic Hardware Embedded Syst. 2024(3), 25\u201375 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i3.25-75, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/11669","DOI":"10.46586\/tches.v2024.i3.25-75"},{"key":"17_CR10","unstructured":"del Pino, R., Espitau, T., et al.: Raccoon. Tech. rep., National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Devevey, J., Fawzi, O., Passel\u00e8gue, A., Stehl\u00e9, D.: On rejection sampling in Lyubashevsky\u2019s signature scheme. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0IV. Lecture Notes in Computer Science, vol. 13794, pp. 34\u201364. Springer, Cham, Switzerland, Taipei, Taiwan (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_2","DOI":"10.1007\/978-3-031-22972-5_2"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Devevey, J., Passel\u00e8gue, A., Stehl\u00e9, D.: G+G: A fiat-shamir lattice signature based on convolved gaussians. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02023, Part\u00a0VII. Lecture Notes in Computer Science, vol. 14444, pp. 37\u201364. Springer, Singapore, Singapore, Guangzhou, China (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"17_CR13","unstructured":"Ducas, L.: Accelerating bliss: the geometry of ternary polynomials. Cryptology ePrint Archive, Report 2014\/874 (2014). https:\/\/eprint.iacr.org\/2014\/874"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02013, Part\u00a0I. Lecture Notes in Computer Science, vol.\u00a08042, pp. 40\u201356. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"17_CR15","unstructured":"Duda, J.: Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding (2014). https:\/\/arxiv.org\/abs\/1311.2540"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"G\u00e4rtner, J.: NTWE: a natural combination of NTRU and LWE. In: Johansson, T., Smith-Tone, D. (eds.) Post-Quantum Cryptography - 14th International Workshop, PQCrypto 2023, pp. 321\u2013353. Springer, Cham, Switzerland, College Park, USA (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_12","DOI":"10.1007\/978-3-031-40003-2_12"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. ACM Press, Victoria, BC, Canada (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"17_CR18","unstructured":"G\u00e4rtner, J.: Compact lattice signatures via iterative rejection sampling. Cryptology ePrint Archive, Paper 2024\/2052 (2024). https:\/\/eprint.iacr.org\/2024\/2052"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (eds) Third Algorithmic Number Theory Symposium (ANTS). Lecture Notes in Computer Science, vol.\u00a01423, pp. 267\u2013288. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","DOI":"10.1007\/s10623-014-9938-4"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02012. Lecture Notes in Computer Science, vol.\u00a07237, pp. 738\u2013755. Springer Berlin Heidelberg, Germany, Cambridge, UK (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"17_CR23","unstructured":"Lyubashevsky, V., Ducas, L., Kiltz, E., Lepoint, T., Schwabe, P., Seiler, G., Stehl\u00e9, D., Bai, S.: CRYSTALS-DILITHIUM. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Pessl, P.: Analyzing the shuffling side-channel countermeasure for lattice-based signatures. In: Dunkelman, O., Sanadhya, S.K. (eds.) Progress in Cryptology - INDOCRYPT\u00a02016: 17th International Conference in Cryptology in India. Lecture Notes in Computer Science, vol. 10095, pp. 153\u2013170. Springer, Cham, Switzerland, Kolkata, India (2016). https:\/\/doi.org\/10.1007\/978-3-319-49890-4_9","DOI":"10.1007\/978-3-319-49890-4_9"},{"key":"17_CR25","unstructured":"Prest, T., et al.: FALCON. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","DOI":"10.1007\/BF00196725"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Woo, J., et al.: NTRU+sign: compact NTRU-based signatures using bimodal distributions. Cryptology ePrint Archive, Paper 2025\/106 (2025). https:\/\/eprint.iacr.org\/2025\/106","DOI":"10.1007\/s10623-025-01739-0"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:52Z","timestamp":1768850512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_17","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}