Name
Abstract | ||
|---|---|---|
Certificateless cryptography addresses the private key escrow problem in identity-based systems, while overcoming the costly issues in traditional public key cryptography. Undeniable signature schemes were proposed with the aim of limiting the public verifiability of ordinary digital signatures. The first certificateless undeniable signature scheme was put forth by Duan. The proposed scheme can be considered as the certificateless version of the identity-based undeniable signature scheme which was introduced by Libert and Quisquater. In this paper, we propose a new scheme which is much more efficient comparing to Duan's scheme. Our scheme requires only one pairing evaluation for signature generation and provides more efficient confirmation and disavowal protocols for both the signer and the verifier. We also prove the security of our scheme in the strong security model based on the intractability of some well-known pairing-based assumptions in the random oracle model. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1080/00207160.2014.948869 | International Journal of Computer Mathematics |
Keywords | Field | DocType |
undeniable signature | Undeniable signature,Computer security,Random oracle,Digital signature,Pairing,Certificateless cryptography,Public-key cryptography,Computer security model,Mathematics,Schnorr signature | Journal |
Volume | Issue | ISSN |
92 | 7 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rouzbeh Behnia | 1 | 5 | 5.56 |
| Swee-Huay Heng | 2 | 384 | 47.50 |
| Che-Sheng Gan | 3 | 0 | 0.68 |