A Maintainable Matrix Commitment Scheme with Constant-Size Public Parameters and Incremental Aggregation
Wenhui Qiao, Liang Feng Zhang · 2024
In this paper, we propose a new matrix commitment scheme that allows one to commit to any matrix and open any subset of the matrix entries. The proposed scheme is a vector commitment (VC) scheme that supports subvector opening, if we interpret the matrix as a vector. It gives the first VC scheme that is maintainable and incrementally aggregatable, and has constant-size public parameters. We implement the proposed scheme with groups of hidden orders that require a trusted setup. The experimental results show that it is around 1000 times faster in setup or 10 times faster in committing/opening than the existing schemes that are most relevant. With these interesting features, our scheme can significantly reduce the storage cost and result in meaningful applications in the domain of stateless cryptocurrencies and other data-intensive systems that require secure and verifiable storage solutions.