Name
Abstract | ||
|---|---|---|
We propose a distributed key generation protocol for pairing-based cryptosystems which is adaptively secure in the erasure-free and secure channel model, and at the same time completely avoids the use of interactive zero-knowledge proofs. Utilizing it as the threshold key generation protocol, we present a secure (t,n) threshold signature scheme based on the Waters' signature scheme. We prove that our scheme is unforgeable and robust against any adaptive adversary who can choose players for corruption at any time during the run of the protocols and make adaptive chosen-message attacks. And the security proof of ours is in the standard model (without random oracles). In addition our scheme achieves optimal resilience, that is, the adversary can corrupt any t |
Year | Venue | Keywords |
|---|---|---|
2009 | Informatica, Lith. Acad. Sci. | adaptively secure threshold signature,threshold signature,threshold signature scheme,standard model,optimal resilience,signature scheme,secure channel model,computational diffie-hellman problem,threshold key generation protocol,interactive zero-knowledge proof,adaptive adversary,provable security.,adaptively secure,key generation protocol,distributed key generation,adaptive chosen-message attack,zero knowledge proof,random oracle,provable security |
Field | DocType | Volume |
Secure channel,Key generation,Computer science,Theoretical computer science,Pairing,Cryptosystem,Mathematical proof,Adversary,Distributed key generation,Provable security | Journal | 20 |
Issue | ISSN | Citations |
4 | 0868-4952 | 5 |
PageRank | References | Authors |
0.41 | 35 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zecheng Wang | 1 | 10 | 1.51 |
| Haifeng Qian | 2 | 476 | 57.19 |
| Zhibin Li | 3 | 115 | 23.77 |