{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:02Z","timestamp":1778087582420,"version":"3.51.4"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253293","type":"print"},{"value":"9783032253309","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-25330-9_14","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:30:58Z","timestamp":1778085058000},"page":"392-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lattice EPID with\u00a0Efficient Revocation"],"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":[[2026,5,7]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. (2015)","DOI":"10.1515\/jmc-2015-0016"},{"key":"14_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":"14_CR3","doi-asserted-by":"publisher","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: ICALP (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. (1993)","DOI":"10.1007\/BF01445125"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: EUROCRYPT (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_38","DOI":"10.1007\/3-540-39200-9_38"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: CT-RSA (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_11","DOI":"10.1007\/978-3-540-30574-3_11"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: CRYPTO (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Eskandarian, S., Fisch, B.: Post-quantum EPID signatures from symmetric primitives. In: CT-RSA (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_13","DOI":"10.1007\/978-3-030-12612-4_13"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: CCS (2004). https:\/\/doi.org\/10.1145\/1030083.1030106, https:\/\/doi.org\/10.1145\/1030083.1030106","DOI":"10.1145\/1030083.1030106"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. In: WPES (2007). https:\/\/doi.org\/10.1145\/1314333.1314337","DOI":"10.1145\/1314333.1314337"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing for hardware authentication and attestation. In: SocialCom PASSAT (2010). https:\/\/doi.org\/10.1109\/SOCIALCOM.2010.118","DOI":"10.1109\/SOCIALCOM.2010.118"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: CRYPTO (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_8","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: CRYPTO (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5","DOI":"10.1007\/3-540-45708-9_5"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO (1982). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Showing credentials without identification: signatures transferred between unconditionally unlinkable pseudonyms. In: EUROCRYPT (1985). https:\/\/doi.org\/10.1007\/3-540-39805-8_28","DOI":"10.1007\/3-540-39805-8_28"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: EUROCRYPT (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22","DOI":"10.1007\/3-540-46416-6_22"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Chen, L., Dong, C., Kassem, N.E., Newton, C.J.P., Wang, Y.: A new hash-based enhanced privacy ID signature scheme. In: PQCrypto (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_2","DOI":"10.1007\/978-3-031-62743-9_2"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Chen, L., Xu, Z., Tu, T., Wang, Z.: Lattice-based privacy enhanced identity protocol for SDO services. In: ICSIP (2023). https:\/\/doi.org\/10.1109\/ICSIP57908.2023.10270826","DOI":"10.1109\/ICSIP57908.2023.10270826"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: PKC (2005) https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Ducas, L., Prest, T.: Fast fourier orthogonalization. In: ISSAC (2016). https:\/\/doi.org\/10.1145\/2930889.2930923","DOI":"10.1145\/2930889.2930923"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Espitau, T., Tibouchi, M., Wallet, A., Yu, Y.: Shorter hash-and-sign lattice-based signatures. In: CRYPTO (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_9","DOI":"10.1007\/978-3-031-15979-4_9"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Espitau, T., Wallet, A., Yu, Y.: On gaussian sampling, smoothing parameter and application to signatures. In: ASIACRYPT (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_3","DOI":"10.1007\/978-981-99-8739-9_3"},{"key":"14_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-018-9281-4","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. (2019). https:\/\/doi.org\/10.1007\/s00145-018-9281-4","journal-title":"J. Cryptol."},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: ANTS (1998). https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"14_CR25","unstructured":"ISO\/IEC: ISO\/IEC 20008-2:2013 information technology \u2014 security techniques \u2014 anonymous digital signatures \u2014 part 2: mechanisms using a group public key (2013). https:\/\/www.iso.org\/standard\/56916.html"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols. Application to anonymous credentials. In: CRYPTO (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_12","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Sanders, O.: Improved lattice blind signatures from recycled entropy. In: CRYPTO (2025). https:\/\/doi.org\/10.1007\/978-3-032-01855-7_16","DOI":"10.1007\/978-3-032-01855-7_16"},{"key":"14_CR28","unstructured":"Jeudy, C., Sanders, O.: Lattice EPID with efficient revocation. IACR Cryptol. ePrint Arch. p.\u00a01225 (2025)"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Sanders, O.: Worst-case lattice sampler with truncated gadgets and applications. In: ASIACRYPT (2025). https:\/\/doi.org\/10.1007\/978-981-95-5099-9_7","DOI":"10.1007\/978-981-95-5099-9_7"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Kassem, N.E., Fiolhais, L., Martins, P., Chen, L., Sousa, L.: A lattice-based enhanced privacy ID. In: WISTP (2019). https:\/\/doi.org\/10.1007\/978-3-030-41702-4_2","DOI":"10.1007\/978-3-030-41702-4_2"},{"key":"14_CR31","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA (2000)"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Langlois, A., Ling, S., Nguyen, K., Wang, H.: Lattice-based group signature scheme with verifier-local revocation. In: PKC (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_20","DOI":"10.1007\/978-3-642-54631-0_20"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. In: DCC (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","DOI":"10.1007\/s10623-014-9938-4"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K.: BLOOM: bimodal lattice one-out-of-many proofs and applications. In: ASIACRYPT (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_4","DOI":"10.1007\/978-3-031-22972-5_4"},{"key":"14_CR35","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: CRYPTO (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M., Seiler, G.: Shorter lattice-based group signatures via \u201calmost free\u201d encryption and other optimizations. In: ASIACRYPT (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_8","DOI":"10.1007\/978-3-030-92068-5_8"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: EUROCRYPT (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Seiler, G., Steuer, P.: The LaZer library: lattice-based zero knowledge and succinct proofs for quantum-safe privacy. In: CCS (2024). https:\/\/doi.org\/10.1145\/3658644.3690330","DOI":"10.1145\/3658644.3690330"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster. smaller. In: EUROCRYPT (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"14_CR40","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":"14_CR41","doi-asserted-by":"publisher","unstructured":"Prest, T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: ASIACRYPT (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_13","DOI":"10.1007\/978-3-319-70694-8_13"},{"key":"14_CR42","unstructured":"Prest, T., et al.: FALCON. Technical report (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"Sanders, O.: Improving revocation for group signature with redactable signature. In: PKC (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_12","DOI":"10.1007\/978-3-030-75245-3_12"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Sanders, O.: EPID with efficient proof of non-revocation. In: ASIA CCS (2022). https:\/\/doi.org\/10.1145\/3488932.3517392","DOI":"10.1145\/3488932.3517392"},{"key":"14_CR45","doi-asserted-by":"publisher","unstructured":"Sanders, O., Traor\u00e9, J.: EPID with malicious revocation. In: CT-RSA (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_8","DOI":"10.1007\/978-3-030-75539-3_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25330-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:31:04Z","timestamp":1778085064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}