An Efficient Range Proof Scheme

A new range proof technique is proposed. It only needs a constant cost and is more efficient than the existing range proof schemes. In comparison with the existing range proof solutions with a constant cost or focusing on efficiency, security of the new scheme is based on the same widely accepted trade-offs and no weaker than theirs. In summary, it improves efficiency of range proof without further compromising security.

[1]  Ed Dawson,et al.  Correct, Private, Flexible and Efficient Range Test , 2008, J. Res. Pract. Inf. Technol..

[2]  Marc Girault,et al.  Self-Certified Public Keys , 1991, EUROCRYPT.

[3]  Abhi Shelat,et al.  Efficient Protocols for Set Membership and Range Proofs , 2008, ASIACRYPT.

[4]  Ivan Damgård,et al.  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.

[5]  Marc Joye,et al.  A Practical and Provably Secure Coalition-Resistant Group Signature Scheme , 2000, CRYPTO.

[6]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[7]  Tatsuaki Okamoto,et al.  Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.

[8]  I. Damgård,et al.  The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.

[9]  Claus-Peter Schnorr,et al.  Efficient signature generation by smart cards , 2004, Journal of Cryptology.

[10]  Jacques Traoré,et al.  Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery , 1999, ICICS.

[11]  David Chaum,et al.  An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.

[12]  Fabrice Boudot,et al.  Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.

[13]  Ed Dawson,et al.  A Range Test Secure in the Active Adversary Model , 2007, ACSW.

[14]  Kun Peng,et al.  Practicalization of a Range Test and Its Application to E-Auction , 2009, EuroPKI.

[15]  Jens Groth,et al.  Non-interactive Zero-Knowledge Arguments for Voting , 2005, ACNS.

[16]  Jacques Stern,et al.  Fair Encryption of RSA Keys , 2000, EUROCRYPT.

[17]  Ed Dawson,et al.  A Novel Range Test , 2006, ACISP.

[18]  Helger Lipmaa,et al.  On Diophantine Complexity and Statistical Zero-Knowledge Arguments , 2003, ASIACRYPT.

[19]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[20]  Jan Camenisch,et al.  A Group Signature Scheme with Improved Efficiency , 1998, ASIACRYPT.

[21]  Ivan Damgård,et al.  A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order , 2002, ASIACRYPT.