Efficient non-interactive deniable authentication protocols

Abstract

Deniable authentication protocol is an authentication protocol that allows a sender to authenticate a message for a receiver, in a way that the receiver cannot convince a third party that such authentication ever took place. In recent years, due to the popularity of Internet and its special property, many deniable authentication protocols have been proposed. However, most of these proposed schemes are interactive and less efficient. To our knowledge, Shao has proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme without security proof. Lu et al have proposed a deniable authentication also, however, the protocol suffers from the receiver's attack who once interacts with the sender. For the reason above, we would like to propose a generic method to construct efficient non-interactive deniable authentication protocols from any trapdoor permutations. Using RSA trapdoor permutations we introduce a new digital signature with tight security and use it to construct a concrete deniable authentication protocol. Concentrated on security problem we prove the protocol secure in random oracle. We also believe that the protocol is much efficient and practical in application with non-interactive property.