Abstract
Deniable authentication protocol is a new technique of modern cryptography, and several such schemes have been proposed. However, to our knowledge, most of these schemes are interactive and less efficient, and only Shao proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme. Therefore, there is a desire to design other secure and efficient non-interactive deniable authentication protocol. In this paper, based on the bilinear pairings, we would like to propose such a new non-interactive deniable authentication protocol. What's more, we also prove the proposed protocol is secure in the random oracle model.
| Original language | English |
|---|---|
| Pages (from-to) | 954-961 |
| Number of pages | 8 |
| Journal | Applied Mathematics and Computation |
| Volume | 168 |
| Issue number | 2 |
| DOIs | |
| State | Published - 15 Sep 2005 |
| Externally published | Yes |
Keywords
- Bilinear pairings
- Cryptography
- Deniable authentication