Paper 2024/027

Updatable, Aggregatable, Succinct Mercurial Vector Commitment from Lattice

Hongxiao Wang, The University of Hong Kong
Siu-Ming Yiu, The University of Hong Kong
Yanmin Zhao, The University of Hong Kong
Zoe L. Jiang, Harbin Institute of Technology, Shenzhen
Abstract

Vector commitments (VC) and their variants attract a lot of attention due to their wide range of usage in applications such as blockchain and accumulator. Mercurial vector commitment (MVC), as one of the important variants of VC, is the core technique for building more complicated cryptographic applications, such as the zero-knowledge set (ZKS) and zero-knowledge elementary database (ZK-EDB). However, to the best of our knowledge, the only post-quantum MVC construction is trivially implied by a generic framework proposed by Catalano and Fiore (PKC '13) with lattice-based components which causes $\textit{large}$ auxiliary information and $\textit{cannot satisfy}$ any additional advanced properties, that is, updatable and aggregatable. A major difficulty in constructing a $\textit{non-black-box}$ lattice-based MVC is that it is not trivial to construct a lattice-based VC that satisfies a critical property called ``mercurial hiding". In this paper, we identify some specific features of a new falsifiable family of basis-augmented SIS assumption ($\mathsf{BASIS}$) proposed by Wee and Wu (EUROCRYPT '23) that can be utilized to construct the mercurial vector commitment from lattice $\textit{satisfying}$ updatability and aggregatability with $\textit{smaller}$ auxiliary information. We $\textit{first}$ extend stateless update and differential update to the mercurial vector commitment and define a $\textit{new}$ property, named updatable mercurial hiding. Then, we show how to modify our constructions to obtain the updatable mercurial vector commitment that satisfies these properties. To aggregate the openings, our constructions perfectly inherit the ability to aggregate in the $\mathsf{BASIS}$ assumption, which can break the limitation of $\textit{weak}$ binding in the current aggregatable MVCs. In the end, we show that our constructions can be used to build the various kinds of lattice-based ZKS and ZK-EDB directly within the existing framework.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A major revision of an IACR publication in PKC 2024
DOI
10.1007/978-3-031-57722-2_1
Keywords
Vector commitmentMercurial commitmentLatticeZero-knowledge elementary database
Contact author(s)
hxwang @ cs hku hk
smyiu @ cs hku hk
ymzhao @ cs hku hk
zoeljiang @ hit edu cn
History
2024-04-21: last of 3 revisions
2024-01-08: received
See all versions
Short URL
https://ia.cr/2024/027
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/027,
      author = {Hongxiao Wang and Siu-Ming Yiu and Yanmin Zhao and Zoe L. Jiang},
      title = {Updatable, Aggregatable, Succinct Mercurial Vector Commitment from Lattice},
      howpublished = {Cryptology ePrint Archive, Paper 2024/027},
      year = {2024},
      doi = {10.1007/978-3-031-57722-2_1},
      note = {\url{https://eprint.iacr.org/2024/027}},
      url = {https://eprint.iacr.org/2024/027}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.