Paper 2025/667
Vector Commitment Design, Analysis, and Applications: A Survey
Abstract
Due to their widespread applications in decentralized and privacy preserving technologies, commitment schemes have become increasingly important cryptographic primitives. With a wide variety of applications, many new constructions have been proposed, each enjoying different features and security guarantees. In this paper, we systematize the designs, features, properties, and applications of vector commitments (VCs). We define vector, polynomial, and functional commitments and we discuss the relationships shared between these types of commitment schemes. We first provide an overview of the definitions of the commitment schemes we will consider, as well as their security notions and various properties they can have. We proceed to compare popular constructions, taking into account the properties each one enjoys, their proof/update information sizes, and their proof/commitment complexities. We also consider their effectiveness in various decentralized and privacy preserving applications. Finally, we conclude by discussing some potential directions for future work.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Vector CommitmentFunctional Commitment
- Contact author(s)
-
Vihak503 @ gmail com
sushmita ruj @ unsw edu au
R VanderMeyden @ unsw edu au - History
- 2025-04-13: approved
- 2025-04-13: received
- See all versions
- Short URL
- https://ia.cr/2025/667
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/667, author = {Vir Pathak and Sushmita Ruj and Ron van der Meyden}, title = {Vector Commitment Design, Analysis, and Applications: A Survey}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/667}, year = {2025}, url = {https://eprint.iacr.org/2025/667} }