{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,6]],"date-time":"2026-09-06T16:51:09Z","timestamp":1788713469967,"version":"build-2803163510"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030904555","type":"print"},{"value":"9783030904562","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90456-2_16","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T12:02:37Z","timestamp":1636027357000},"page":"480-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Vector and Functional Commitments from Lattices"],"prefix":"10.1007","author":[{"given":"Chris","family":"Peikert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zachary","family":"Pepin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chad","family":"Sharp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: EUROCRYPT, pp. 553\u2013572 (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Freeman, D.M., Vaikuntanathan, V.: Functional encryption for inner product predicates from learning with errors. In: ASIACRYPT (2011)","DOI":"10.1007\/978-3-642-25385-0_2"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: CRYPTO, pp. 297\u2013314 (2014)","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: IEEE Symposium on Security and Privacy, pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"16_CR5","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: Recursive zk-SNARKs from any additive polynomial commitment scheme. Cryptology ePrint Archive, Report 2020\/1536 (2020). https:\/\/eprint.iacr.org\/2020\/1536"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., de Mare, M.: One-way accumulators: a decentralized alternative to digital sinatures (extended abstract). In: EUROCRYPT, vol. 765, pp. 274\u2013285 (1993)","DOI":"10.1007\/3-540-48285-7_24"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: EUROCRYPT, pp. 677\u2013706 (2020)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Sahai, A.: Verifiable functional encryption. In: ASIACRYPT, pp. 557\u2013587 (2016)","DOI":"10.1007\/978-3-662-53890-6_19"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: CRYPTO, pp. 111\u2013131 (2011)","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: ITCS, pp. 1\u201312 (2014)","DOI":"10.1145\/2554797.2554799"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: STOC, pp. 1082\u20131090 (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: PKC, pp. 55\u201372 (2013)","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Greco, N., Kolonelos, D., Nizzardo, L.: Incrementally aggregatable vector commitments and applications to verifiable decentralized storage. In: ASIACRYPT, pp. 3\u201335 (2020)","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25(4), 601\u2013639 (2012). Preliminary version in Eurocrypt 2010","DOI":"10.1007\/s00145-011-9105-2"},{"key":"16_CR16","unstructured":"Chepurnoy, A., Papamanthou, C., Srinivasan, S., Zhang, Y.: EDRAX: a cryptocurrency with stateless transaction validation. Cryptology ePrint Archive, Report 2018\/968 (2018). https:\/\/eprint.iacr.org\/2018\/968"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Catalano, D., Raimondo, M.D., Fiore, D., Messina, M.: Zero-knowledge sets with short proofs. IEEE Trans. Inf. Theory 57(4), 2488\u20132502 (2011). Preliminary version in EUROCRYPT 2008","DOI":"10.1109\/TIT.2011.2112150"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-48658-5_23","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"C Dwork","year":"1994","unstructured":"Dwork, C., Naor, M.: An Efficient Existentially Unforgeable Signature Scheme and its Applications. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 234\u2013246. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_23"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO, pp. 75\u201392 (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: STOC, pp. 469\u2013477 (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC, pp. 99\u2013108 (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Hub\u00e1cek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: ITCS, pp. 163\u2013172 (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: STOC, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"16_CR25","unstructured":"Kuszmaul, J.: Verkle trees (2018). Unpublished manuscript, available at https:\/\/math.mit.edu\/research\/highschool\/primes\/materials\/2018\/Kuszmaul.pdf"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: ASIACRYPT, pp. 177\u2013194 (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Liskov, M.D.: Updatable zero-knowledge databases. In: ASIACRYPT, pp. 174\u2013198 (2005)","DOI":"10.1007\/11593447_10"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: CRYPTO, pp. 530\u2013560 (2019)","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Lipmaa, H., Pavlyk, K.: Succinct functional commitment for a large class of arithmetic circuits. In: ASIACRYPT, pp. 686\u2013716 (2020)","DOI":"10.1007\/978-3-030-64840-4_23"},{"key":"16_CR30","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: ICALP, pp. 30:1\u201330:14 (2016)"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Wichs, D.: Simple lattice trapdoor sampling from a broad class of distributions. In: PKC, pp. 716\u2013730 (2015)","DOI":"10.1007\/978-3-662-46447-2_32"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: TCC, pp. 499\u2013517 (2010)","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: CRYPTO, pp. 369\u2013378 (1987)","DOI":"10.1007\/3-540-48184-2_32"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: FOCS, pp. 436\u2013453 (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: EUROCRYPT, pp. 700\u2013718 (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). Preliminary version in FOCS 2004","DOI":"10.1137\/S0097539705447360"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: FOCS, pp. 80\u201391 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: CRYPTO, pp. 89\u2013114 (2019)","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: EUROCRYPT, pp. 353\u2013370 (2013)","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. SIAM J. Comput. 40(6), 1803\u20131844 (2011). Preliminary version in STOC 2008","DOI":"10.1137\/080733954"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: ICISC, pp. 285\u2013304 (2001)","DOI":"10.1007\/3-540-45861-1_22"},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"Tomescu, A., Abraham, I., Buterin, V., Drake, J., Feist, D., Khovratovich, D.: Aggregatable subvector commitments for stateless cryptocurrencies. In: SCN, Lecture Notes in Computer Science, pp. 45\u201364 (2020)","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"16_CR43","doi-asserted-by":"crossref","unstructured":"Xagawa, K.: Improved (hierarchical) inner-product encryption from lattices. In: PKC, pp. 235\u2013252 (2013)","DOI":"10.1007\/978-3-642-36362-7_15"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Yamada, S.: Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters. In: EUROCRYPT, pp. 32\u201362 (2016)","DOI":"10.1007\/978-3-662-49896-5_2"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90456-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T01:20:32Z","timestamp":1730683232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90456-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904555","9783030904562"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90456-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Raleigh, NC","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"66","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":"41% - 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":"4","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":"16","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)"}}]}}