数学证明
计算机科学
煤气表校准仪
职位(财务)
零(语言学)
理论计算机科学
离散数学
算法
数学
语言学
哲学
几何学
财务
经济
作者
Arantxa Zapico,Vitalik Buterin,Dmitry Khovratovich,Mary Maller,Anca Nitulescu,Mark G. Simkin
标识
DOI:10.1145/3548606.3560646
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI