Paper 2007/376
An Efficient Range-Bounded Commitment Scheme
Zhengjun Cao
Abstract
Checking whether a committed integer lies in a specific interval has many cryptographic applications. In Eurocrypt'98, Chan et al. proposed an instantiation (CFT for short). Based on CFT, Boudot presented an efficient range-bounded commitment scheme in Eurocrypt'2000. Both CFT proof and Boudot proof are based on the
encryption
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- range-bounded commitmentknowledge of a discrete logarithmzero-knowledge proof
- Contact author(s)
- caozhj @ shu edu cn
- History
- 2007-09-21: received
- Short URL
- https://ia.cr/2007/376
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/376, author = {Zhengjun Cao}, title = {An Efficient Range-Bounded Commitment Scheme}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/376}, year = {2007}, url = {https://eprint.iacr.org/2007/376} }