Paper 2024/430
SoK: Zero-Knowledge Range Proofs
Abstract
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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- zero knowledgerange proofs
- Contact author(s)
-
mchrist @ cs columbia edu
foteini @ mystenlabs com
kostas @ mystenlabs com
deepak @ mystenlabs com
arnab @ mystenlabs com
joy @ mystenlabs com - History
- 2024-06-11: revised
- 2024-03-12: received
- See all versions
- Short URL
- https://ia.cr/2024/430
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/430,
author = {Miranda Christ and Foteini Baldimtsi and Konstantinos Kryptos Chalkias and Deepak Maram and Arnab Roy and Joy Wang},
title = {{SoK}: Zero-Knowledge Range Proofs},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/430},
year = {2024},
url = {https://eprint.iacr.org/2024/430}
}
