Document Type
Journal Article
Abstract
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.
RIS ID
32531
COinS
Publication Details
Yuen, T. Hon., Huang, Q., Mu, Y., Susilo, W., Wong, D. S. & Yang, G. (2009). Efficient non-interactive range proof. Lecture Notes in Computer Science, (5609), 138-147.