The development of deniable authentication protocol based on the bivariate function hard problem

• Main Authors: Nek Abd Rahman, Normahirah, Kamel Ariffin, Muhammad Rezal
• Format: Conference or Workshop Item
• Language: English
• Published: Institute for Mathematical Research, Universiti Putra Malaysia 2014
• Online Access: http://psasir.upm.edu.my/id/eprint/66491/1/Cryptology2014-6.pdf; http://psasir.upm.edu.my/id/eprint/66491/
• Institution: Universiti Putra Malaysia

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 the third party. Non-interactive protocol are more efficient than interactive protocol in terms of communication overhead, and thus several non-interactive deniable authentication protocol have been proposed. So, it is very necessary to design a deniable authentication protocol which is non-interactive, secure and efficient. This paper propose a deniable authentication protocol based on the bivariate function hard problem (BFHP) cryptographic primitive. An improvement based on the BFHP is suggested since the problem of the BFHP provides the needed security elements plus its fast execution time. At the same time, the proposed protocol has properties of completeness, deniability, security of forgery attack, security of impersonation attack, security of compromising session secret attack and security man-in-the-middle attack also has been proved.