SoK: Zero-knowledge range proofs
发表信息
作者
- Miranda Christ
- Foteini Baldimtsi
- Konstantinos Kryptos Chalkias
- Deepak Maram
- Arnab Roy
- Joy Wang
笔记
Zero-knowledge range proofs (ZKRPs) allow a prover to convince a verifier that a secret value lies in a given interval. ZKRPs have numerous applications: from anonymous credentials and auctions, to confidential transactions in cryptocurrencies. At the same time, a plethora of ZKRP constructions exist in the literature, each with its own trade-offs. In this work, we systematize the knowledge around ZKRPs. We create a classification of existing constructions based on the underlying building techniques, and we summarize their properties. We provide comparisons between schemes both in terms of properties as well as efficiency levels, and construct a guideline to assist in the selection of an appropriate ZKRP for different application requirements. Finally, we discuss a number of interesting open research problems.
零知识范围证明(Zero-knowledge range proofs, ZKRPs)允许证明者向验证者证明某个秘密值位于给定区间内。ZKRPs具有众多应用：从匿名凭证和拍卖，到加密货币中的保密交易。同时，现有文献中存在大量ZKRP构造方案，每种方案都有其自身的权衡取舍。在本研究中，我们系统化地整理了关于ZKRPs的知识。我们基于底层构建技术对现有构造方案进行分类，并总结了它们的特性。我们从特性和效率水平两个方面对各种方案进行了比较，并构建了一个指南，以协助根据不同应用需求选择合适的ZKRP。最后，我们讨论了一些有趣的开放性研究问题。