{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:22Z","timestamp":1784638882754,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325594","type":"print"},{"value":"9783032325600","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32560-0_5","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:06:31Z","timestamp":1784635591000},"page":"131-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Post Quantum Vector Commitment Scheme with\u00a0Efficient Insertions and\u00a0Deletions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4597-514X","authenticated-orcid":false,"given":"Vir","family":"Pathak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-6709","authenticated-orcid":false,"given":"Sushmita","family":"Ruj","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W., Malavolta, G., Thyagarajan, S.A.: Lattice based snarks: publicly verifiable, preprocessing, and recursively composable. In: Annual International Cryptology Conference, pp. 102\u2013132. Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Lai, R.W.F., Lapiha, O., Woo, I.K.Y.: Partial lattice trapdoors: how to split lattice trapdoors, literally. In: Hanaoka, G., Yang, B. (eds.) Advances in Cryptology - ASIACRYPT 2025, Part III. LNCS, vol. 16247, pp. 265\u2013296. Springer (2025). https:\/\/doi.org\/10.1007\/978-981-95-5099-9_9","DOI":"10.1007\/978-981-95-5099-9_9"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-64834-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Campanelli","year":"2020","unstructured":"Campanelli, M., Fiore, D., Greco, N., Kolonelos, D., Nizzardo, L.: Incrementally aggregatable vector commitments and applications to verifiable decentralized storage. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 3\u201335. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_1"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Nitulescu, A., R\u00e0fols, C., Zacharakis, A., Zapico, A.: Linear-map vector commitments and their practical applications. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 189\u2013219. Springer (2022)","DOI":"10.1007\/978-3-031-22972-5_7"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"de\u00a0Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from sis. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 287\u2013320. Springer (2023)","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"5_CR7","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_CR8","unstructured":"Chepurnoy, A., Papamanthou, C., Srinivasan, S., Zhang, Y.: Edrax: a cryptocurrency with stateless transaction validation. Cryptology ePrint Archive (2018)"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Erway, C.C., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. ACM Trans. Inf. Syst. Secur. 17(4), 15:1\u201315:29 (2015). https:\/\/doi.org\/10.1145\/2699909","DOI":"10.1145\/2699909"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: Pointproofs: aggregating proofs for multiple vector commitments. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 2007\u20132023 (2020)","DOI":"10.1145\/3372297.3417244"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-26948-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"RWF Lai","year":"2019","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 530\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_19"},{"key":"5_CR14","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":"5_CR15","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20\u201322 November 1994, pp. 436\u2013453. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 700\u2013718. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"5_CR17","unstructured":"Nitulescu, A.: SoK: vector commitments. https:\/\/www.di.ens.fr\/~nitulesc\/files\/vc-sok.pdf"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Theory of Cryptography Conference, pp. 222\u2013242. Springer (2013)","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"5_CR19","unstructured":"Pathak, V.N., Ruj, S., van\u00a0der Meyden, R.: Vector commitment design, analysis, and applications: a survey. ACM Comput. Surv. (2026, to appear). https:\/\/eprint.iacr.org\/2025\/667"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Sengupta, B., Ruj, S.: Publicly verifiable secure cloud storage for dynamic data using secure network coding. In: Chen, X., Wang, X., Huang, X. (eds.) Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2016, Xi\u2019an, China, May 30 - June 3, 2016, pp. 107\u2013118. ACM (2016). https:\/\/doi.org\/10.1145\/2897845.2897915","DOI":"10.1145\/2897845.2897915"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Sengupta, B., Ruj, S.: Efficient proofs of retrievability with public verifiability for dynamic cloud storage. IEEE Trans. Cloud Comput. 8(1), 138\u2013151 (2020). https:\/\/doi.org\/10.1109\/TCC.2017.2767584","DOI":"10.1109\/TCC.2017.2767584"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: Sadeghi, A., Gligor, V.D., Yung, M. (eds.) 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS\u201913, Berlin, Germany, 4\u20138 November 2013, pp. 325\u2013336. ACM (2013). https:\/\/doi.org\/10.1145\/2508859.2516669","DOI":"10.1145\/2508859.2516669"},{"key":"5_CR23","unstructured":"Srinivasan, S., Chepurnoy, A., Papamanthou, C., Tomescu, A., Zhang, Y.: Hyperproofs: aggregating and maintaining proofs in vector commitments. In: 31st USENIX Security Symposium (USENIX Security 2022), pp. 3001\u20133018 (2022)"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Tas, E.N., Boneh, D.: Vector commitments with efficient updates. In: Bonneau, J., Weinberg, S.M. (eds.) 5th Conference on Advances in Financial Technologies, AFT 2023, Princeton, NJ, USA, 23\u201325 October 2023. LIPIcs, vol.\u00a0282, pp. 29:1\u201329:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.AFT.2023.29","DOI":"10.4230\/LIPICS.AFT.2023.29"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Tomescu, A., Abraham, I., Buterin, V., Drake, J., Feist, D., Khovratovich, D.: Aggregatable subvector commitments for stateless cryptocurrencies. In: International Conference on Security and Cryptography for Networks, pp. 45\u201364. Springer (2020)","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: fast verification and cryptanalysis. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 201\u2013235. Springer (2023)","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 385\u2013416. Springer (2023)","DOI":"10.1007\/978-3-031-30620-4_13"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32560-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:06:36Z","timestamp":1784635596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"22 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","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":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}