Efficient non-interactive range proof

• Main Authors: YUEN, Tsz Hon, HUANG, Qiong, MU, Yi, SUSILO, Willy, WONG, Duncan S., YANG, Guomin
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2009
• Subjects: Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/7380; https://ink.library.smu.edu.sg/context/sis_research/article/8383/viewcontent/Efficient_non_interactive_range_proof.pdf
• Institution: Singapore Management University

We propose the first constant size non-interactive range proof which is not based on the heuristic Fiat-Shamir transformation and whose security does not rely on the random oracle assumption. The proof consists of a constant number of group elements. Compared with the most efficient constant-size range proof available in the literature, our scheme has significantly reduced the proof size. We showed that our scheme achieves perfect completeness, perfect soundness and composable zero-knowledge under a conventional number-theoretic assumption, namely the Subgroup Decision Problem.