{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:12:31Z","timestamp":1769512351824,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683756","type":"print"},{"value":"9783031683763","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-68376-3_11","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:02:07Z","timestamp":1723755727000},"page":"339-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polytopes in\u00a0the\u00a0Fiat-Shamir with Aborts Paradigm"],"prefix":"10.1007","author":[{"given":"Henry","family":"Bambury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Beguinet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Ricosset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Sageloli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"11_CR1","unstructured":"Bambury, H., Beguinet, H., Ricosset, T., Sageloli, E.: Polytopes in the fiat-shamir with aborts paradigm. Cryptology ePrint Archive, Report 2024\/411 (2023). https:\/\/eprint.iacr.org\/2024\/411"},{"key":"11_CR2","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of fiat-shamir with aborts and dilithium. Cryptology ePrint Archive, Report 2023\/246 (2023). https:\/\/eprint.iacr.org\/2023\/246"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. Cryptology ePrint Archive, Report 2023\/077 (2023). https:\/\/eprint.iacr.org\/2023\/077","DOI":"10.1145\/3576915.3616613"},{"key":"11_CR4","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: More efficient amortization of exact zero-knowledge proofs for LWE. Cryptology ePrint Archive, Report 2020\/1449 (2020). https:\/\/eprint.iacr.org\/2020\/1449"},{"key":"11_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-031-38545-2_13","volume-title":"CRYPTO 2023, Part II","author":"J Bootle","year":"2023","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 384\u2013417. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_13"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Br\u00f8ndsted, A.: An Introduction to Convex Polytopes. Springer, New York (1983). https:\/\/doi.org\/10.1007\/978-1-4612-1148-8","DOI":"10.1007\/978-1-4612-1148-8"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-662-53140-2_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"L Groot Bruinderink","year":"2016","unstructured":"Groot Bruinderink, L., H\u00fclsing, A., Lange, T., Yarom, Y.: Flush, gauss, and reload \u2013 a cache attack on the bliss lattice-based signature scheme. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 323\u2013345. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_16"},{"key":"11_CR8","unstructured":"Cheon, J.H., et al.: HAETAE algorithm specifications and supporting documentation. Submission to the NIST\u2019s Post-Quantum Cryptography Standardization Process (2023)"},{"key":"11_CR9","unstructured":"Chevallier, A., Cazals, F., Fearnhead, P.: Efficient computation of the volume of a polytope in high-dimensions using piecewise deterministic Markov processes (2022)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"del Pino, R., Lyubashevsky, V., Seiler, G.: Lattice-based group signatures and zero-knowledge proofs of automorphism stability. Cryptology ePrint Archive, Report 2018\/779 (2018). https:\/\/eprint.iacr.org\/2018\/779","DOI":"10.1145\/3243734.3243852"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Devevey, J., Fallahpour, P., Passel\u00e8gue, A., Stehl\u00e9, D.: A detailed analysis of fiat-shamir with aborts. Cryptology ePrint Archive, Report 2023\/245 (2023). https:\/\/eprint.iacr.org\/2023\/245","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"11_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-22972-5_2","volume-title":"ASIACRYPT 2022, Part IV","author":"J Devevey","year":"2022","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.) ASIACRYPT 2022, Part IV. LNCS, vol. 13794, pp. 34\u201364. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_2"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"11_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-031-38548-3_6","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"L Ducas","year":"2023","unstructured":"Ducas, L., Espitau, T., Postlethwaite, E.W.: Finding short integer solutions when the modulus is small. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14083, pp. 150\u2013176. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_6"},{"key":"11_CR15","unstructured":"Ducas, L., et al.: CRYSTALS\u2013Dilithium: a lattice-based digital signature scheme. Submission to the NIST\u2019s Post-Quantum Cryptography Standardization Process (update from February 2021) (2021)"},{"key":"11_CR16","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS\u2013Dilithium: Digital Signatures from Module Lattices. Cryptology ePrint Archive, Paper 2017\/633, Version 20170627:201152 (2017). https:\/\/eprint.iacr.org\/archive\/2017\/633\/20170627:201152"},{"key":"11_CR17","unstructured":"Ducas, L., Schanck, J.: PQ-crystals\/security-estimates (2021). https:\/\/github.com\/pq-crystals\/security-estimates"},{"key":"11_CR18","unstructured":"Duda, J.: Asymmetric numeral systems. CoRR abs\/0902.0271 (2009). http:\/\/arxiv.org\/abs\/0902.0271"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Dyer, M.E., Frieze, A.M.: On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5), 967\u2013974 (1988). http:\/\/dblp.uni-trier.de\/db\/journals\/siamcomp\/siamcomp17.html#DyerF88","DOI":"10.1137\/0217060"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Espitau, T., Fouque, P.A., G\u00e9rard, B., Tibouchi, M.: Side-channel attacks on BLISS lattice-based signatures: exploiting branch tracing against strongSwan and electromagnetic emanations in microcontrollers. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1857\u20131874. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134028","DOI":"10.1145\/3133956.3134028"},{"key":"11_CR21","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1971","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 2, 2nd edn. Wiley, New York (1971)","edition":"2"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Guerreau, M., Martinelli, A., Ricosset, T., Rossi, M.: The hidden parallelepiped is back again: power analysis attacks on falcon. IACR TCHES 2022(3), 141\u2013164 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i3.141-164","DOI":"10.46586\/tches.v2022.i3.141-164"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-44223-1_5","volume-title":"Post-Quantum Cryptography","author":"C Paquin","year":"2020","unstructured":"Paquin, C., Stebila, D., Tamvada, G.: Benchmarking post-quantum cryptography in TLS. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 72\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_5"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-89255-7_23","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"A Kawachi","year":"2008","unstructured":"Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 372\u2013389. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_23"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-319-78372-7_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"E Kiltz","year":"2018","unstructured":"Kiltz, E., Lyubashevsky, V., Schaffner, C.: A concrete treatment of fiat-shamir signatures in the quantum random-oracle model. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part III. LNCS, vol. 10822, pp. 552\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-36362-7_8","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"S Ling","year":"2013","unstructured":"Ling, S., Nguyen, K., Stehl\u00e9, D., Wang, H.: Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 107\u2013124. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_8"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V Lyubashevsky","year":"2009","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"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"11_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","volume-title":"CRYPTO 2022, Part II","author":"V Lyubashevsky","year":"2022","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, Part II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Practical lattice-based zero-knowledge proofs for integer relations. Cryptology ePrint Archive, Report 2020\/1183 (2020). https:\/\/eprint.iacr.org\/2020\/1183","DOI":"10.1145\/3372297.3417894"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-75245-3_9","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay, J.A. (ed.) PKC 2021, Part I. LNCS, vol. 12710, pp. 215\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions. Cryptology ePrint Archive, Report 2021\/564 (2021). https:\/\/eprint.iacr.org\/2021\/564","DOI":"10.1007\/978-3-030-84245-1_21"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Pessl, P., Bruinderink, L.G., Yarom, Y.: To BLISS-B or not to be: attacking strongSwan\u2019s implementation of post-quantum signatures. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1843\u20131855. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134023","DOI":"10.1145\/3133956.3134023"},{"key":"11_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-031-31368-4_8","volume-title":"PKC 2023, Part I","author":"T Prest","year":"2023","unstructured":"Prest, T.: A key-recovery attack against mitaka in the $$t$$-probing model. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part I. LNCS, vol. 13940, pp. 205\u2013220. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_8"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Prochno, J., Th\u00e4le, C., Turchi, N.: Geometry of $$\\ell _p^n$$-balls: classical results and recent developments (2018)","DOI":"10.1007\/978-3-030-26391-1_9"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Schechtman, G., Zinn, J.: On the volume of the intersection of two ln p balls. Proc. Am. Math. Soc. 110(1), 217\u2013224 (1990). http:\/\/www.jstor.org\/stable\/2048262","DOI":"10.2307\/2048262"},{"key":"11_CR37","unstructured":"Stephens-Davidowitz, N.: On the Gaussian measure over lattices. Ph.D. thesis, New York University (2017)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68376-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:04:18Z","timestamp":1723755858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68376-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683756","9783031683763"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68376-3_11","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":"16 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}