Name
Abstract | ||
|---|---|---|
The signature schemes are used to verify the authenticity of a signature and the corresponding documents. The undeniable signature schemes are challenge and response based interactive schemes, where the active participation of signer is compulsory. These schemes are used in private communication where the confidential deals and agreements take place as a legitimate signer cannot deny his signature. In this paper, we analyze the Thomas and Lal's braid group based zero-knowledge undeniable signature scheme and show that it is insecure against the man-in-the-middle and impersonation attacks. In addition, we propose an efficient undeniable signature scheme using the braid groups that provides secrecy and authenticity of a legitimate signer. Furthermore, we show that our scheme is secure against the above mentioned attacks. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/IC3.2015.7346736 | IC3 |
Keywords | Field | DocType |
braid group, conjugacy search problem, root problem, signature, undeniable, zero-knowledge | Authentication,Undeniable signature,Computer security,Computer science,Cryptography,Secrecy,Ring signature,Digital signature,Blind signature,Schnorr signature | Conference |
ISSN | ISBN | Citations |
2572-6110 | 978-1-4673-7947-2 | 0 |
PageRank | References | Authors |
0.34 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pratik Ranjan | 1 | 0 | 0.34 |
| H. Om | 2 | 99 | 17.56 |