{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:08:01Z","timestamp":1765933681701,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819987320"},{"type":"electronic","value":"9789819987337"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8733-7_9","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T08:02:20Z","timestamp":1702800140000},"page":"269-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Zero-Knowledge Functional Elementary Databases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2739-7656","authenticated-orcid":false,"given":"Xinxuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5948-0780","authenticated-orcid":false,"given":"Yi","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/978-3-030-64840-4_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Raghuraman, S.: KVaC: key-value commitments for blockchains and beyond. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 839\u2013869. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_28"},{"key":"9_CR2","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":"9_CR3","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":"9_CR4","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":"9_CR5","doi-asserted-by":"publisher","unstructured":"Buchmann, J., Hamdy, S.: A survey on IQ cryptography. In: Alster, K., Urbanowicz, J., Williams, H.C. (eds.) Public-Key Cryptography and Computational Number Theory: Proceedings of the International Conference organized by the Stefan Banach International Mathematical Center Warsaw, Poland, 11\u201315 September 2000, pp. 1\u201316. De Gruyter, Berlin, New York (2001). https:\/\/doi.org\/10.1515\/9783110881035.1","DOI":"10.1515\/9783110881035.1"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-85886-7_32","volume-title":"Information Security","author":"P Camacho","year":"2008","unstructured":"Camacho, P., Hevia, A., Kiwi, M., Opazo, R.: Strong accumulators from collision-resistant hashing. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 471\u2013486. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85886-7_32"},{"key":"9_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":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11681878_7","volume-title":"Theory of Cryptography","author":"D Catalano","year":"2006","unstructured":"Catalano, D., Dodis, Y., Visconti, I.: Mercurial commitments: minimal assumptions and efficient constructions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 120\u2013144. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_7"},{"key":"9_CR10","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":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-78967-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D Catalano","year":"2008","unstructured":"Catalano, D., Fiore, D., Messina, M.: Zero-knowledge sets with short proofs. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 433\u2013450. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_25"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Chase, M., Deshpande, A., Ghosh, E., Malvai, H.: Seemless: secure end-to-end encrypted messaging with less trust. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019m pp. 1639\u20131656. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3319535.3363202","DOI":"10.1145\/3319535.3363202"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11426639_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Chase","year":"2005","unstructured":"Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 422\u2013439. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_25"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-32009-5_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Chase","year":"2012","unstructured":"Chase, M., Visconti, I.: Secure database commitments and universal arguments of quasi knowledge. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 236\u2013254. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_15"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Chen, B., et al.: Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology, ASIACRYPT 2022. LNCS, vol. 13793, pp. 547\u2013580. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_19","DOI":"10.1007\/978-3-031-22969-5_19"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-46035-7_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Generic lower bounds for root extraction and signature schemes in general groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 256\u2013271. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_17"},{"key":"9_CR18","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":"9_CR19","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: cached quotients for fast lookups. Cryptology ePrint Archive, Paper 2022\/1763 (2022). https:\/\/eprint.iacr.org\/2022\/1763"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"E Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16\u201330. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052225"},{"key":"9_CR21","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Paper 2020\/315 (2020)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11787006_4","volume-title":"Automata, Languages and Programming","author":"R Gennaro","year":"2006","unstructured":"Gennaro, R., Micali, S.: Independent zero-knowledge sets. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 34\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_4"},{"key":"9_CR23","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":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-28166-7_8","volume-title":"Applied Cryptography and Network Security","author":"E Ghosh","year":"2015","unstructured":"Ghosh, E., Ohrimenko, O., Tamassia, R.: Zero-knowledge authenticated order queries and order statistics on a list. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 149\u2013171. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_8"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Hu, Y., Hooshmand, K., Kalidhindi, H., Yang, S.J., Popa, R.A.: Merkle$${}^{\\text{2}}$$: a low-latency transparency log system. In: 42nd IEEE Symposium on Security and Privacy, SP 2021, pp. 285\u2013303. IEEE (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00088","DOI":"10.1109\/SP40001.2021.00088"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-90567-5_18","volume-title":"Information Security and Privacy","author":"Y Li","year":"2021","unstructured":"Li, Y., Susilo, W., Yang, G., Phuong, T.V.X., Yu, Y., Liu, D.: Concise mercurial subvector commitments: definitions and\u00a0constructions. In: Baek, J., Ruj, S. (eds.) ACISP 2021. LNCS, vol. 13083, pp. 353\u2013371. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90567-5_18"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-17253-4_9","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"B Libert","year":"2019","unstructured":"Libert, B., Nguyen, K., Tan, B.H.M., Wang, H.: Zero-knowledge elementary databases with more expressive queries. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11442, pp. 255\u2013285. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_9"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11593447_10","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M Liskov","year":"2005","unstructured":"Liskov, M.: Updatable zero-knowledge databases. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 174\u2013198. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_10"},{"key":"9_CR30","unstructured":"Melara, M.S., Blankstein, A., Bonneau, J., Felten, E.W., Freedman, M.J.: CONIKS: bringing key transparency to end users. In: 24th USENIX Security Symposium, USENIX Security 2015, pp. 383\u2013398. USENIX Association, Washington, D.C. (2015)"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, pp. 80\u201391. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238183","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-46497-7_8","volume-title":"Theory of Cryptography","author":"M Naor","year":"2015","unstructured":"Naor, M., Ziv, A.: Primary-secondary-resolver membership proof systems. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 199\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_8"},{"key":"9_CR33","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":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1007\/978-3-540-27836-8_87","volume-title":"Automata, Languages and Programming","author":"R Ostrovsky","year":"2004","unstructured":"Ostrovsky, R., Rackoff, C., Smith, A.: Efficient consistency proofs for generalized queries on a committed database. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1041\u20131053. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_87"},{"key":"9_CR35","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":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-00862-7_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"M Prabhakaran","year":"2009","unstructured":"Prabhakaran, M., Xue, R.: Statistically hiding sets. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 100\u2013116. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_7"},{"key":"9_CR37","unstructured":"Straka, M.: Class groups for cryptographic accumulators (2019). https:\/\/www.michaelstraka.com\/posts\/classgroups\/"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-39658-1_2","volume-title":"Algorithms - ESA 2003","author":"R Tamassia","year":"2003","unstructured":"Tamassia, R.: Authenticated data structures. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 2\u20135. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_2"},{"key":"9_CR39","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.) Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, pp. 1299\u20131316. ACM (2019). https:\/\/doi.org\/10.1145\/3319535.3345652","DOI":"10.1145\/3319535.3345652"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Tzialla, I., Kothapalli, A., Parno, B., Setty, S.T.V.: Transparency dictionaries with succinct proofs of correct operation. In: 29th Annual Network and Distributed System Security Symposium, NDSS 2022. The Internet Society (2022)","DOI":"10.14722\/ndss.2022.23143"},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Xue, R., Li, N., Li, J.: A new construction of zero-knowledge sets secure in Random oracle Model. In: The First International Symposium on Data, Privacy, and E-Commerce, ISDPE 2007, pp. 332\u2013337 (2007). https:\/\/doi.org\/10.1109\/ISDPE.2007.8","DOI":"10.1109\/ISDPE.2007.8"},{"issue":"2","key":"9_CR42","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s11390-008-9119-x","volume":"23","author":"R Xue","year":"2008","unstructured":"Xue, R., Li, N., Li, J.: Algebraic construction for zero-knowledge sets. J. Comput. Sci. Technol. 23(2), 166\u2013175 (2008). https:\/\/doi.org\/10.1007\/s11390-008-9119-x","journal-title":"J. Comput. Sci. Technol."},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: lookup arguments in sublinear time. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 3121\u20133134. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3560646","DOI":"10.1145\/3548606.3560646"},{"key":"9_CR44","unstructured":"Zapico, A., Gabizon, A., Khovratovich, D., Maller, M., R\u00e0fols, C.: Baloo: nearly optimal lookup arguments. Cryptology ePrint Archive, Paper 2022\/1565 (2022). https:\/\/eprint.iacr.org\/2022\/1565"},{"key":"9_CR45","unstructured":"Zhang, X., Deng, Y.: Zero-knowledge functional elementary databases. Cryptology ePrint Archive, Paper 2023\/156 (2023). https:\/\/eprint.iacr.org\/2023\/156"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: An expressive (zero-knowledge) set accumulator. In: 2017 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 158\u2013173 (2017). https:\/\/doi.org\/10.1109\/EuroSP.2017.35","DOI":"10.1109\/EuroSP.2017.35"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Zhu, H.: Mercurial commitments from general RSA moduli and their applications to zero-knowledge databases\/sets. In: 2009 Second International Workshop on Computer Science and Engineering, vol. 2, pp. 289\u2013292 (2009). https:\/\/doi.org\/10.1109\/WCSE.2009.815","DOI":"10.1109\/WCSE.2009.815"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8733-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:03:02Z","timestamp":1765933382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8733-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987320","9789819987337"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8733-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","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":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}