{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:57:59Z","timestamp":1743137879837,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710698"},{"type":"electronic","value":"9783031710704"}],"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-71070-4_8","type":"book-chapter","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:41Z","timestamp":1725897761000},"page":"161-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal Vector Commitments"],"prefix":"10.1007","author":[{"given":"Ojaswi","family":"Acharya","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3296-5336","authenticated-orcid":false,"given":"Foteini","family":"Baldimtsi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6490-1786","authenticated-orcid":false,"given":"Samuel Dov","family":"Gordon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0553-4844","authenticated-orcid":false,"given":"Daniel","family":"McVicker","sequence":"additional","affiliation":[]},{"given":"Aayush","family":"Yadav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"8_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, Part III. LNCS, vol. 12493, pp. 839\u2013869. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_28"},{"key":"8_CR2","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, Part I. LNCS, vol. 11692, pp. 561\u2013586. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_20"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., et al.: Accumulators with applications to anonymity-preserving revocation. In: 2017 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 301\u2013315 (2017)","DOI":"10.1109\/EuroSP.2017.13"},{"key":"8_CR4","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":"8_CR5","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":"8_CR6","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":"8_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":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-031-30620-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"L de Castro","year":"2023","unstructured":"de Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from sis. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 287\u2013320. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_10"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-47560-8_13","volume-title":"Secure IT Systems","author":"R Dahlberg","year":"2016","unstructured":"Dahlberg, R., Pulls, T., Peeters, R.: Efficient sparse Merkle trees. In: Brumley, B.B., R\u00f6ning, J. (eds.) NordSec 2016. LNCS, vol. 10014, pp. 199\u2013215. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47560-8_13"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-030-17656-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Fisch","year":"2019","unstructured":"Fisch, B.: Tight proofs of space and replication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 324\u2013348. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_12"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-981-99-8733-7_6","volume-title":"Advances in Cryptology - ASIACRYPT 2023","author":"D Fiore","year":"2023","unstructured":"Fiore, D., Kolonelos, D., Perthuis, P.D.: Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14442, pp. 166\u2013200. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_6"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-030-56784-2_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"R Goyal","year":"2020","unstructured":"Goyal, R., Vusirikala, S.: Verifiable registration-based encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 621\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_21"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Juels, A., Kaliski Jr., B.S.: Pors: proofs of retrievability for large files. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, Alexandria, Virginia, USA, pp. 584\u2013597. ACM Press (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"8_CR14","unstructured":"Konstantopoulos, G.: Plasma cash: towards more efficient plasma constructions (2019)"},{"key":"8_CR15","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":"8_CR16","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":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-61204-1_15","volume-title":"Applied Cryptography and Network Security","author":"S Ling","year":"2017","unstructured":"Ling, S., Nguyen, K., Wang, H., Xu, Y.: Lattice-based group signatures: achieving full dynamicity with ease. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 293\u2013312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_15"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"FF Rodler","year":"2004","unstructured":"Rodler, F.F., Pagh, R.: Cuckoo hashing. J. Algorithms 51, 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"8_CR19","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":"8_CR20","doi-asserted-by":"crossref","unstructured":"Schumm, D., Mukta, R., Paik, H.: Efficient credential revocation using cryptographic accumulators. In: 2023 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS), pp. 127\u2013134 (2023)","DOI":"10.1109\/DAPPS57946.2023.00025"},{"key":"8_CR21","doi-asserted-by":"crossref","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, London, UK, 11\u201315 November 2019, pp. 1299\u20131316. ACM (2019)","DOI":"10.1145\/3319535.3345652"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-93638-3_29","volume-title":"Information Security and Privacy","author":"Z Yu","year":"2018","unstructured":"Yu, Z., Au, M.H., Yang, R., Lai, J., Xu, Q.: Lattice-based universal accumulator with nonmembership arguments. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 502\u2013519. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_29"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-031-38551-3_7","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"K Yeo","year":"2023","unstructured":"Yeo, K.: Cuckoo hashing in cryptography: optimal parameters, robustness and applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084, pp. 197\u2013230. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_7"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: An expressive (zero-knowledge) set accumulator. In: 2017 IEEE European Symposium on Security and Privacy, EuroS &P 2017, Paris, France, 26\u201328 April 2017, pp. 158\u2013173. IEEE (2017)","DOI":"10.1109\/EuroSP.2017.35"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71070-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:04:16Z","timestamp":1725897856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71070-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710698","9783031710704"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71070-4_8","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":"10 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}