{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:09:55Z","timestamp":1764886195206,"version":"3.46.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122896","type":"print"},{"value":"9783032122902","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12290-2_21","type":"book-chapter","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:06Z","timestamp":1764886026000},"page":"642-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universally Composable Succinct Vector Commitments and\u00a0Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5479-7540","authenticated-orcid":false,"given":"Ran","family":"Canetti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9569-4466","authenticated-orcid":false,"given":"Megan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: SP 2014 (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: capturing global setup within plain UC. In: TCC 2020 (2020)","DOI":"10.1007\/978-3-030-64381-2_1"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-56620-7_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"B Broadnax","year":"2017","unstructured":"Broadnax, B., D\u00f6ttling, N., Hartung, G., M\u00fcller-Quade, J., Nagel, M.: Concurrently composable security with shielded super-polynomial simulators. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 351\u2013381. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_13"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bienstock, A., Fairoze, J., Garg, S., Mukherjee, P., Raghuraman, S.: A more complete analysis of the signal double ratchet algorithm. In: CRYPTO 2022 (2022)","DOI":"10.1007\/978-3-031-15802-5_27"},{"key":"21_CR6","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. In: ITCS 2025 (2025)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS 2001 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"21_CR8","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW 2004 (2004)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM (JACM) (2020)","DOI":"10.1145\/3402457"},{"key":"21_CR10","unstructured":"Canetti, R., Chen, M.: Universally Composable Succinct Vector Commitments and Applications. ePrint Report 2025\/1103"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-78381-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Camenisch","year":"2018","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random oracles. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"key":"21_CR12","unstructured":"Cohen, R., Doerner, J., Lee, E., Lysyanskaya, A., Roy, L.: An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast. ePrint Report 2024\/1807"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: PKC 2013 (2013)","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Fenzi, G.: zkSNARKs in the ROMwith unconditional UC-security. In: TCC 2024 (2024)","DOI":"10.1007\/978-3-031-78011-0_3"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: JACM (2004)","DOI":"10.1145\/1008731.1008734"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., Jain, A., Scafuro, A.: Practical UC security with a global random oracle. In: CCS 2014 (2014)","DOI":"10.1145\/2660267.2660374"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., Jain, P., Swanberg, M., Varia, M.: Universally composable end-to- end secure messaging: a modular analysis. In: CRYPTO 2022 (2022)","DOI":"10.1007\/978-3-031-15979-4_1"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-46035-7_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"R Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 337\u2013351. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_22"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-540-45146-4_33","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565\u2013582. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_33"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable twoparty and multi-party secure computation. In: STOC 2002 (2002)","DOI":"10.1145\/509978.509980"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-78375-8_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Cohen","year":"2018","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 451\u2013467. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-49387-8_11","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Shahaf, D., Vald, M.: Universally composable authentication and key-exchange with global PKI. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 265\u2013296. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_11"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Sarkar, P., Wang, X.: Triply adaptive UC NIZK. In: ASIACRYPT 2022 (2022)","DOI":"10.1007\/978-3-031-22966-4_16"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-48000-7_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Dziembowski","year":"2015","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 585\u2013605. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_29"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247\u2013264. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_15"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Kondi, Y., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Witness-succinct universally-composable SNARKs. In: EUROCRYPT 2023 (2023)","DOI":"10.1007\/978-3-031-30617-4_11"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 339\u2013358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_21"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: New techniques for noninteractive zeroknowledge. J. ACM (JACM) (2012)","DOI":"10.1145\/2220357.2220358"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-28914-9_9","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2012","unstructured":"Ishai, Y., Mahmoody, M., Sahai, A.: On efficient zero-knowledge PCPs. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 151\u2013168. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_9"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent general composition of secure protocols in the timing model. In: STOC 2005 (2005)","DOI":"10.1145\/1060590.1060687"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Tardos, G.: Probabilistically checkable proofs with zero knowledge. In: STOC 1997 (1997)","DOI":"10.1145\/258533.258643"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., Rosenbloom, L.N.: Universally composable $$\\varSigma $$-protocols in the global random-oracle model. In: TCC 2022 (2022)","DOI":"10.1007\/978-3-031-22318-1_8"},{"key":"21_CR34","unstructured":"Melara, M.S., Blankstein, A., Bonneau, J., Felten, E.W., Freedman, M.J.: CONIKS: bringing key transparency to end users. In: USENIX Security 2015 (2015)"},{"key":"21_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. (2000). Preliminary version appeared in FOCS \u201994","DOI":"10.1137\/S0097539795284959"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: ITCS 2013 (2013)","DOI":"10.1145\/2422436.2422479"},{"key":"21_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-14623-7_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"HK Maji","year":"2010","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: A zero-one law for cryptographic complexity with respect to computational UC security. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 595\u2013612. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_32"},{"key":"21_CR39","unstructured":"Protocol Labs. Filecoin: A Decentralized Storage Network. Whitepaper. https:\/\/www.filecoin.io\/filecoin.pdf"},{"key":"21_CR40","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC 2004 (2004)","DOI":"10.1145\/1007352.1007394"}],"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-032-12290-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:09Z","timestamp":1764886029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12290-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"ISBN":["9783032122896","9783032122902"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"5 December 2025","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}