CryptoDB

Paper: Optimal Channel Security Against Fine-Grained State Compromise: The Safety of Messaging

Authors: Joseph Jaeger Igors Stepanovs DOI: 10.1007/978-3-319-96884-1_2 Search ePrint Search Google CRYPTO 2018 We aim to understand the best possible security of a (bidirectional) cryptographic channel against an adversary that may arbitrarily and repeatedly learn the secret state of either communicating party. We give a formal security definition and a proven-secure construction. This construction provides better security against state compromise than the Signal Double Ratchet Algorithm or any other known channel construction. To facilitate this we define and construct new forms of public-key encryption and digital signatures that update their keys over time.
BibTeX
@inproceedings{crypto-2018-28852,
title={Optimal Channel Security Against Fine-Grained State Compromise: The Safety of Messaging},
booktitle={Advances in Cryptology – CRYPTO 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={10991},
pages={33-62},
doi={10.1007/978-3-319-96884-1_2},
author={Joseph Jaeger and Igors Stepanovs},
year=2018
}