Deniability & Anonymity

Authentication is arguably the most important security goal in cryptography. When communication happens over a real-life network we need to make sure that we are talking to the right person and not with an impostor. 

In a public key scenario, message authentication has been long associated with digital signatures. In this case, however message authentication is connected with another property: non-repudiation. Once a party signs a message, she is bound to it. Everybody can verify that she signed it. This is a very useful prperty when digital signatures are used for contracts or commerce transactions, where conditions must be enforced in case of a dispute. 

On the other hand, this feature raises important privacy issues. What if Alice wants to say something very private to Bob, in a way that Bob believes it comes from her, but also in a way that Bob cannot convince a third party that Alice said such a thing? Or even that Alice spoke to Bob at all? Clearly digital signatures do not allow Alice to do this. 

The issue of deniability in public key authentication is thus to create authentication mechanisms where the receiver cannot prove to third party that he received an authenticated message from the sender. Deniability thus is an important privacy-enabling feature of cryptographic protocols and as such has many important practical applications. 

Deniability is a component of the larger issue of anonymity in network communications. Group members are working on solutions for both deniability and anonymity.