Composability and On-Line Deniability of Authentication

Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but neither party can convince anyone else that the other party took part in the protocol. We introduce and study on-line deniability, where deniability should hold even when one of the parties colludes with a third party during execution of the protocol. This turns out to generalize several realistic scenarios that are outside the scope of previous models. We show that a protocol achieves our definition of on-line deniability if and only if it realizes the message authentication functionality in the generalized universal composability framework; any protocol satisfying our definition thus automatically inherits strong composability guarantees. Unfortunately, we show that our definition is impossible to realize in the PKI model if adaptive corruptions are allowed (even if secure erasure is assumed)...

• Type: Conference
• Year: 2009
• Where: TCC
• Authors: Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish
• Keywords: Adaptive Corruptions, Cryptography, On-line Deniability, Relaxation Termed Deniability, TCC 2009