Paper 2022/1153

Sharp: Short Relaxed Range Proofs

Abstract

We provide optimized range proofs, called $\mathsf{Sharp}$, in discrete logarithm and hidden order groups, based on square decomposition. In the former setting, we build on the paradigm of Couteau et al. (Eurocrypt '21) and optimize their range proof (from now on, CKLR) in several ways: (1) We introduce batching via vector commitments and an adapted $$-protocol. (2) We introduce a new group switching strategy to reduce communication. (3) As repetitions are necessary to instantiate CKLR in standard groups, we provide a novel batch shortness test that allows for cheaper repetitions. The analysis of our test is nontrivial and forms a core technical contribution of our work. For example, for $$ bit security and $$ bit ranges for $$ (resp. $$) proof(s), we reduce the proof size by $$ (resp. $$) in arbitrary groups, and by $$ (resp. $$ in groups of order $$-bit, compared to CKLR. As $$ and CKLR proofs satisfy a “relaxed” notion of security, we show how to enhance their security with one additional hidden order group element. In RSA groups, this reduces the size of state of the art range proofs (Couteau et al., Eurocrypt '17) by $$ ($$). Finally, we implement our most optimized range proof. Compared to the state of the art Bulletproofs (Bünz et al., S&P 2018), our benchmarks show a very significant runtime improvement. Eventually, we sketch some applications of our new range proofs.

Note: 2024-10-18: Minor bugfixes, including a mistake in the parameter K in Thm 5.1. 2022-09-06: Fixed typo in eprint abstract.