{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:18:18Z","timestamp":1743009498000,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643804"},{"type":"electronic","value":"9783031643811"}],"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-64381-1_5","type":"book-chapter","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:01:56Z","timestamp":1719961316000},"page":"94-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cryptographic Accumulators: New Definitions, Enhanced Security, and\u00a0Delegatable Proofs"],"prefix":"10.1007","author":[{"given":"Ana\u00efs","family":"Barthoulot","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Blazy","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Canard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"5_CR1","unstructured":"Acar, T., Nguyen, L.: Revocation for delegatable anonymous credentials. Technical Repost MSR-TR-2010-170, Microsoft Research (2010)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-19379-8_26","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"T Acar","year":"2011","unstructured":"Acar, T., Nguyen, L.: Revocation for delegatable anonymous credentials. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 423\u2013440. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_26"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-36178-2_27","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"T Asano","year":"2002","unstructured":"Asano, T.: A revocation scheme with minimal storage at receivers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 433\u2013450. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_27"},{"key":"5_CR4","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":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11967668_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"MH Au","year":"2006","unstructured":"Au, M.H., Wu, Q., Susilo, W., Mu, Y.: Compact E-cash from bounded accumulator. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 178\u2013195. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11967668_12"},{"issue":"12","key":"5_CR6","doi-asserted-by":"publisher","first-page":"2861","DOI":"10.1007\/s10623-022-01007-5","volume":"90","author":"EB Ayebie","year":"2022","unstructured":"Ayebie, E.B., Souidi, E.M.: New code-based cryptographic accumulator and fully dynamic group signature. DCC 90(12), 2861\u20132891 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01007-5","journal-title":"DCC"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., et al.: Accumulators with applications to anonymity-preserving revocation. Cryptology ePrint Archive, Paper 2017\/043 (2017). https:\/\/eprint.iacr.org\/2017\/043","DOI":"10.1109\/EuroSP.2017.13"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Baldimtsi, F., et al.: Accumulators with applications to anonymity-preserving revocation, pp. 301\u2013315 (2017). https:\/\/doi.org\/10.1109\/EuroSP.2017.13","DOI":"10.1109\/EuroSP.2017.13"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-030-40186-3_27","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"F Badimtsi","year":"2020","unstructured":"Badimtsi, F., Canetti, R., Yakoubov, S.: Universally composable accumulators. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 638\u2013666. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_27"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-031-57722-2_4","volume-title":"Public-Key Cryptography - PKC 2024","author":"F Baldimtsi","year":"2024","unstructured":"Baldimtsi, F., Karantaidou, I., Raghuraman, S.: Oblivious accumulators. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14602, pp. 99\u2013131. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_4"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2014 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.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480\u2013494. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_33"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Barthoulot, A., Blazy, O., Canard, S.: Dually computable cryptographic accumulators and their application to attribute based encryption. Cryptology ePrint Archive, Paper 2023\/1277 (2023). https:\/\/eprint.iacr.org\/2023\/1277","DOI":"10.1007\/978-981-99-7563-1_24"},{"key":"5_CR13","unstructured":"Barthoulot, A., Blazy, O., Canard, S.: Locally verifiable signatures and cryptographic accumulators: different names, same thing? (2023)"},{"key":"5_CR14","unstructured":"Barthoulot, A., Blazy, O., Canard, S.: Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs. Cryptology ePrint Archive, Paper 2024\/657 (2024). https:\/\/eprint.iacr.org\/2024\/657"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2014 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.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_24"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-030-26948-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 561\u2013586. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_20"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.3233\/JCS-2002-10304","volume":"10","author":"A Buldas","year":"2002","unstructured":"Buldas, A., Laud, P., Lipmaa, H.: Eliminating counterevidence with applications to accountable certificate management. J. Comput. Secur. 10, 273\u2013296 (2002). https:\/\/doi.org\/10.3233\/JCS-2002-10304","journal-title":"J. Comput. Secur."},{"key":"5_CR18","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":"5_CR19","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":"5_CR20","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Han, S., Kim, J., Kolonelos, D., Oh, H.: Succinct zero-knowledge batch proofs for set accumulators. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 455\u2013469. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560677","DOI":"10.1145\/3548606.3560677"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-14577-3_9","volume-title":"Financial Cryptography and Data Security","author":"S Canard","year":"2010","unstructured":"Canard, S., Gouget, A.: Multiple denominations in E-cash with compact transaction data. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 82\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_9"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-36334-4_8","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"J Chen","year":"2013","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., Wee, H.: Shorter IBE and signatures via asymmetric pairings. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 122\u2013140. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_8"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-92078-4_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Lipmaa, H., Parisella, R., \u00d8degaard, A.T.: Efficient NIZKs for\u00a0algebraic sets. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 128\u2013158. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_5"},{"key":"5_CR25","unstructured":"Damgard, I., Triandopoulos, N.: Supporting non-membership proofs with bilinear-map accumulators. Cryptology ePrint Archive, Report 2008\/538 (2008). http:\/\/eprint.iacr.org\/2008\/538"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-16715-2_7","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"D Derler","year":"2015","unstructured":"Derler, D., Hanser, C., Slamanig, D.: Revisiting cryptographic accumulators, additional properties and relations to other primitives. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 127\u2013144. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_7"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-540-24676-3_36","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous identification in ad hoc groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609\u2013626. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_36"},{"key":"5_CR28","unstructured":"Fazio, N., Nicolosi, A.: Cryptographic accumulators: definitions, constructions and applications (2002)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-30144-8_7","volume-title":"Information Security","author":"C Gentry","year":"2004","unstructured":"Gentry, C., Ramzan, Z.: RSA accumulator based broadcast encryption. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 73\u201386. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30144-8_7"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-662-53890-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"E Ghosh","year":"2016","unstructured":"Ghosh, E., Ohrimenko, O., Papadopoulos, D., Tamassia, R., Triandopoulos, N.: Zero-knowledge accumulators and set algebra. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 67\u2013100. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_3"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Jia, H., Chen, Y., Lan, J., Huang, K., Wang, J.: Efficient revocable hierarchical identity-based encryption using cryptographic accumulators. Int. J. Inf. Secur. (2018)","DOI":"10.1007\/s10207-017-0387-8"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Lewko, A.B., Waters, B.: Unbounded HIBE and attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 547\u2013567. Springer, Heidelberg (May 2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_30","DOI":"10.1007\/978-3-642-20465-4_30"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-72738-5_24","volume-title":"Applied Cryptography and Network Security","author":"F Li","year":"2007","unstructured":"Li, F., Hu, Y., Zhang, C.: An identity-based signcryption scheme for multi-domain ad hoc networks. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 373\u2013384. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72738-5_24"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","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.) ACNS 2007. LNCS, vol. 4521, pp. 253\u2013269. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72738-5_17"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49896-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Libert","year":"2016","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. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 1\u201331. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1"},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016. LIPIcs, vol.\u00a055, pp. 30:1\u201330:14. Schloss Dagstuhl (Jul 2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.30","DOI":"10.4230\/LIPIcs.ICALP.2016.30"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-31284-7_14","volume-title":"Applied Cryptography and Network Security","author":"H Lipmaa","year":"2012","unstructured":"Lipmaa, H.: Secure accumulators from Euclidean rings without trusted setup. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol. 7341, pp. 224\u2013240. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31284-7_14"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-662-45472-5_14","volume-title":"Financial Cryptography and Data Security","author":"P Fauzi","year":"2014","unstructured":"Fauzi, P., Lipmaa, H., Zhang, B.: Efficient non-interactive zero knowledge arguments for set operations. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 216\u2013233. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_14"},{"key":"5_CR40","unstructured":"Lipmaa, H., Parisella, R.: Set (non-)membership NIZKs from determinantal accumulators. Cryptology ePrint Archive, Paper 2022\/1570 (2022). https:\/\/eprint.iacr.org\/2022\/1570"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","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.) SPACE 2015. LNCS, vol. 9354, pp. 347\u2013358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24126-5_20"},{"key":"5_CR42","unstructured":"de\u00a0Meer, H., Liedel, M., Pohls, H.C., Posegga, J.: Indistinguishability of one-way accumulators. Technical report MIP-1210, Faculty of Computer Science and Mathematics (FIM), University of Passau (2012)"},{"key":"5_CR43","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-662-44791-8_10","volume-title":"E-Business and Telecommunications","author":"H de Meer","year":"2014","unstructured":"de Meer, H., P\u00f6hls, H.C., Posegga, J., Samelin, K.: Redactable signature schemes for trees with signer-controlled non-leaf-redactions. In: Obaidat, M.S., Filipe, J. (eds.) ICETE 2012. CCIS, vol. 455, pp. 155\u2013171. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44791-8_10"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-030-34621-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"K Nguyen","year":"2019","unstructured":"Nguyen, K., Tang, H., Wang, H., Zeng, N.: New code-based privacy-preserving cryptographic constructions. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part II. LNCS, vol. 11922, pp. 25\u201355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_2"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-10366-7_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"T Okamoto","year":"2009","unstructured":"Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 214\u2013231. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_13"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-38348-9_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 353\u2013370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_22"},{"key":"5_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-22792-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"C Papamanthou","year":"2011","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal verification of operations on dynamic sets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 91\u2013110. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_6"},{"key":"5_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/5429195","volume":"2022","author":"Y Ren","year":"2022","unstructured":"Ren, Y., Liu, X., Wu, Q., Wang, L., Zhang, W.: Cryptographic accumulator and its application: a survey. Secur. Commun. Netw. 2022, 1\u201313 (2022). https:\/\/doi.org\/10.1155\/2022\/5429195","journal-title":"Secur. Commun. Netw."},{"key":"5_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-44618-9_16","volume-title":"Security and Cryptography for Networks","author":"L Reyzin","year":"2016","unstructured":"Reyzin, L., Yakoubov, S.: Efficient asynchronous accumulators for distributed PKI. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 292\u2013309. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_16"},{"key":"5_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-44618-9_16","volume-title":"Security and Cryptography for Networks","author":"L Reyzin","year":"2016","unstructured":"Reyzin, L., Yakoubov, S.: Efficient asynchronous accumulators for distributed PKI. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 292\u2013309. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_16"},{"key":"5_CR53","doi-asserted-by":"publisher","unstructured":"Tomescu, A., Bhupatiraju, V., Papadopoulos, D., Papamanthou, C., Triandopoulos, N., Devadas, S.: Transparency logs via append-only authenticated dictionaries. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 1299\u20131316. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3345652","DOI":"10.1145\/3319535.3345652"},{"key":"5_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-40061-5_16","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"G Tsudik","year":"2003","unstructured":"Tsudik, G., Xu, S.: Accumulating composites and improved group signing. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 269\u2013286. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_16"},{"key":"5_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-77048-0_8","volume-title":"Information and Communications Security","author":"P Wang","year":"2007","unstructured":"Wang, P., Wang, H., Pieprzyk, J.: A new dynamic accumulator for batch updates. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 98\u2013112. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77048-0_8"},{"key":"5_CR56","doi-asserted-by":"publisher","unstructured":"Wang, X., Chow, S.S.M.: Cross-domain access control encryption: arbitrary-policy, constant-size, efficient. In: 2021 IEEE Symposium on Security and Privacy, pp. 748\u2013761. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00023","DOI":"10.1109\/SP40001.2021.00023"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64381-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:02:59Z","timestamp":1719961379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64381-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643804","9783031643811"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64381-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Douala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cameroon","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":"10 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}