Composability and on-line deniability of authentication

Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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). On the other hand, we show feasibility with respect to static corruptions (giving the first separation in terms of feasibility between the static and adaptive setting), and show how to realize a relaxation termed deniability with incriminating abort under adaptive corruptions.

Original languageEnglish (US)
Title of host publicationTheory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings
Pages146-162
Number of pages17
DOIs
StatePublished - 2009
Event6th Theory of Cryptography Conference, TCC 2009 - San Francisco, CA, United States
Duration: Mar 15 2009Mar 17 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5444 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th Theory of Cryptography Conference, TCC 2009
CountryUnited States
CitySan Francisco, CA
Period3/15/093/17/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Composability and on-line deniability of authentication'. Together they form a unique fingerprint.

  • Cite this

    Dodis, Y., Katz, J., Smith, A., & Walfish, S. (2009). Composability and on-line deniability of authentication. In Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings (pp. 146-162). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5444 LNCS). https://doi.org/10.1007/978-3-642-00457-5_10