Paper 2022/705

Linear-map Vector Commitments and their Practical Applications

Matteo Campanelli, Protocol Labs
Anca Nitulescu, Protocol Labs
Carla Ràfols, Universitat Pompeu Fabra
Alexandros Zacharakis, Universitat Pompeu Fabra
Arantxa Zapico, Universitat Pompeu Fabra
Abstract

Vector commitments (VC) are a cryptographic primitive that allow one to commit to a vector and then “open” some of its positions efficiently. Vector commitments are increasingly recognized as a central tool to scale highly decentralized networks of large size and whose content is dynamic. In this work, we examine the demands on the properties that an ideal vector commitment should satisfy in the light of the emerging plethora of practical applications and propose new constructions that improve the state-of-the-art in several dimensions and offer new tradeoffs. We also propose a unifying framework that captures several constructions and show how to generically achieve some properties from more basic ones. On the practical side, we focus on building efficient schemes that do not require new trusted setup (we can reuse existing ceremonies for pairing-based “powers of tau” run by real-world systems such as ZCash or Filecoin). Our (in-progress) implementation demonstrates that our work over-performs in efficiency prior schemes with same properties.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
vector commitments functional commitments public-key cryptography trade-offs
Contact author(s)
matteo @ protocol ai
anca @ protocol ai
carla rafols @ upf edu
alexandros zacharakis @ upf edu
arantxa zapico @ upf edu
History
2022-06-16: last of 2 revisions
2022-06-02: received
See all versions
Short URL
https://ia.cr/2022/705
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/705,
      author = {Matteo Campanelli and Anca Nitulescu and Carla Ràfols and Alexandros Zacharakis and Arantxa Zapico},
      title = {Linear-map Vector Commitments and their Practical Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2022/705},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/705}},
      url = {https://eprint.iacr.org/2022/705}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.