Name
Abstract | ||
|---|---|---|
Ring signature enable a user to sign a message on behalf of the ring, without revealing the actual signer. Constant-size ring signature is the ring scheme that the size of the signature does not grow with the size of the ring(or group), so it is practical for large rings. In this paper we use the Collision Resistant Accumulator from bilinear pairing to construct an identity-based ring signature scheme with constant-size signature. Our scheme actually is an improvement on the modified version of the scheme proposed by Nguyen, but we greatly improved the efficiency in terms of computational complexity and signature size. To the best of our knowledge, our scheme is the most efficient secure ID-based ring signature with constant-size based on accumulator proposed to date. Our scheme is proven secure in the random oracle model based on a simplified and general Forking Lemma under the k-strong Diffie-Hellman assumption. |
Year | DOI | Venue |
|---|---|---|
2011 | null | INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS |
Keywords | Field | DocType |
ring signature, accumulator, constant-size, random oracle | Computer science,Ring signature,Algorithm,Artificial intelligence,Machine learning | Journal |
Volume | Issue | ISSN |
35 | 3 | 0350-5596 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongwei Li | 1 | 0 | 0.34 |
| Xiao Li | 2 | 0 | 0.68 |
| Mingxing He | 3 | 213 | 14.99 |
| Shengke Zeng | 4 | 38 | 6.05 |