The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol

被引:86
作者
Alwen, Joel [2 ]
Coretti, Sandro [1 ]
Dodis, Yevgeniy [1 ]
机构
[1] NYU, New York, NY USA
[2] Wickr Inc, San Francisco, CA 94111 USA
来源
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT I | 2019年 / 11476卷
基金
欧洲研究理事会; 美国国家科学基金会;
关键词
D O I
10.1007/978-3-030-17653-2_5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Signal is a famous secure messaging protocol used by billions of people, by virtue of many secure text messaging applications including Signal itself, WhatsApp, Facebook Messenger, Skype, and Google Allo. At its core it uses the concept of "double ratcheting," where every message is encrypted and authenticated using a fresh symmetric key; it has many attractive properties, such as forward security, post-compromise security, and " immediate (no-delay) decryption," which had never been achieved in combination by prior messaging protocols. While the formal analysis of the Signal protocol, and ratcheting in general, has attracted a lot of recent attention, we argue that none of the existing analyses is fully satisfactory. To address this problem, we give a clean and general definition of secure messaging, which clearly indicates the types of security we expect, including forward security, post-compromise security, and immediate decryption. We are the first to explicitly formalize and model the immediate decryption property, which implies (among other things) that parties seamlessly recover if a given message is permanently lost-a property not achieved by any of the recent "provable alternatives to Signal." We build a modular "generalized Signal protocol" from the following components: (a) continuous key agreement (CKA), a clean primitive we introduce and which can be easily and generically built from public-key encryption (not just Diffie-Hellman as is done in the current Signal protocol) and roughly models "public-key ratchets;" (b) forward-secure authenticated encryption with associated data (FS-AEAD), which roughly captures "symmetric-key ratchets;" and (c) a two-input hash function that is a pseudorandom function (resp. generator with input) in its first (resp. second) input, which we term PRF-PRNG. As a result, in addition to instantiating our framework in a way resulting in the existing, widely-used Diffie-Hellman based Signal protocol, we can easily get post-quantum security and not rely on random oracles in the analysis.
引用
收藏
页码:129 / 158
页数:30
相关论文
共 27 条
[1]  
Alkim E, 2016, PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, P327
[2]  
Alwen J., 2018, 20181037 CRYPT EPRIN
[3]  
[Anonymous], 2017, WhatsApp
[4]  
Bellare M, 2003, LECT NOTES COMPUT SC, V2612, P1
[5]   Ratcheted Encryption and Key Exchange: The Security of Messaging [J].
Bellare, Mihir ;
Singh, Asha Camper ;
Jaeger, Joseph ;
Nyayapati, Maya ;
Stepanovs, Igors .
ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT III, 2017, 10403 :619-650
[6]  
Borisov N., 2004, Proceedings of the 2004 AC M Workshop on Privacy in the Electronic Society, DOI [10.1145/1029179.1029200, DOI 10.1145/1029179.1029200]
[7]  
Bos J.W., 2017, IACR Cryptology ePrint Archive, V2017, P634
[8]   A Formal Security Analysis of the Signal Messaging Protocol [J].
Cohn-Gordon, Katriel ;
Cremers, Cas ;
Dowling, Benjamin ;
Garratt, Luke ;
Stebila, Douglas .
2017 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P), 2017, :451-466
[9]   On Post-Compromise Security [J].
Cohn-Gordon, Katriel ;
Cremers, Cas ;
Garratt, Luke .
2016 IEEE 29TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2016), 2016, :164-178
[10]   Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange [J].
Derler, David ;
Jager, Tibor ;
Slamanig, Daniel ;
Striecks, Christoph .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT III, 2018, 10822 :425-455