Date Added: Nov 2011
Deniable authentication protocol allows a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such authentication ever took place. The authors construct a protocol for deniable authentication via extractable hash proof system and proved the unforgeability in a concurrent setting and sequential deniability of the authentication scheme. The novelty of their scheme is that the security is based on the search problem (e.g. factoring, CDH) instead of decisional problem (e.g. DDH, DCR).