{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T21:53:22Z","timestamp":1769896402543,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819544332","type":"print"},{"value":"9789819544349","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"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-4434-9_1","type":"book-chapter","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T23:02:31Z","timestamp":1762988551000},"page":"3-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compressed Verification for\u00a0Post-quantum Signatures with\u00a0Long-Term Public Keys"],"prefix":"10.1007","author":[{"given":"Gustavo","family":"Banegas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana\u00eblle","family":"Le D\u00e9v\u00e9hat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,13]]},"reference":[{"key":"1_CR1","unstructured":"Banegas, G., et al.: WAVE \u2013 submission to NIST post-quantum signatures project (2023). https:\/\/wave-sign.org\/"},{"key":"1_CR2","unstructured":"Bernstein, D.J.: RSA signatures and Rabin\u2013Williams signatures: the state of the art (2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS+ signature framework. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, pp. 2129\u20132146. Association for Computing Machinery (2019)","DOI":"10.1145\/3319535.3363229"},{"issue":"257","key":"1_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1090\/S0025-5718-06-01849-7","volume":"76","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Sorenson, J.P.: Modular exponentiation via the explicit Chinese remainder theorem. Math. Comput. 76(257), 443\u2013454 (2007)","journal-title":"Math. Comput."},{"key":"1_CR5","unstructured":"Bos, J.W., Kleinjung, T., Page, D.: Efficient modular multiplication. Cryptology ePrint Archive, Paper 2021\/1151 (2021)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s13389-024-00358-0","volume":"14","author":"C Boschini","year":"2024","unstructured":"Boschini, C., Fiore, D., Pagnin, E., Torresetti, L., Visconti, A.: Progressive and efficient verification for digital signatures: extensions and experimental results. J. Cryptogr. Eng. 14(3), 551\u2013575 (2024)","journal-title":"J. Cryptogr. Eng."},{"key":"1_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":"1_CR8","doi-asserted-by":"crossref","unstructured":"Cremers, C., D\u00fczl\u00fc, S., Fiedler, R., Fischlin, M., Janson, C.: Buffing signature schemes beyond unforgeability and the case of post-quantum signatures. In: IEEE Symposium on Security and Privacy, pp. 1696\u20131714 (2021)","DOI":"10.1109\/SP40001.2021.00093"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-34578-5_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"T Debris-Alazard","year":"2019","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 21\u201351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_2"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s11139-016-9839-4","volume":"45","author":"P Dusart","year":"2018","unstructured":"Dusart, P.: Explicit estimates of some functions over primes. Ramanujan J. 45, 227\u2013251 (2018)","journal-title":"Ramanujan J."},{"key":"1_CR11","unstructured":"Espitau, T., Niot, G., Sun, C., Tibouchi, M.: SQUIRRELS - Square Unstructured Integer Euclidean Lattice Signature (2023)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-24582-7_31","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"M Fischlin","year":"2003","unstructured":"Fischlin, M.: Progressive verification: the case of message authentication. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 416\u2013429. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24582-7_31"},{"key":"1_CR13","unstructured":"Fouque, P.-A., et al.: Falcon: fast-fourier lattice-based compact signatures over NTRU \u2013 submission to NIST post-quantum cryptography project (2018). https:\/\/falcon-sign.info\/"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Rausch, L., Buchmann, J.: Optimal parameters for XMSSMT. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E., Xu, L. (eds.) CD-ARES 2013. LNCS, vol. 8128, pp. 194\u2013208. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40588-4_14","DOI":"10.1007\/978-3-642-40588-4_14"},{"key":"1_CR16","unstructured":"H\u00fclsing, A., Rijneveld, J.: XMSS reference implementation (2024). https:\/\/github.com\/XMSS\/xmss-reference"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-030-29959-0_9","volume-title":"Computer Security \u2013 ESORICS 2019","author":"DV Le","year":"2019","unstructured":"Le, D.V., Kelkar, M., Kate, A.: Flexible signatures: making authentication suitable for real-time environments. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 173\u2013193. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_9"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Lenstra\u00a0Jr, H.W.: Factoring integers with elliptic curves. Ann. Math. 649\u2013673 (1987)","DOI":"10.2307\/1971363"},{"key":"1_CR19","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"},{"issue":"177","key":"1_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"1_CR21","unstructured":"National Institute of Standards and Technology. Stateless hash-based digital signature standard. Technical Report Federal Information Processing Standards Publications (FIPS PUBS) 205, NIST (2004)"},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1137\/15M103950X","volume":"30","author":"PQ Nguyen","year":"2016","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: Counting co-cyclic lattices. SIAM J. Discret. Math. 30(3), 1358\u20131370 (2016)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Pomerance, C., Selfridge, J., Wagstaff Jr., S.S.: The pseudoprimes to $$25\\cdot 10^9$$. Math. Comput. 35(151), 1003\u20131026 (1980)","DOI":"10.1090\/S0025-5718-1980-0572872-7"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/11496137_10","volume-title":"Applied Cryptography and Network Security","author":"T Pornin","year":"2005","unstructured":"Pornin, T., Stern, J.P.: Digital signatures do not guarantee exclusive ownership. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 138\u2013150. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_10"},{"key":"1_CR25","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical Report 212, MIT Laboratory for Computer Science (1979)"},{"key":"1_CR26","unstructured":"SPHINCS+ Team. SPHINCS+ reference implementation (2024). https:\/\/github.com\/sphincs\/sphincsplus"},{"key":"1_CR27","unstructured":"Squirrels team. Squirrels reference implementation (2024). https:\/\/squirrels-pqc.org\/ with sha256sum c4fd2a961f177a2f49970ca1758bde1a676a2fd7b3e62ea0e0c0593955902ab7"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jcss.2020.08.005","volume":"116","author":"AR Taleb","year":"2021","unstructured":"Taleb, A.R., Vergnaud, D.: Speeding-up verification of digital signatures. J. Comput. Syst. Sci. 116, 22\u201339 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR29","first-page":"296","volume":"3","author":"SS Wagstaff","year":"2006","unstructured":"Wagstaff, S.S.: Is there a shortage of primes for cryptography? Int. J. Netw. Secur. 3, 296\u2013299 (2006)","journal-title":"Int. J. Netw. Secur."},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"26","author":"HC Williams","year":"1980","unstructured":"Williams, H.C.: A modification of the RSA public-key encryption procedure. IEEE Trans. Inf. Theory 26, 726\u2013729 (1980)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Zimmermann, P., Dodson, B.: 20 years of ECM. In: Algorithmic Number Theory, ANTS-VII, pp. 525\u2013542 (2006)","DOI":"10.1007\/11792086_37"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4434-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T10:02:07Z","timestamp":1769853727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4434-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,13]]},"ISBN":["9789819544332","9789819544349"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4434-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,13]]},"assertion":[{"value":"13 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cy2sec.comm.eng.osaka-u.ac.jp\/miyaji-lab\/event\/cans2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}