Paper 2024/680
Universal Vector Commitments
Abstract
We propose a new notion of vector commitment schemes with proofs of (non-)membership that we call universal vector commitments. We show how to build them directly from (i) Merkle commitments, and (ii) a universal accumulator and a plain vector commitment scheme. We also present a generic construction for universal accumulators over large domains from any vector commitment scheme, using cuckoo hashing. Leveraging the aforementioned generic constructions, we show that universal vector commitment schemes are implied by plain vector commitments and cuckoo hashing.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. SCN '24
- Keywords
- vector commitmentsuniversal accumulatorscuckoo hashinggeneric constructions
- Contact author(s)
- ayadav5 @ gmu edu
- History
- 2024-09-05: last of 2 revisions
- 2024-05-03: received
- See all versions
- Short URL
- https://ia.cr/2024/680
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/680,
author = {Ojaswi Acharya and Foteini Baldimtsi and Samuel Dov Gordon and Daniel McVicker and Aayush Yadav},
title = {Universal Vector Commitments},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/680},
year = {2024},
url = {https://eprint.iacr.org/2024/680}
}
