Protocol Labs Research invites you to

Vector Commitment

Research Day

VIRTUAL EVENT - March 25th 2022, 11am-7pm CET (6am-2pm EDT)

Vector commitments are powerful primitives that find applications in many blockchains protocols. The goal of this workshop is to survey the state of the art in research in Vector Commitments with survey talks, the presentation of recent breakthrough results and discussions about the important open problems, and how they are motivated by practical applications.

Organizing Committee

Anca Nitulescu

Researcher@CryptoNetLab

Rosario Gennaro

Researcher@CryptoNetLab

Vector commitments allow a party to commit to a vector and then to open the commitment at selected positions. The crucial feature of this primitive is that the size of both commitments and openings does not depend on the length of the vector.

Dario Fiore - Imdea

Talk 1:

A journey in vector commitments

In this talk I will present the notion of vector commitments, give an overview of the state of the art in this area, and cover some of the recent efficient constructions. I will also discuss applications and open problems.

Arantxa Zapico

Talk 2:

On the efficiency and flexibility of Linear-map vector commitments.

In this talk we will present some theoretical and practical contributions to algebraic vector commitments. From a theorical point of view, we propose a framework adopting Linear Vector Commitments (LVC) [LaiMal19] as a starting point for defining SVC with updatability and aggregation properties. In particular we show how LVC with minimal properties can be boostrapped to obtain stronger ones.

Russel Lai Friedich-Alexander-Universitat

Talk 2:

Lattice-Based Preprocessing SNARKs: Publicly Verifiable and Recursively Composable


A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. In the last decade, a large body of work has studied candidate constructions that are secure against quantum attackers. Unfortunately, no known candidate matches the efficiency and desirable features of (pre-quantum) constructions based on bilinear pairings. In this work, we make progress.

Alexandros Zacharakis - Universitat Pompeu Fabra

Talk 4:

Techniques and tradeoffs for VC in the dlog setting


In this work we present techniques for opening/proving knowledge of subvectors of algebraic vector commitments. First, we present combinatorial techniques for proving opening of an algebraic commitment generalizing previous results (Hyperproofs). The techniques are generic and can be instantiated using any proof of knowledge of opening of a commitment. We consider (1) a transparent instantiation based.

Weijie Wang - Yale University

Talk 5:

A Compiler for Efficient Vector Commitments

We present a new compiler for efficient vector commitments. By taking as input any vector commitment that is updatable, aggregatable, and has O(nlogn) time to open all proofs, our compiler can produce another vector commitment that balances, with the help of bookkeeping, the time complexity between UpdateAllProofs() and Aggregate(). More specifically, the produced vector commitment requires O(√nlogn) time.

Chris Peikert - Algorand and U. of Michigan

Talk 6:

Vector and Functional Commitments from Lattices

Vector commitments (VCs) allow one to commit concisely to an ordered sequence of values, so that the values at desired positions can later be concisely and verifiably revealed. In addition, a VC can be statelessly updatable, meaning that commitments and proofs can be updated to reflect changes to individual entries, using knowledge of just those changes (and not the entire vector). To date, there have been relatively few post-quantum constructions.

Alin Tomescu - VMWare

Talk 7:

Fantastic trees and how to hash them

Are Merkle trees a panacea? In this talk, I argue they are not and present several tree-based vector commitments that offer interesting trade-offs when compared to Merkle’s classic construction. First, I will cover previous work on tree-based VCs from polynomial commitments and lattices. Unlike Merkle trees, these constructions have a combination of smaller proof sizes, useful homomorphisms and more efficient proof aggregation.

Event Schedule

Central European Time

11:00 am
“A journey in vector commitments” - Dario Fiore
12:00 - 12:15pm
“Proof of Space: A short intro” - Anca Nitulescu
12:15 - 1:00pm
“On the efficiency and flexibility of Linear-map vector commitments.” - Arantxa Zapico
1:00-2:00pm
Lunch Break
2:15-3:00pm
“Lattice-Based Preprocessing SNARKs” - Russel Lai
3:00 - 3:15pm
“Going beyond VC in Practice: from Vectors to Tables and Linked Data” - Matteo Campanelli
3:15-4:00pm
“Techniques and tradeoffs for VC in the dlog setting” - Alexandros Zacharakis
4:00-4:15pm
“Stateless Cryptocurrency: A short intro” - Anca Nitulescu
4:15-5:00pm
“A Compiler for Efficient Vector Commitments” - Weijie Wang
5:15-6:00pm
“ Vector and Functional Commitments from Lattices” - Chris Peikert
6:15-7:00pm
“Fantastic trees and how to hash them” - Alin Tomescu

Sponsored by Protocol Labs

A special thanks to our sponsor Protocol Labs for bringing us the top minds in vector commitments research. Protocol Labs is an open-source R&D lab building protocols, tools, and services to radically improve the internet.

Protocol Labs Invites You

We have a very exciting speaker lineup to survey the research area, present new technical breakthroughs and discuss important open problems.

Made with love by Protocol Labs