Caulk

Arantxa Zapico,Vitalik Buterin,Dmitry Khovratovich,Mary Maller,Anca Nitulescu, Mark G. Simkin

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security（2022）

引用 0|浏览1

暂无评分

摘要

We present position-hiding linkability for vector commitment schemes: one can prove in zero knowledge that one or m values that comprise commitment \cm all belong to the vector of size N committed to in \com. Our construction \textsfCaulk can be used for membership proofs and lookup arguments and outperforms all existing alternatives in prover time by orders of magnitude.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要