Cryptology ePrint Archive: Report 2021/297

HashWires: Hyperefficient Credential-Based Range Proofs

Konstantinos Chalkias and Shir Cohen and Kevin Lewi and Fredric Moezinia and Yolan Romailler

Abstract: This paper presents HashWires, a hash-based range proof protocol that is applicable in settings for which there is a trusted third party (typically a credential issuer) that can generate commitments. We refer to these as "credential-based" range proofs (CBRPs). HashWires improves upon hashchain solutions that are typically restricted to micro-payments for small interval ranges, achieving an exponential speedup in proof generation and verification time. In terms of proof size and computational cost, we show that HashWires compares favorably against Bulletproofs for both 32- and 64-bit numeric values. Although CBRPs are inherently less flexible than general zero-knowledge range proofs, we provide a number of applications in which a credential issuer can leverage HashWires to provide range proofs for private values, without having to rely on heavyweight cryptographic tools and assumptions.

Category / Keywords: cryptographic protocols / range proofs, credentials, hash-chains, accumulators, cryptographic commitments, malleability, micro-payments, location privacy

Date: received 5 Mar 2021, last revised 8 Mar 2021

Contact author: kostascrypto at fb com,klewi@fb com

Available format(s): PDF | BibTeX Citation

Version: 20210308:224902 (All versions of this report)

Short URL: ia.cr/2021/297


[ Cryptology ePrint archive ]