{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:29:23Z","timestamp":1742995763309,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":66,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819608904"},{"type":"electronic","value":"9789819608911"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0891-1_1","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:37:39Z","timestamp":1733956659000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-malleable Subvector Commitments"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Libert","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"F.\u00a0Bao, R.\u00a0Deng, and H.\u00a0Zhu. Variations of Diffie-Hellman problem. In ICICS, 2003.","DOI":"10.1007\/978-3-540-39927-8_28"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"N.\u00a0Baric and B.\u00a0Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Eurocrypt, 1997.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, D.\u00a0Hofheinz, and S.\u00a0Yilek. Possibility and impossibility results for encryption and commitment secure under selective opening. In Eurocrypt, 2009.","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"E.\u00a0Ben-Sasson, A.\u00a0Chiesa, C.\u00a0Garman, M.\u00a0Green, I.\u00a0Miers, E.\u00a0Tromer, and M.\u00a0Virza.Zerocash: Decentralized anonymous payments from bitcoin.In IEEE S &P, 2014.","DOI":"10.1109\/SP.2014.36"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bichler. Market design: A Linear Programming Approach to Auctions and Matching. 2017.","DOI":"10.1017\/9781316779873"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and X.\u00a0Boyen. Efficient selective identity-based encryption without random oracles. In Eurocrypt, 2004.","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and X.\u00a0Boyen. Short signatures without random oracles. In Eurocrypt, 2004.","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, B.\u00a0B\u00fcnz, and B.\u00a0Fisch. Batching techniques for accumulators with applications to IOPs and stateless blockchains. In Crypto, 2019.","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and M.\u00a0Franklin. Identity-based encryption fromi the Weil pairing. In Crypto, 2001.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"H.\u00a0Brenner, V.\u00a0Goyal, S.\u00a0Richelson, A.\u00a0Rosen, and M.\u00a0Vald. Fast non-malleable commitment. In CCS, 2015.","DOI":"10.1145\/2810103.2813721"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, M.\u00a0Dubovitskaya, K.\u00a0Haralambiev, and M.\u00a0Kohlweiss. Composable and modular anonymous credentials: Definitions and practical constructions. In Asiacrypt, 2015.","DOI":"10.1007\/978-3-662-48800-3_11"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Campanelli, D.\u00a0Fiore, N.\u00a0Greco, D.\u00a0Kolonelos, and L.\u00a0Nizzardo. Incrementally aggregatable vector commitments and applications to verifiable decentralized storage. In Asiacrypt, 2020.","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti and M.\u00a0Fischlin. Universally composable commitments. In Crypto, 2001.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"D.\u00a0Catalano and D.\u00a0Fiore. Vector commitments and their applications. In PKC, 2013.","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"D.\u00a0Catalano, D.\u00a0Fiore, R.\u00a0Gennaro, and E.\u00a0Giunta. On the impossibility of algebraic vector commitments in pairing-free groups. In TCC, 2022.","DOI":"10.1007\/978-3-031-22365-5_10"},{"key":"1_CR16","unstructured":"D.\u00a0Catalano, D.\u00a0Fiore, and M.\u00a0Messina. Zero-knowledge sets with short proofs. In Eurocrypt, 2008."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"M.\u00a0Chase, A.\u00a0Healy, M.\u00a0Lysyanskaya, T.\u00a0Malkin, and L.\u00a0Reyzin. Mercurial commitments with applications to zero-knowledge sets. In Eurocrypt, 2005.","DOI":"10.1007\/11426639_25"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd and J.\u00a0Groth. Non-interactive and reusable non-malleable commitment schemes. In STOC, 2003.","DOI":"10.1145\/780601.780605"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"A.\u00a0De\u00a0Santis, G.\u00a0Di\u00a0Crescenzo, R.\u00a0Ostrovsky, G.\u00a0Persiano, and A.\u00a0Sahai. Robust non-interactive zero-knowledge. In Crypto, 2001.","DOI":"10.1007\/3-540-44647-8_33"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"G.\u00a0Di\u00a0Crescenzo, Y.\u00a0Ishai, and R.\u00a0Ostrovsky. Non-interactive and non-malleable commitments. In STOC, 1998.","DOI":"10.1145\/276698.276722"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"G.\u00a0Di\u00a0Crescenzo, J.\u00a0Katz, R.\u00a0Ostrovsky, and A.\u00a0Smith. Efficient and non-interactive non-malleable commitment. In Eurocrypt, 2001.","DOI":"10.1007\/3-540-44987-6_4"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, and M.\u00a0Naor. Non-malleable cryptography. In STOC, 1991.","DOI":"10.1145\/103418.103474"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, and M.\u00a0Naor. Non-malleable cryptography. SIAM J. of Computing, 30(2), 2000.","DOI":"10.1137\/S0097539795291562"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, M.\u00a0Naor, O.\u00a0Reingold, and L.\u00a0Stockmeyer. Magic functions. J. of the ACM, 50(6), 2003.","DOI":"10.1145\/950620.950623"},{"key":"1_CR25","unstructured":"B.\u00a0Fisch. PoReps: Proofs of Space on Useful Data. Cryptology ePrint Archive Report 2018\/678."},{"key":"1_CR26","unstructured":"M.\u00a0Fischlin. Trapdoor commitment schemes and their applications. PhD thesis, University of Frankfurt, 2001."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fischlin and R.\u00a0Fischlin. Efficient non-malleable commitment schemes. In Crypto, 2000.","DOI":"10.1007\/3-540-44598-6_26"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fischlin and R.\u00a0Fischlin. The representation problem based on factoring. In CT-RSA, 2002.","DOI":"10.1007\/3-540-45760-7_8"},{"key":"1_CR29","unstructured":"N.\u00a0Fleischhacker, M.\u00a0Hall-Andersen, M.\u00a0Simkin, and B.\u00a0Wagner. Jackpot: Non-interactive aggregatable lotteries. In Asiacrypt, 2024."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"G.\u00a0Fuchsbauer, E.\u00a0Kiltz, and J.\u00a0Loss. The algebraic group model and its applications. In Crypto, 2018.","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"J.\u00a0Garay, P.\u00a0MacKenzie, and K.\u00a0Yang. Strengthening zero-knowledge protocols using signatures. In Eurocrypt, 2003.","DOI":"10.1007\/3-540-39200-9_11"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"R.\u00a0Garg, D.\u00a0Khurana, G.\u00a0Lu, and B.\u00a0Waters. Black-box non-interactive non-malleable commitments. In Eurocrypt, 2021.","DOI":"10.1007\/978-3-030-77883-5_6"},{"key":"1_CR33","unstructured":"R.\u00a0Gennaro. Multi-trapdoor commitments and their applications to non-malleable protocols. In Crypto, 2004."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gennaro, S.\u00a0Halevi, and T.\u00a0Rabin. Secure hash-and-sign signatures without the random oracle. In Eurocrypt, 1999.","DOI":"10.1007\/3-540-48910-X_9"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gennaro and S.\u00a0Micali. Independent zero-knowledge sets. In ICALP, 2006.","DOI":"10.1007\/11787006_4"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry and D.\u00a0Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In STOC, 2011.","DOI":"10.1145\/1993636.1993651"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gorbunov, L.\u00a0Reyzin, H.\u00a0Wee, and Z.\u00a0Zhang. PointProofs: Aggregating Proofs for Multiple Vector Commitments. In ACM-CCS, 2020.","DOI":"10.1145\/3372297.3417244"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"G.\u00a0Goyal, C.-K. Lee, R.\u00a0Ostrovsky, and I.\u00a0Visconti. Constructing non-malleable commitments: A black-box approach. In FOCS, 2012.","DOI":"10.1109\/FOCS.2012.47"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, O.\u00a0Pandey, and S.\u00a0Richelson. Texbook non-malleable commitments. In STOC, 2016.","DOI":"10.1145\/2897518.2897657"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, S.\u00a0Richelson, A.\u00a0Rosen, and M.\u00a0Vald. An algebraic approach to non-malleability.In FOCS, 2014.","DOI":"10.1109\/FOCS.2014.13"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"S.\u00a0Hohenberger and B.\u00a0Waters. Short and stateless signatures from the RSA assumption. In Crypto, 2009.","DOI":"10.1007\/978-3-642-03356-8_38"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kate, G.\u00a0Zaverucha, and I.\u00a0Goldberg. Constant-size commitments to polynomials and applications. In Asiacrypt, 2010.","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"J.\u00a0Krupp, D.\u00a0Schr\u00f6der, M.\u00a0Simkin, D.\u00a0Fiore, G.\u00a0Ateniese, and S.\u00a0Nuernberger. newblock Nearly optimal verifiable data streaming. In PKC, 2016.","DOI":"10.1007\/978-3-662-49384-7_16"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"R.-W. Lai and G.\u00a0Malavolta. Subvector commitments with application to succinct arguments. In Crypto, 2019.","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"1_CR45","unstructured":"D.\u00a0Leung, Y.\u00a0Gilad, S.\u00a0Gorbunov, L.\u00a0Reyzin, and N.\u00a0Zeldovich. Aardvark: A concurrent authenticated dictionary with short proof. In USENIX Security, 2022."},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert and M.\u00a0Yung. Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In TCC, 2010.","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lin and R.\u00a0Pass. Non-malleability amplification. In FOCS, 2009.","DOI":"10.1145\/1536414.1536442"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lin and R.\u00a0Pass. Constant-round non-malleable commitments from any one-way function. In STOC, 2011.","DOI":"10.1145\/1993636.1993730"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lin, R.\u00a0Pass, and P.\u00a0Soni. Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles. In FOCS, 2017.","DOI":"10.1109\/FOCS.2017.59"},{"key":"1_CR50","unstructured":"H.\u00a0Lin, R.\u00a0Pass, and M.\u00a0Venkitasubramaniam. Concurrent non-malleable commitments from any one-way function. In TCC, 2008."},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lipmaa, R.\u00a0Parisella, and J.\u00a0Siim. Constant-size zk-SNARKs in ROM from falsifiable assumptions. In Eurocrypt, 2024.","DOI":"10.1007\/978-3-031-58751-1_2"},{"key":"1_CR52","doi-asserted-by":"crossref","unstructured":"P.\u00a0MacKenzie and K.\u00a0Yang. On simulation-sound trapdoor commitments. In Eurocrypt, 2004.","DOI":"10.1007\/978-3-540-24676-3_23"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"U.\u00a0Maurer and S.\u00a0Wolf. Diffie-Hellman oracles. In Crypto, 1996.","DOI":"10.1007\/3-540-68697-5_21"},{"key":"1_CR54","unstructured":"R.\u00a0Merkle. A certified digital signature. In Crypto, 1989."},{"key":"1_CR55","unstructured":"S.\u00a0Micali, M.\u00a0Rabin, and J.\u00a0Kilian. Zero-knowledge sets. In FOCS, 2003."},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and M.\u00a0Yung. Universal one-way hash functions and their cryptographic applications. In STOC, 1989.","DOI":"10.1145\/73007.73011"},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"R.\u00a0Pass and H.\u00a0Wee. Constant-round non-malleable commitments from sub-exponential one-way functions. In Eurocrypt, 2010.","DOI":"10.1007\/978-3-642-13190-5_32"},{"key":"1_CR58","doi-asserted-by":"crossref","unstructured":"L.\u00a0Rotem and G.\u00a0Segev. Non-malleable vector commitments via local equivocability. In TCC, 2021.","DOI":"10.1007\/978-3-030-90456-2_14"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"L.\u00a0Rotem and G.\u00a0Segev. Non-malleable vector commitments via local equivocability. Jo. of Cryptology, 36(4), 2023.","DOI":"10.1007\/s00145-023-09480-4"},{"key":"1_CR60","unstructured":"A.\u00a0Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In FOCS, 1999."},{"key":"1_CR61","doi-asserted-by":"crossref","unstructured":"A.\u00a0Shamir. On the generation of cryptographically strong pseudorandomsequences. ACM Transactions on Computer Systems, 1(1):38\u201344, 1983.","DOI":"10.1145\/357353.357357"},{"key":"1_CR62","unstructured":"S.\u00a0Srinivasan, A.\u00a0Chepurnoy, C.\u00a0Papamanthou, A.\u00a0Tomescu, and Y.\u00a0Zhang. Hyperproofs: Aggregating and maintaining proofs in vector commitments. In USENIX Security, 2022."},{"key":"1_CR63","doi-asserted-by":"crossref","unstructured":"A.\u00a0Tomescu, I.\u00a0Abraham, V.\u00a0Buterin, J.\u00a0Drake, D.\u00a0Feist, and D.\u00a0Khovratovich. Aggregatable subvector commitments for stateless cryptocurrencies. In SCN, 2020.","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"1_CR64","unstructured":"A.\u00a0Tomescu, Y.\u00a0Xia, and Z.\u00a0Newman. Authenticated dictionaries with cross- incremental proof (dis)aggregation. Cryptology ePrint Archive Report 2020\/1239."},{"key":"1_CR65","doi-asserted-by":"crossref","unstructured":"B.\u00a0Waters. Efficient identity-based encryption without random oracles. In Eurocrypt, 2005.","DOI":"10.1007\/11426639_7"},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"H.\u00a0Wee and D.\u00a0Wu. Succinct vector, polynomial, and functional commitments from lattices. In Eurocrypt, 2023.","DOI":"10.1007\/978-3-031-30620-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0891-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:41:25Z","timestamp":1733956885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0891-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819608904","9789819608911"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0891-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}