Lightweight Signature-based Range Proof

Abstract

Our proposed scheme is modified from that of Camenisch et al., yet achieves more efficient than their scheme. In general, a batch verification method is more advantageous and is also able to save more cost than the original scheme, while non-interactive zero knowledge proof requires fewer communication rounds than interactive zero knowledge proof. The proposed scheme employs the simplified small exponents test method for secure and fast batch verification on multiple signature elements, which can remarkably reduce the number of time-consuming pairing operations required by both a prover and a verifier, resulting in greatly improved computational efficiency. By applying non-interactive zero knowledge proof technique, the proposed scheme also decreases the number of communication rounds required between both of them.