Timed encryption with application to deniable key exchange

In this paper, we propose a new notion of timed encryption, in which the encryption is secure within time t while it is completely insecure after some time T>t. We consider the setting where t and T are both polynomial (in the security parameter). This primitive seems useful in applications where...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2014-12, Vol.560, p.172-189
1. Verfasser:	Jiang, Shaoquan
Format:	Artikel
Sprache:	eng
Schlagworte:	Constrictions Deniability Eavesdropping Encryption Exchange Key exchange Mathematical models Messages Polynomials Protocol (computers) Public-key encryption
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!