Measuring and Applying Invalid SSL Certificates: the Silent Majority

Total Page:16

File Type:pdf, Size:1020Kb

Load more

Measuring and Applying Invalid SSL Certificates: The Silent Majority Taejoong Chung∗ Yabing Liu∗ David Choffnes∗ Dave Leviny Bruce M. Maggsz Alan Mislove∗ Christo Wilson∗ ∗Northeastern University y University of Maryland z Duke University and Akamai Technologies ABSTRACT 1. INTRODUCTION SSL and TLS are used to secure the most commonly- Secure Sockets Layer (SSL) and Transport Layer Se- used Internet protocols. As a result, the ecosystem of curity (TLS)1 are responsible for securing Internet traf- SSL certificates has been thoroughly studied, leading fic for a variety of common protocols (HTTP, SMTP, to a broad understanding of the strengths and weak- IMAP, etc.). Coupled with a Public Key Infrastructure nesses of the certificates accepted by most web browsers. (PKI), SSL provides authenticated identities via certifi- Prior work has naturally focused almost exclusively on cate chains and private communication via encryption. \valid" certificates|those that standard browsers ac- The web's SSL certificate ecosystem has been stud- cept as well-formed and trusted|and has largely disre- ied extensively [13, 14, 17, 25, 30, 53], with the broad garded certificates that are otherwise \invalid." Surpris- goal of better understanding how resilient websites and ingly, however, this leaves the majority of certificates browsers are to attacks on end-to-end authentication unexamined: we find that, on average, 65% of SSL cer- and confidentiality. As such, the vast majority of these tificates advertised in each IPv4 scan that we examine studies (we discuss some exceptions in x3) naturally fo- are actually invalid. cus on the valid certificates found on the web, that is, In this paper, we demonstrate that despite their inva- the certificates that are well-formed, are within their lidity, much can be understood from these certificates. validity periods, have a certificate chain that verifies Specifically, we show why the web's SSL ecosystem is at each level, and are rooted in a widely-trusted set of populated by so many invalid certificates, where they root certificates [8]. The prior studies focused almost originate from, and how they impact security. Using a exclusively on valid certificates because, after all, if a dataset of over 80M certificates, we determine that most certificate is not valid, one cannot confidently attribute invalid certificates originate from a few types of end- it to the websites under study. user devices, and possess dramatically different proper- In this paper, we take another look at the SSL cer- ties than their valid counterparts. We find that many of tificate ecosystem, focusing not only on the valid cer- these devices periodically reissue their (invalid) certifi- tificates, but also the invalid ones. Using a dataset cates, and develop new techniques that allow us to track of over 80M certificates collected from 222 full IPv4 these reissues across scans. We present evidence that scans over three years, we find, surprisingly, that almost this technique allows us to uniquely track over 6.7M de- 88% of certificates we observe across all these IPv4-wide vices. Taken together, our results open up a heretofore scans are invalid. In other words, most prior studies of largely-ignored portion of the SSL ecosystem to further the SSL certificate ecosystem have focused on a mere study. 12% of the overall space of SSL certificates. The broad goal of this paper is to understand why so much of the web's PKI consists of invalid certificates, to evaluate from where these certificates originate, to understand the security implications of these certificates, and to Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or demonstrate the value in this long-overlooked portion distributed for profit or commercial advantage and that copies bear this notice of the certificate ecosystem. and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is We make the following contributions. First, we per- permitted. To copy otherwise, or republish, to post on servers or to redistribute to form a study of all invalid SSL certificates collected from lists, requires prior specific permission and/or a fee. Request permissions from full IPv4 port 443 scans over three years. We find that [email protected]. invalid certificates have considerable differences from IMC 2016, November 14–16, 2016, Santa Monica, CA, USA c 2016 Copyright held by the owner/author(s). Publication rights licensed to 1TLS is the successor of SSL, but both use the same cer- ACM. ISBN 978-1-4503-4526-2/16/11. $15.00 tificates. We refer to \SSL certificates," but our findings apply DOI: http://dx.doi.org/10.1145/2987443.2987454 equally to both. their valid counterparts in terms of validity periods, life- certificates, starting from a root certificate through zero times, expiration dates, and sharing of public keys. or more intermediate certificates, to a leaf certificate. Second, we evaluate the origins of these invalid certifi- Each certificate is signed with the private key corre- cates, and find that they largely originate from users' sponding to the certificate in the higher level, except end-devices, including wireless access points, printers, the self-signed root certificate. When a client connects VoIP phones, and cable modems (for which the cer- to an HTTPS-secured site, it must verify that the cer- tificates are used to enable \secure" remote administra- tificate advertised by the server is valid. tion). Moreover, we find that invalid certificates tend On the Internet, X.509 [8] is the most commonly to be advertised by many fewer hosts, and that they are used certificate management standard. X.509 certifi- advertised in a very different portion of the IP address cates typically include a subject and public key, a serial space than valid certificates. number (unique for the issuer), a validity period, ac- Third, we find that many of these devices periodi- ceptable usage of the key, and ways to check whether cally reissue new (invalid) certificates, and we evalu- the certificate has been revoked [30]. ate the behavior of such reissues. Tracking reissues of invalid certificates proves to be considerably more dif- Invalid certificates. The X.509 RFC [8] defines a cer- ficult than for valid ones, as invalid certificates often tificate as invalid if a client is unable to validate it at have non-unique Common Names or modify their Common some point in time. There are multiple reasons that Name on each reissue (whereas a valid website generally a client could find a certificate to be invalid: it could maintains its domain name as its Common Name in all of be outside of its validity period, it could have been re- its certificates). We develop a set of techniques that al- voked by its CA, its subject could be incorrect, its sig- low us to link multiple invalid certificates that are likely nature could be wrong, and so on. Because our dataset to come from a single device. spans years (x4), we define a certificate as invalid if no Fourth, applying our techniques to link together dif- client with a standard set of root certificates would ever ferent certificates, we demonstrate that invalid certifi- be able to validate it (i.e., we ignore expiry warnings). cates can be used as a means to track millions of user The most common reason for invalidity that we have devices as they change IP addresses. Our techniques observed is certificates signed by an unknown or un- offer a complementary view to those provided by other trusted root; if the client does not trust the root of a device-tracking schemes [1, 2, 40, 47] in that our tech- certificate chain, it transitively does not trust the rest niques do not require us to recruit users, and can be of the chain. Specifically, in our dataset, we found that performed at scale; we show that we are able to track 88.0% of invalid certificates are self-signed (i.e., the root 6.7M unique end-user devices for over a year. of the chain is the leaf certificate itself) and a further We make all of our code and data publicly available 11.99% are signed by a different, untrusted certificate to the research community at (i.e., the root of the chain is some other certificate that is not in the set of trusted root certificates).2 https://securepki.org Internet-connected devices. Internet-connected de- The remainder of this paper is organized as follows: vices are widely popular today, including end-user we provide background in x2 and an overview of related routers, printers, cable/DSL modems, IP cameras, VoIP work in x3. We describe our dataset and methodology telephones, thermostats, and network-attached storage in x4. In x5, we evaluate the properties of the invalid devices. Many of these devices provide a web server to certificates and compare them to those of valid certifi- allow end users to access and manage the device. A cates. We present and evaluate our methodology for recent trend is to enable both HTTP and HTTPS ver- detecting reissues of invalid certificates in x6. In x7, we sions of this web server; devices that do so need an SSL explore using our techniques to track end-user devices, certificate for the HTTPS site. and we conclude in x8. While some devices allow users to upload a certificate, we find that most generate and use an invalid certificate 2. BACKGROUND by default. There are several reasons for this behavior. SSL and TLS now secure the vast majority of online First, until recently [31], obtaining valid SSL certifi- communication.
Recommended publications
  • Fast Elliptic Curve Cryptography in Openssl

    Fast Elliptic Curve Cryptography in Openssl

    Fast Elliptic Curve Cryptography in OpenSSL Emilia K¨asper1;2 1 Google 2 Katholieke Universiteit Leuven, ESAT/COSIC [email protected] Abstract. We present a 64-bit optimized implementation of the NIST and SECG-standardized elliptic curve P-224. Our implementation is fully integrated into OpenSSL 1.0.1: full TLS handshakes using a 1024-bit RSA certificate and ephemeral Elliptic Curve Diffie-Hellman key ex- change over P-224 now run at twice the speed of standard OpenSSL, while atomic elliptic curve operations are up to 4 times faster. In ad- dition, our implementation is immune to timing attacks|most notably, we show how to do small table look-ups in a cache-timing resistant way, allowing us to use precomputation. To put our results in context, we also discuss the various security-performance trade-offs available to TLS applications. Keywords: elliptic curve cryptography, OpenSSL, side-channel attacks, fast implementations 1 Introduction 1.1 Introduction to TLS Transport Layer Security (TLS), the successor to Secure Socket Layer (SSL), is a protocol for securing network communications. In its most common use, it is the \S" (standing for \Secure") in HTTPS. Two of the most popular open- source cryptographic libraries implementing SSL and TLS are OpenSSL [19] and Mozilla Network Security Services (NSS) [17]: OpenSSL is found in, e.g., the Apache-SSL secure web server, while NSS is used by Mozilla Firefox and Chrome web browsers, amongst others. TLS provides authentication between connecting parties, as well as encryp- tion of all transmitted content. Thus, before any application data is transmit- ted, peers perform authentication and key exchange in a TLS handshake.
  • Dynamic Public Key Certificates with Forward Secrecy

    Dynamic Public Key Certificates with Forward Secrecy

    electronics Article Dynamic Public Key Certificates with Forward Secrecy Hung-Yu Chien Department of Information Management, National Chi Nan University, Nantou 54561, Taiwan; [email protected] Abstract: Conventionally, public key certificates bind one subject with one static public key so that the subject can facilitate the services of the public key infrastructure (PKI). In PKI, certificates need to be renewed (or revoked) for several practical reasons, including certificate expiration, private key breaches, condition changes, and possible risk reduction. The certificate renewal process is very costly, especially for those environments where online authorities are not available or the connection is not reliable. A dynamic public key certificate (DPKC) facilitates the dynamic changeover of the current public–private key pairs without renewing the certificate authority (CA). This paper extends the previous study in several aspects: (1) we formally define the DPKC; (2) we formally define the security properties; (3) we propose another implementation of the Krawczyk–Rabin chameleon-hash- based DPKC; (4) we propose two variants of DPKC, using the Ateniese–Medeiros key-exposure-free chameleon hash; (5) we detail two application scenarios. Keywords: dynamic public key certificate; chameleon signature; certificate renewal; wireless sensor networks; perfect forward secrecy 1. Introduction Citation: Chien, H.-Y. Dynamic Certificates act as the critical tokens in conventional PKI systems. With the trust Public Key Certificates with Forward of the CA, a
  • SSL Checklist for Pentesters

    SSL Checklist for Pentesters

    SSL Checklist for Pentesters Jerome Smith BSides MCR, 27th June 2014 # whoami whoami jerome • Pentester • Author/trainer – Hands-on technical – Web application, infrastructure, wireless security • Security projects – Log correlation – Dirty data – Incident response exercises • Sysadmin • MSc Computing Science (Dist) • www.exploresecurity.com | @exploresecurity Introduction • Broad review of SSL/TLS checks – Viewpoint of pentester – Pitfalls – Manually replicating what tools do (unless you told the client that SSL Labs would be testing them ) – Issues to consider reporting (but views are my own) • While SSL issues are generally low in priority, it’s nice to get them right! • I’m not a cryptographer: this is all best efforts SSLv2 • Flawed, e.g. no handshake protection → MITM downgrade • Modern browsers do not support SSLv2 anyway – Except for IE but it’s disabled by default from IE7 – That mitigates the risk these days – http://en.wikipedia.org/wiki/Transport_Layer_Security#W eb_browsers • OpenSSL 1.0.0+ doesn’t support it – Which means SSLscan won’t find it – General point: tools that dynamically link to an underlying SSL library in the OS can be limited by what that library supports SSLv2 • Same scan on different OpenSSL versions: SSLv2 • testssl.sh warns you – It can work with any installed OpenSSL version • OpenSSL <1.0.0 s_client -ssl2 switch – More on this later • Recompile OpenSSL – http://blog.opensecurityresearch.com/2013/05/fixing-sslv2-support- in-kali-linux.html • SSLyze 0.7+ is statically linked – Watch out for bug https://github.com/iSECPartners/sslyze/issues/73
  • Sicherheit in Kommunikationsnetzen (Network Security)

    Sicherheit in Kommunikationsnetzen (Network Security)

    Sicherheit in Kommunikationsnetzen (Network Security) Transport Layer Security Dr.-Ing. Matthäus Wander Universität Duisburg-Essen Transport Layer Security (TLS) PrivateTLS data Web browser Web server ∙ Cryptographic protocol ∘ Provides security on top of reliable transport (TCP) ∘ Used to secure HTTP, SMTP, IMAP, XMPP and others ∙ Security goals ∘ Authentication of server and optionally client ∘ Data integrity (no manipulation of data) ∘ Confidentiality (encryption) Universität Duisburg-Essen Matthäus Wander 2 Verteilte Systeme History ∙ Predecessor: Secure Sockets Layer (SSL) ∘ Developed by Netscape for HTTPS (= HTTP + SSL) ∙ 1994: SSL 2.0 ∘ Insecure, major security weaknesses ∙ 1995: SSL 3.0 ∘ Insecure, deprecated since 2015 (RFC 7568) ∙ 1999: TLS 1.0, minor improvements to SSL 3.0 ∘ Standardization and further development by IETF Universität Duisburg-Essen Matthäus Wander 3 Verteilte Systeme History ∙ 2003: TLS Extensions ∘ New features or security mechanisms (e.g. Encrypt-then-MAC, RFC 7366) ∙ 2006: TLS 1.1 ∘ Security improvements ∙ 2008: TLS 1.2 Presented in this lecture ∘ Added new or replaced old cryptographic algorithms ∙ TLS 1.3 is work in progress as of 2017 ∘ Outlook: new handshake and other major changes Universität Duisburg-Essen Matthäus Wander 4 Verteilte Systeme Protocol Overview Application Layer (e.g. HTTP) Handshake Change Cipher Application Alert Protocol Protocol Spec Protocol Data Protocol Record Protocol Transport Layer (e.g. TCP) ∙ TLS consists of two layers: ∘ Handshake Protocol and other protocols ∘ Record Protocol
  • Prying Open Pandora's Box: KCI Attacks Against

    Prying Open Pandora's Box: KCI Attacks Against

    Prying open Pandora’s box: KCI attacks against TLS Clemens Hlauschek, Markus Gruber, Florian Fankhauser, Christian Schanes RISE – Research Industrial Systems Engineering GmbH {clemens.hlauschek, markus.gruber, florian.fankhauser, christian.schanes}@rise-world.com Abstract and implementations of the protocol: their utility is ex- tremely limited, their raison d’ˆetre is practically nil, and Protection of Internet communication is becoming more the existence of these insecure key agreement options common in many products, as the demand for privacy only adds to the arsenal of attack vectors against cryp- in an age of state-level adversaries and crime syndi- tographically secured communication on the Internet. cates is steadily increasing. The industry standard for doing this is TLS. The TLS protocol supports a multi- 1 Introduction tude of key agreement and authentication options which provide various different security guarantees. Recent at- The TLS protocol [1, 2, 3] is probably the most tacks showed that this plethora of cryptographic options widely used cryptographic protocol on the Internet. in TLS (including long forgotten government backdoors, It is designed to secure the communication between which have been cunningly inserted via export restric- client/server applications against eavesdropping, tamper- tion laws) is a Pandora’s box, waiting to be pried open by ing, and message forgery, and it also provides additional, heinous computer whizzes. Novel attacks lay hidden in optional security properties such as client authentica- plainsight. Parts of TLS areso oldthat theirfoul smell of tion. TLS is an historically grown giant: its predecessor, rot cannot be easily distinguished from the flowery smell SSL [4,5], was developed more than 20 years ago.
  • IT Security Guidelines for Transport Layer Security (TLS)

    IT Security Guidelines for Transport Layer Security (TLS)

    IT Security Guidelines for Transport Layer Security (TLS) National Cyber Security Centre The National Cyber Security Centre (NCSC), in collaboration with The following organizations and individuals have provided the business community, government bodies and academics, is valuable contributions: working to increase the ability of Dutch society to defend itself in - Autoriteit Persoonsgegevens the digital domain. - Belastingdienst - Centric The NCSC supports the central government and organisations in - Dienst Publiek en Communicatie the critical infrastructure sectors by providing them with expertise - Forum Standaardisatie and advice, incident response and with actions to strengthen crisis - IBD management. In addition, the NCSC provides information and - KPN advice to citizens, the government and the business community - NLnet Labs relating to awareness and prevention. The NCSC thus constitutes - Northwave the central reporting and information point for IT threats and - Platform Internetstandaarden security incidents. - RDW - SURFnet These IT Security Guidelines for Transport Layer Security were frst - de Volksbank published by the NCSC in 2014. This update (v2.1) was published in - Z-CERT 2021. See the appendix Changes to these guidelines for more details. - Daniel Kahn Gillmor, ACLU This publication was produced in collaboration with the following - Tanja Lange, Eindhoven University of Technology partners: - Kenny Paterson, ETH Zurich - the national communication security agency (NBV), part of the - Rich Salz, Akamai Technologies general
  • Forward Secrecy of SPAKE2

    Forward Secrecy of SPAKE2

    Forward Secrecy of SPAKE2 Jos´eBecerra, Dimiter Ostrev, and Marjan Skrobotˇ University of Luxembourg Interdisciplinary Centre for Security, Reliability and Trust 6, Avenue de la Fonte, L-4364, Esch-sur-Alzette, Luxembourg fjose.becerra, dimiter.ostrev, [email protected] Abstract. Currently, the Simple Password-Based Encrypted Key Ex- change (SPAKE2) protocol of Abdalla and Pointcheval (CT-RSA 2005) is being considered by the IETF for standardization and integration in TLS 1.3. Although it has been proven secure in the Find-then-Guess model of Bellare, Pointcheval and Rogaway (EUROCRYPT 2000), whether it satisfies some notion of forward secrecy remains an open question. In this work, we prove that the SPAKE2 protocol satisfies the so-called weak forward secrecy introduced by Krawczyk (CRYPTO 2005). Further- more, we demonstrate that the incorporation of key-confirmation codes in SPAKE2 results in a protocol that provably satisfies the stronger no- tion of perfect forward secrecy. As forward secrecy is an explicit require- ment for cipher suites supported in the TLS handshake, we believe this work could fill the gap in the literature and facilitate the adoption of SPAKE2 in the recently approved TLS 1.3. Keywords: Provable Security, Password Authenticated Key Exchange, For- ward Secrecy, Common Reference String. 1 Introduction 1.1 SPAKE2 Protocol Password Authenticated Key Exchange (PAKE) protocols allow two users, who only share a password, to agree on a high-entropy session key over a hostile network. The goal is to use the established session key to build a secure channel between the involved parties. The nature of passwords makes PAKEs vulnerable to on-line dictionary attacks, where an adversary tries to impersonate a user by guessing his password, engaging in a protocol execution and verifying if its guess was correct.
  • Matrixssl Developer's Guide

    Matrixssl Developer's Guide

    MatrixSSL Developer’s Guide MatrixSSL 3.2 Overview 1 Who Is This Document For? 1 Documentation Style Conventions 1 Commercial Version Differences 1 Security Considerations 2 SSL vs. TLS 2 Selecting Cipher Suites 2 Authentication Mode 3 Certificates and Private Keys 4 Application Integration Flow 5 ssl_t Structure 5 Initialization 6 Creating a Session 6 Handshaking 7 Communicating Securely With Peers 9 Ending a Session 11 Closing the Library 11 Configurable Features 12 Functionality Defines 12 PeerSec Networks, Inc. 410 Broadway Ave E. #205 Seattle, WA 98102 T 425.646.7850 F 206.501.4366 [email protected] www.peersec.com Debug Configuration 14 SSL Handshaking 16 Handshake Variations 16 Standard Handshake 16 Client Authentication 17 Session Resumption 18 Re-Handshakes 19 PeerSec Networks, Inc. 410 Broadway Ave E. #205 Seattle, WA 98102 T 425.646.7850 F 206.501.4366 [email protected] www.peersec.com Overview This developer’s guide is a general SSL/TLS overview and a MatrixSSL specific integration reference for adding SSL security into an application. Who Is This Document For? • Software developers that are securing applications with MatrixSSL • Anyone wanting to learn more about MatrixSSL • Anyone wanting to learn more about the SSL/TLS protocol Documentation Style Conventions • File names and directory paths are italicized. • C code literals are distinguished with the Monaco font. Commercial Version Differences Some of the compile options, functions, and structures in this document provide additional features only available in the commercially licensed version of MatrixSSL. Sections of this document that refer to the commercial version will be shaded. MatrixSSL Developer’s Guide © 2002-2011 1/19 Security Considerations Prior to working directly with the MatrixSSL library there are a couple SSL security concepts that application integrators should be familiar with.
  • TLS for Internet of Things

    TLS for Internet of Things

    TLS for Internet of Things Illya Gerasymchuk [email protected] Instituto Superior T´ecnico,Lisboa, Portugal May 2019 Abstract Transport Layer Security (TLS) is one of the most used communication security protocols in the world. Its main goal is to provide a secure communication channel with the security services of confidentiality, integrity, authentication, and Perfect Forward Secrecy (PFS). Each security service can be implemented by one of the multiple available algorithms. TLS was not designed for the constrained environment and is too computationally demanding for many Internet Of Things (IoT) devices. However, it is a malleable protocol and individual security services can be enabled and disabled on a per-connection basis. Foregoing a security service or using a cheaper algorithm to implement it reduces the utilized computational resources. The security properties of a connection are defined by a TLS configuration. Some of those configurations can be used with the resource-constrained IoT devices. Existing work focuses on Datagram TLS (DTLS) and is either tied to a specific protocol or requires the usage of a third-party entity. For this reason, it cannot be easily integrated with existing deployments. In this work, we perform a thorough evaluation of the TLS protocol and its security services. We present a framework that can be used by software developers and security professionals to select the cheapest TLS configuration for their environment's needs and limitations. We evaluated the TLS implementation of the mbedTLS library using two cost metrics: the estimated number of CPU cycles, obtained with valgrind, and execution time, obtained with PAPI. In the end, we will show that the estimated values are close to the real ones.
  • On the Effective Prevention of TLS Man-In-The- Middle Attacks in Web

    On the Effective Prevention of TLS Man-In-The- Middle Attacks in Web

    On the Effective Prevention of TLS Man-in-the- Middle Attacks in Web Applications Nikolaos Karapanos and Srdjan Capkun, ETH Zürich https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/karapanos This paper is included in the Proceedings of the 23rd USENIX Security Symposium. August 20–22, 2014 • San Diego, CA ISBN 978-1-931971-15-7 Open access to the Proceedings of the 23rd USENIX Security Symposium is sponsored by USENIX On the Effective Prevention of TLS Man-In-The-Middle Attacks in Web Applications Nikolaos Karapanos and Srdjan Capkun Department of Computer Science, ETH Zurich firstname.lastname @inf.ethz.ch { } Abstract ety of purposes, such as spying on the user [18, 48]. This In this paper we consider TLS Man-In-The-Middle attack is known as TLS Man-In-The-Middle (MITM). (MITM) attacks in the context of web applications, TLS server authentication is commonly achieved where the attacker is able to successfully impersonate through the use of X.509 server certificates. A server cer- the legitimate server to the user, with the goal of imper- tificate binds a public key to the identity of a server, des- sonating the user to the server and thus compromising ignating that this server holds the corresponding private the user’s online account and data. We describe in detail key. The browser accepts a certificate if it bears the signa- why the recently proposed client authentication protocols ture of any trusted Certificate Authority (CA). Browsers based on TLS Channel IDs, as well as client web authen- are typically configured to trust hundreds of CAs.
  • Revisiting SSL: a Large-Scale Study of the Internet's Most Trusted Protocol

    Revisiting SSL: a Large-Scale Study of the Internet's Most Trusted Protocol

    Revisiting SSL: A Large-Scale Study of the Internet's Most Trusted Protocol Johanna Amann*, Matthias Vallentin§, Seth Hall*, and Robin Sommer*ⱡ TR-12-015 December 2012 Abstract Much of the Internet's end-to-end security relies on the SSL protocol along with its underlying certificate infrastructure. We offer an in-depth study of real-world SSL and X.509 deployment characteristics from an unprecedented vantage point, based on a data set of more than 1.4 billion SSL sessions collected at the border of five operational sites. Our contributions are two- fold: First, we revisit results from past work with a recent data set that allows us to reassess previous findings and identify recent trends. Second, we provide a detailed study on a range of further SSL/X.509 deployment properties that have not yet seen the attention they deserve, including the intricate web of intermediate certificate authority (CA) relationships, characteristics of SSL session reuse, usage of vendor-specific protocol extensions, and non- standard CA root hierarchies. While in general we find that today's SSL deployment functions well, we also identify new support for the inherent weaknesses of the system. Along the way, we gain deep insight into specifics and oddities of SSL/X.509 usage, including a surprising difficulty of aligning certificate validation with what typical browsers do. *International Computer Science Institute, 1947 Center Street, Suite 600, Berkeley, California, 94704 § University California, Berkeley, 2200 University Drive, Berkeley, California 94720 ⱡ Lawrence Berkeley National Laboratory, 1 Cyclotron Road, Berkeley, California, 94720 This work was partially funded by the Deutscher Akademischer Austausch Dienst (DAAD) through a postdoctoral fellowship.
  • A Modern View on Forward Security∗

    A Modern View on Forward Security∗

    A Modern View on Forward Security∗ Colin Boyd1 and Kai Gellert2 1NTNU, Norwegian University of Science and Technology, Trondheim, Norway, [email protected] 2University of Wuppertal, Wuppertal, Germany, [email protected] Abstract Forward security ensures that compromise of entities today does not impact the security of cryptographic primitives employed in the past. Such a form of security is regarded as increasingly important in the modern world due to the existence of adversaries with mass storage capabilities and powerful infiltration abilities. Although the idea of forward security has been known for over 30 years, current understanding of what it really should mean is limited due to the prevalence of new techniques and inconsistent terminology. We survey existing methods for achieving forward security for different cryptographic primitives and propose new definitions and terminology aimed at a unified treatment of the notion. 1 Introduction Providing confidentiality to sensitive data is a standard property of encryption schemes. With- out knowledge of the decryption key, an observing adversary should not be able to decrypt any encrypted traffic. Nowadays, in the presence of powerful nation-state adversaries that establish Internet surveillance programs, achieving the necessary security for sensitive data has become more challenging. Even if Internet traffic is encrypted, a resourceful adversary could collect encrypted traffic on a massive scale and store it in dedicated data centres. Should a decryption key be compromised at a later point in time, for example by database breaches or by application of legislative means in various jurisdictions, the respective encrypted traffic could be decrypted again. It is therefore evident that encryption protocols should take into account the threat from adversaries who may practise mass-storage of encrypted data.