A Secure and Efficient Proof of Integer in an Interval Range
A new range proof scheme is proposed in this paper. We study a related technique, range test, and show how its idea can be used to design a more advanced range proof technique. The main advantage of the new range proof technique over the existing solutions is that it achieves the best trade-off between soundness, privacy and efficiency. Is achieves information-theoretic and absolutely precise soundness and thus is more secure than those range proof schemes with conditional soundness. It achieves formally provable zero knowledge in privacy and thus is more secure than those range proof schemes without formally proven zero knowledge. It only needs a small constant number of computations and employs normal-length parameters and thus is more efficient than those range proof schemes needing super-linear cost or extra large integers.
KeywordsEncryption Algorithm Secret Message Security Property Encryption System Message Space
Unable to display preview. Download preview PDF.
- 9.Cramer, R., Damgård, I.B., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)Google Scholar
- 10.Damgård, I., Cramer, R.: On ∑-protocols. Cryptologic Protocol Theory (2002), http://www.daimi.au.dk/~ivan/Sigma.ps
- 13.Lee, B., Kim, K.: Receipt-free electronic voting through collaboration of voter and honest verifier. In: JW-ISC 2000, pp. 101–108 (2000)Google Scholar
- 19.Peng, K., Bao, F., Dawson, E.: Correct, private, flexible and efficient range test. Journal of Researchand Practice in Information Technology 40(4), 275–291 (2008)Google Scholar