Paper 2025/1103
Universally Composable Succinct Vector Commitments and Applications
, Boston UniversityAbstract
We develop a toolbox for modular construction and analysis of succinct, non-interactive commitments and vector commitments in the random oracle model, while guaranteeing universally composable security. To demonstrate its power, we use the toolbox to construct and analyze a modular variant of the Kilian-Micali ZK-SNARK. Along the way we also propose a new UC formulation of a global random oracle, that avoids a weakness in existing formulations and also enables expressing more nuanced, session-specific abstractions. We hope that this toolbox will be useful for building secure applications in settings where both succinctness and non-interactivity are key.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in TCC 2025
- Keywords
- universal composabilityvector commitmentcommitmentrandom oracle model
- Contact author(s)
-
canetti @ bu edu
megchen @ bu edu - History
- 2025-09-29: revised
- 2025-06-12: received
- See all versions
- Short URL
- https://ia.cr/2025/1103
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1103,
author = {Ran Canetti and Megan Chen},
title = {Universally Composable Succinct Vector Commitments and Applications},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1103},
year = {2025},
url = {https://eprint.iacr.org/2025/1103}
}
