Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02882-3_15 | COCOON |
Keywords | Field | DocType |
proof size,conventional number-theoretic assumption,subgroup decision problem,efficient non-interactive range proof,random oracle assumption,constant number,efficient constant-size range proof,composable zero-knowledge,perfect soundness,perfect completeness,constant size non-interactive range,random oracle,decision problem,zero knowledge,range,interactive,proof | Discrete mathematics,Combinatorics,Decision problem,Heuristic,Computer science,Random oracle,Proof complexity,Soundness,Zero-knowledge proof,Completeness (statistics) | Conference |
Volume | ISSN | Citations |
5609 | 0302-9743 | 3 |
PageRank | References | Authors |
0.37 | 14 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsz Hon Yuen | 1 | 507 | 33.86 |
| Qiong Huang | 2 | 675 | 47.45 |
| Yi Mu | 3 | 188 | 21.80 |
| Willy Susilo | 4 | 4823 | 353.18 |
| Duncan S. Wong | 5 | 2653 | 152.19 |
| Guomin Yang | 6 | 1033 | 78.55 |