[Resource Topic] 2018/553: Optimal Channel Security Against Fine-Grained State Compromise: The Safety of Messaging

Welcome to the resource topic for 2018/553

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

Authors: Joseph Jaeger, Igors Stepanovs

Abstract:

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.

ePrint: https://eprint.iacr.org/2018/553

Talk: https://www.youtube.com/watch?v=i4u57MvpCC4

Slides: https://crypto.iacr.org/2018/slides/28852.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .