A novel deniable authentication protocol based on Diffie-Hellman algorithm using pairing technique

Authors:
Jayaprakash Kar;Banshidhar Majhi
Affiliations:
Al Musanna College of Technology, Sultanate of Oman;King Khalid University, Abha, Saudi Arabia
Venue:
Proceedings of the 2011 International Conference on Communication, Computing & Security
Year:
2011

Citing 6
Cited 0

A course in number theory and cryptography

A course in number theory and cryptography
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Deniable authenticated key establishment for internet protocols

Proceedings of the 11th international conference on Security Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new deniable authentication protocol whose security is based Diffe-Hellman (CDH) Problem of type Decisional Diffie-Hellman(DDH) and the Hash Diffie-Hellman (HDDH) problem. Here we have used pairing technique i.e the problem is called Bilinear Diffie Hell-man (BDHP) problem. The protocol is of identity-based and can be implemented in low power and small processor mobile devices such as smart card, PDA etc. A deniable authentication protocol enables a receiver to identify the true source of a given message, but not to prove the identity of the sender to a third party. This property is very useful for providing secure negotiation over the internet. Our proposed protocol will be achieving the most three security requirement like deniable authentication, authentication and confidentialities. Also it is resistant against Man-in middle Attack.