{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:07:47Z","timestamp":1779286067707,"version":"3.51.4"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267368","type":"print"},{"value":"9783032267375","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-26737-5_13","type":"book-chapter","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:17:18Z","timestamp":1779283038000},"page":"404-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lattice-Based Accumulator and\u00a0Application to\u00a0Anonymous Credential Revocation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1887-6396","authenticated-orcid":false,"given":"Victor Youdom","family":"Kemmoe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-3550","authenticated-orcid":false,"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8240-6167","authenticated-orcid":false,"given":"Ngoc Khanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: EUROCRYPT. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Argo, S., et al.: Practical post-quantum signatures for privacy. In: CCS. ACM (2024)","DOI":"10.1145\/3658644.3670297"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Au, M.H., Tsang, P.P., Susilo, W., Mu, Y.: Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems. In: CT-RSA. Springer (2009)","DOI":"10.1007\/978-3-642-00862-7_20"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., et al.: Accumulators with applications to anonymity-preserving revocation. In: EuroS&P. IEEE (2017)","DOI":"10.1109\/EuroSP.2017.13"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: EUROCRYPT. Springer (1997)","DOI":"10.1007\/3-540-69053-0_33"},{"key":"13_CR8","unstructured":"Baum, C., et al.: Cryptographers\u2019 feedback on the EU digital identity\u2019s ARF (2024). https:\/\/github.com\/user-attachments\/files\/15904122\/cryptographers-feedback.pdf"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Benaloh, J., de\u00a0Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: EUROCRYPT. Springer (1993)","DOI":"10.1007\/3-540-48285-7_24"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. In: CCS. ACM (2023)","DOI":"10.1145\/3576915.3616613"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Beullens, W., Seiler, G.: Labrador: Compact proofs for R1CS from module-sis. In: CRYPTO (5). Springer (2023)","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: EUROCRYPT. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. In: CRYPTO (2). Springer (2023)","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Cash, D., Tsabary, R., Wee, H.: Targeted homomorphic attribute-based encryption. In: TCC (B2) (2016)","DOI":"10.1007\/978-3-662-53644-5_13"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Public Key Cryptography. Springer (2009)","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: CRYPTO. Springer (2002)","DOI":"10.1007\/3-540-45708-9_5"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: SCN. Springer (2002)","DOI":"10.1007\/3-540-36413-7_20"},{"key":"13_CR18","unstructured":"Campanelli, M., Hall-Andersen, M., Kamp, S.H.: Curve trees: practical and transparent zero-knowledge accumulators. In: USENIX Security Symposium, pp. 4391\u20134408. USENIX Association (2023)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: EUROCRYPT. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"de\u00a0Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from SIS. In: EUROCRYPT (3). Springer (2023)","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Champion, J., Hsieh, Y.C., Wu, D.J.: Registered ABE and adaptively-secure broadcast encryption from succinct LWE. Cryptology ePrint Archive, Paper 2025\/044 (2025). https:\/\/eprint.iacr.org\/2025\/044","DOI":"10.1007\/978-3-032-01881-6_1"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Ducas, L., Micciancio, D.: Improved short lattice signatures in the standard model. Cryptology ePrint Archive, Paper 2014\/495 (2014). https:\/\/eprint.iacr.org\/2014\/495","DOI":"10.1007\/978-3-662-44371-2_19"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO (1). Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: STOC. ACM (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Jaques, S., Montgomery, H., Lodder, M.: ALLOSAUR: accumulator with low-latency oblivious sublinear anonymous credential updates with revocations. In: AsiaCCS. ACM (2024)","DOI":"10.1145\/3634737.3637641"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols, application to anonymous credentials. In: CRYPTO (2). Springer (2023)","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Karantaidou, I., Baldimtsi, F.: Efficient constructions of pairing based accumulators. In: CSF. IEEE (2021)","DOI":"10.1109\/CSF51468.2021.00033"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Katsumata, S.: A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure nizks. In: CRYPTO (2). Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_20"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Kemmoe, V.Y., Lysyanskaya, A.: RSA-based dynamic accumulator without hashing into primes. In: CCS. ACM (2024)","DOI":"10.1145\/3658644.3690199"},{"key":"13_CR31","unstructured":"Kemmoe, V.Y., Lysyanskaya, A., Nguyen, N.K.: Lattice-based accumulator and application to anonymous credential revocation. Cryptology ePrint Archive, Paper 2025\/1099 (2025). https:\/\/eprint.iacr.org\/2025\/1099"},{"key":"13_CR32","unstructured":"Lai, Q., Chen, C., Liu, F.H., Lysyanskaya, A., Wang, Z.: Lattice-based commit-transferrable signatures and applications to anonymous credentials. Cryptology ePrint Archive, Paper 2023\/766 (2023). https:\/\/eprint.iacr.org\/2023\/766"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3) (2015)","DOI":"10.1007\/s10623-014-9938-4"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: ACNS. Springer (2007)","DOI":"10.1007\/978-3-540-72738-5_17"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In: ASIACRYPT (2) (2016)","DOI":"10.1007\/978-3-662-53890-6_13"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. J. Cryptol. 36(3) (2023)","DOI":"10.1007\/s00145-023-09470-6"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: CRYPTO (2). Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M., Seiler, G.: Shorter lattice-based group signatures via \"almost free\" encryption and other optimizations. In: ASIACRYPT (4). Springer (2021)","DOI":"10.1007\/978-3-030-92068-5_8"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: EUROCRYPT. Springer (2013)","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Seiler, G., Steuer, P.: The Lazer library: lattice-based zero knowledge and succinct proofs for quantum-safe privacy. In: CCS. ACM (2024)","DOI":"10.1145\/3658644.3690330"},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: EUROCRYPT. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"13_CR42","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1) (2007)","DOI":"10.1137\/S0097539705447360"},{"key":"13_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03983-0_1","volume-title":"Algebraic Integers","author":"J Neukirch","year":"1999","unstructured":"Neukirch, J.: Algebraic Integers. Springer, Berlin Heidelberg (1999)"},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: CT-RSA. Springer (2005)","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: EUROCRYPT. Springer (2013)","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"13_CR46","doi-asserted-by":"crossref","unstructured":"Peikert, C., Pepin, Z., Sharp, C.: Vector and functional commitments from lattices. In: TCC (3). Springer (2021)","DOI":"10.1007\/978-3-030-90456-2_16"},{"key":"13_CR47","doi-asserted-by":"crossref","unstructured":"del Pino, R., Katsumata, S.: A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling. In: CRYPTO (2). Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_11"},{"key":"13_CR48","doi-asserted-by":"crossref","unstructured":"Reyzin, L., Yakoubov, S.: Efficient asynchronous accumulators for distributed PKI. In: SCN, pp. 292\u2013309. Springer (2016)","DOI":"10.1007\/978-3-319-44618-9_16"},{"key":"13_CR49","doi-asserted-by":"crossref","unstructured":"Stern, J.: A new paradigm for public key identification. IEEE Trans. Inf. Theory 42(6) (1996)","DOI":"10.1109\/18.556672"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Wee, H.: Circuit ABE with poly (depth, $$\\lambda $$)-sized ciphertexts and keys from lattices. In: CRYPTO (3). Springer (2024)","DOI":"10.1007\/978-3-031-68382-4_6"},{"key":"13_CR51","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: fast verification and cryptanalysis. In: ASIACRYPT (5), pp. 201\u2013235. Springer (2023)","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"13_CR52","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: EUROCRYPT (3). Springer (2023)","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"Yu, Z., Au, M.H., Yang, R., Lai, J., Xu, Q.: Lattice-based universal accumulator with nonmembership arguments. In: ACISP. Springer (2018)","DOI":"10.1007\/978-3-319-93638-3_29"},{"key":"13_CR54","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Yang, S., Huang, X.: Lattice-based dynamic universal accumulator: design and application. Comput Stand. Interfaces 89 (2024)","DOI":"10.1016\/j.csi.2023.103807"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26737-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:17:29Z","timestamp":1779283049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26737-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267368","9783032267375"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26737-5_13","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":"21 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}