{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:48:25Z","timestamp":1765370905351,"version":"3.46.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"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-13301-4_7","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:32Z","timestamp":1765357952000},"page":"145-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["COMPASS: A Compact PASS-Lineage Accumulator with\u00a0Succinct Proofs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0505-1269","authenticated-orcid":false,"given":"Tao-Hsiang","family":"Chang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7412-3870","authenticated-orcid":false,"given":"Jen-Chieh","family":"Hsu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7206-3056","authenticated-orcid":false,"given":"Hao-Yi","family":"Hsu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1485-0164","authenticated-orcid":false,"given":"Raylin","family":"Tso","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3462-0699","authenticated-orcid":false,"given":"Masahiro","family":"Mambo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-00862-7_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"MH Au","year":"2009","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: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 295\u2013308. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_20"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201997","author":"N Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) Advances in Cryptology \u2013 EUROCRYPT \u201997, pp. 480\u2013494. Springer, Berlin Heidelberg, Berlin, Heidelberg (1997)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201993","author":"J Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) Advances in Cryptology \u2013 EUROCRYPT \u201993, pp. 274\u2013285. Springer, Berlin Heidelberg, Berlin, Heidelberg (1994)"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970). https:\/\/doi.org\/10.1145\/362686.362692","DOI":"10.1145\/362686.362692"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Gachon, E., Pellet-Mary, A.: Some easy instances of ideal-SVP and implications on the partial vandermonde knapsack problem. In: Advances in Cryptology - CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part II, pp. 480\u2013509. Springer-Verlag, Berlin, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_17","DOI":"10.1007\/978-3-031-15979-4_17"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 481\u2013500. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_27"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-031-58754-2_8","volume-title":"Advances in Cryptology - EUROCRYPT 2024","author":"D Das","year":"2024","unstructured":"Das, D., Joux, A.: Key recovery attack on the partial vandermonde knapsack problem. In: Joye, M., Leander, G. (eds.) Advances in Cryptology - EUROCRYPT 2024, pp. 205\u2013225. Springer Nature Switzerland, Cham (2024)"},{"key":"7_CR9","unstructured":"Dor\u00f6z, Y., Hoffstein, J., Silverman, J.H., Sunar, B.: MMSAT: a scheme for multimessage multiuser signature aggregation. Cryptology ePrint Archive, Paper 2020\/520 (2020). https:\/\/eprint.iacr.org\/2020\/520"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Grafakos, L.: Classical fourier analysis, graduate texts in mathematics, vol. 249. Springer, New York, 3 edn. (2014). https:\/\/doi.org\/10.1007\/978-1-4939-1194-3","DOI":"10.1007\/978-1-4939-1194-3"},{"key":"7_CR11","unstructured":"Hoffstein, J., Lieman, D., Silverman, J.H.: Polynomial rings and efficient public key authentication. In: Blum, M., Lee, C.H. (eds.) Proceedings of the International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC \u201999). City University of Hong Kong Press, Hong Kong (1999)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-319-07536-5_28","volume-title":"Applied Cryptography and Network Security","author":"J Hoffstein","year":"2014","unstructured":"Hoffstein, J., Pipher, J., Schanck, J.M., Silverman, J.H., Whyte, W.: Practical signatures from the partial fourier recovery problem. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) Applied Cryptography and Network Security, pp. 476\u2013493. Springer International Publishing, Cham (2014)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-0348-8295-8_20","volume-title":"Cryptography and Computational Number Theory","author":"J Hoffstein","year":"2001","unstructured":"Hoffstein, J., Silverman, J.H.: Polynomial rings and efficient public key authentication ii. In: Lam, K.Y., Shparlinski, I., Wang, H., Xing, C. (eds.) Cryptography and Computational Number Theory, pp. 269\u2013286. Birkh\u00e4user Basel, Basel (2001)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-24126-5_20","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"MP Jhanwar","year":"2015","unstructured":"Jhanwar, M.P., Safavi-Naini, R.: Compact accumulator using lattices. In: Chakraborty, R.S., Schwabe, P., Solworth, J. (eds.) Security, Privacy, and Applied Cryptography Engineering, pp. 347\u2013358. Springer International Publishing, Cham (2015)"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Jiang, W., Li, J., Guo, Y., Zhang, H.: An ordered universal accumulator based on a hash chain. Applied Sciences 15(5) (2025). https:\/\/doi.org\/10.3390\/app15052565, https:\/\/www.mdpi.com\/2076-3417\/15\/5\/2565","DOI":"10.3390\/app15052565"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Kemmoe, V.Y., Lysyanskaya, A.: RSA-based dynamic accumulator without hashing into primes. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4271\u20134285. CCS \u201924, Association for Computing Machinery, New York, NY, USA (2024). https:\/\/doi.org\/10.1145\/3658644.3690199, https:\/\/doi.org\/10.1145\/3658644.3690199","DOI":"10.1145\/3658644.3690199"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-72738-5_17","volume-title":"Applied Cryptography and Network Security","author":"J Li","year":"2007","unstructured":"Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: Katz, J., Yung, M. (eds.) Applied Cryptography and Network Security, pp. 253\u2013269. Springer, Berlin Heidelberg, Berlin, Heidelberg (2007)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-319-96881-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"B Libert","year":"2018","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Lattice-Based Zero-Knowledge Arguments for Integer Relations. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 700\u2013732. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_24"},{"key":"7_CR19","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s00145-023-09470-6, https:\/\/doi.org\/10.1007\/s00145-023-09470-6","DOI":"10.1007\/s00145-023-09470-6"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/978-3-319-93638-3_50","volume-title":"Information Security and Privacy","author":"X Lu","year":"2018","unstructured":"Lu, X., Zhang, Z., Au, M.H.: Practical signatures from the partial fourier recovery problem revisited: A provably-secure and gaussian-distributed construction. In: Susilo, W., Yang, G. (eds.) Information Security and Privacy, pp. 813\u2013820. Springer International Publishing, Cham (2018)"},{"key":"7_CR21","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":"7_CR22","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":"7_CR23","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-031-33017-9_14","volume-title":"Codes, Cryptology and Information Security","author":"Y Maeno","year":"2023","unstructured":"Maeno, Y., Miyaji, H., Miyaji, A.: Lattice-based accumulator with constant time list update and constant time verification. In: El Hajji, S., Mesnager, S., Souidi, E.M. (eds.) Codes, Cryptology and Information Security, pp. 204\u2013222. Springer Nature Switzerland, Cham (2023)"},{"key":"7_CR24","unstructured":"Mazzocca, C., Acar, A., Uluagac, S., Montanari, R.: EVOKE: efficient revocation of verifiable credentials in IoT networks. In: 33rd USENIX Security Symposium (USENIX Security 24), pp. 1279\u20131295. USENIX Association, Philadelphia, PA (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/mazzocca"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) Advances in Cryptology \u2013 CRYPTO\u2019 89 Proceedings, pp. 218\u2013238. Springer, New York, New York, NY (1990)"},{"key":"7_CR26","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":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/s00453-014-9968-3","volume":"74","author":"C Papamanthou","year":"2016","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Authenticated hash tables based on cryptographic accumulators. Algorithmica 74(2), 664\u2013712 (2016)","journal-title":"Algorithmica"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Sitouah, N., Bruschi, F., Pallotta, F.L., Mencucci, R., Sciuto, D.: An untraceable credential revocation approach based on a novel merkle tree accumulator. In: 2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), pp. 210\u2013214 (2024). https:\/\/doi.org\/10.1109\/ICBC59979.2024.10634387","DOI":"10.1109\/ICBC59979.2024.10634387"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-22263-4_14","volume-title":"Privacy Enhancing Technologies","author":"A Sudarsono","year":"2011","unstructured":"Sudarsono, A., Nakanishi, T., Funabiki, N.: Efficient proofs of attributes in pairing-based anonymous credential system. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) Privacy Enhancing Technologies, pp. 246\u2013263. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: High-dimensional probability: an introduction with applications in data science. Cambridge Series in Statistical and Probabilistic Mathematics, Cambridge University Press (2018)","DOI":"10.1017\/9781108231596"},{"issue":"12","key":"7_CR32","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1109\/JAS.2023.123402","volume":"10","author":"D Yue","year":"2023","unstructured":"Yue, D., Baldi, S., Cao, J., Li, Q., De Schutter, B.: Distributed adaptive resource allocation: an uncertain saddle-point dynamics viewpoint. IEEE\/CAA J. Autom. Sinica 10(12), 2209\u20132221 (2023). https:\/\/doi.org\/10.1109\/JAS.2023.123402","journal-title":"IEEE\/CAA J. Autom. Sinica"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Zhao, Y., Yang, S., Huang, X.: Lattice-based dynamic universal accumulator: design and application. Comput. Stand. Int. 89, 103807 (2024). https:\/\/doi.org\/10.1016\/j.csi.2023.103807, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0920548923000880","DOI":"10.1016\/j.csi.2023.103807"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:36Z","timestamp":1765357956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneshwar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}