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.
CITATION STYLE
Jaeger, J., & Stepanovs, I. (2018). Optimal channel security against fine-grained state compromise: The safety of messaging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10991 LNCS, pp. 33–62). Springer Verlag. https://doi.org/10.1007/978-3-319-96884-1_2
Mendeley helps you to discover research relevant for your work.