SoK: Secure Messaging
Authors:
- Nik UngerNUNik Unger
- Sergej DechandSDSergej Dechand
- Joseph BonneauJBJoseph Bonneau
- Sascha FahlSFSascha Fahl
- Henning PerlHPHenning Perl
- Ian GoldbergIGIan Goldberg
- Matthew SmithMSMatthew Smith
- 1 May 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10816011,p. 232-249
Abstract
Motivated by recent revelations of widespread state surveillance of personal communication, many solutions now claim to offer secure and private messaging. This includes both a large number of new projects and many widely adopted tools that have added security features. The intense pressure in the past two years to deliver solutions quickly has resulted in varying threat models, incomplete objectives, dubious security claims, and a lack of broad perspective on the existing cryptographic literature on secure communication. In this paper, we evaluate and systematize current secure messaging solutions and propose an evaluation framework for their security, usability, and ease-of-adoption properties. We consider solutions from academia, but also identify innovative and promising approaches used "in-the-wild" that are not considered by the academic literature. We identify three key challenges and map the design landscape for each: trust establishment, conversation security, and transport privacy. Trust establishment approaches offering strong security and privacy features perform poorly from a usability and adoption perspective, whereas some hybrid approaches that have not been well studied in the academic literature might provide better trade-offs in practice. In contrast, once trust is established, conversation security can be achieved without any user involvement in most two-party conversations, though conversations between larger groups still lack a good solution. Finally, transport privacy appears to be the most difficult problem to solve without paying significant performance penalties.Keywords
This publication has 38 references indexed in Scilit:
- Why Doesn’t Jane Protect Her Privacy?2014
- Investigating the OpenPGP Web of Trust2011
- Composability and On-Line Deniability of AuthenticationLecture Notes in Computer Science, 2009
- A Protocol for Secure Public Instant MessagingLecture Notes in Computer Science, 2006
- Modular Security Proofs for Key Agreement Protocols2005
- A fair and efficient solution to the socialist millionaires’ problemDiscrete Applied Mathematics, 2001
- Anonymous connections and onion routingIEEE Journal on Selected Areas in Communications, 1998
- Deniable Encryption1997
- Proving Without Knowing: On Oblivious, Agnostic and Blindfolded ProversLecture Notes in Computer Science, 1996
- Authentication and authenticated key exchangesDesigns, Codes and Cryptography, 1992