Benjamin Richard Prepar´ Ee´ A` L’Institut De Recherche En Informatique Et Systemes´ Aleatoires´ (IRISA), UMR No6074

Total Page:16

File Type:pdf, Size:1020Kb

Benjamin Richard Prepar´ Ee´ A` L’Institut De Recherche En Informatique Et Systemes´ Aleatoires´ (IRISA), UMR No6074 ANNEE´ 2017 THESE` / UNIVERSITE´ DE RENNES 1 sous le sceau de l’Universite´ Bretagne Loire pour le grade de DOCTEUR DE L’UNIVERSITE´ DE RENNES 1 Mention : Informatique Ecole doctorale MATISSE present´ ee´ par Benjamin Richard prepar´ ee´ a` l’Institut de Recherche en Informatique et Systemes´ Aleatoires´ (IRISA), UMR no6074 These` soutenue a` Rennes Etude´ des protocoles le 30 Aout 2017 devant le jury compose´ de : d’authentification et Michel FERREIRA ABDALLA Directeur de recherches, CNRS/ENS (rapporteur) de derivation´ de clefs Refik MOLVA Professeur, EURECOM (rapporteur) en 3 parties. Fred´ eric´ CUPPENS Professeur, IMT Atlantique Rennes (examinateur) Gilles MACARIO-RAT Chercheur, Orange Labs Chatillon (examinateur) Maria Cristina ONETE PostDoc, U. Rennes1 (examinateur) Jacques TRAORE Chercheur, Orange Labs Caen (examinateur) Pierre-Alain FOUQUE Professeur, U. Rennes1 (directeur de these)` 2 3 Remerciements En premier lieu, je tiens a` remercier mon directeur de these,` Pierre-Alain Fouque, pour son soutien, sa patience et son aide au quotidien. Au dela` de ses indispensables qualites´ scientifiques dont j’ai pu ben´ eficier´ durant mes 3 annees´ de these,` je tiens a` le remercier pour cette experience,´ qui a su m’aider a` grandir aussi bien d’un point de vue personnel que professionnel. Merci egalement´ a` Maria Cristina Onete, de s’etreˆ jointe a` cette these,` pour son soutien au quotidien, et pour les nombreuses discussions qu’on a pu avoir ensemble. Je remercie aussi Gilles Macario-rat pour m’avoir encadre´ au sein d’Orange, d’avoir accepte´ de me suivre et de m’avoir fait confiance durant mon changement de sujet de these.` Je tiens ensuite a` remercier l’ensemble des membres du jury d’avoir accepte´ de participer a` ce jury. Un merci tout particulier a` Michel Ferreira Abdalla et Refik Molva d’avoir accepte´ d’etreˆ les rapporteurs de cette these.` Je voudrai egalement´ remercier Jannick Dreier et Steve Kraemer, pour m’avoir accueilli a` titre occasionnel dans les locaux du Loria a` Nancy. Merci a` eux pour leurs disponibilites´ et pour les echanges´ toujours tres` productifs et interessants´ que nous avons eu ensemble. Je tiens a` remercier l’ensemble de l’equipe´ DSS d’Orange Labs pour m’avoir accueilli durant ces trois annees´ de these.` Un merci particulier a` Pascal pour avoir essaye´ en vain de recadrer mes gouts cinematographiques,´ Todor pour avoir su mettre un peu de lumiere` dans le monde de la standardisation, Alex pour nos nombreuses parties de basket et nos debriefings´ de l’actualite´ sportive, et surtout Tiphaine, ma responsable de stage de 3ieme` pref´ er´ ee.´ Merci aux autres thesards´ de galere` (Xiao, Maxime) a` qui je souhaite bon courage pour la suite. Merci a` tous les autres Xavier, Ghada, Said, Kahina, Michael, Matthieu ... d’avoir participe´ quotidiennement a` la bonne ambiance de cette equipe.´ Une petite pensee´ aux anciens Laura, Georgian, Aurelien,´ Pierre, Amira, Nizar, Wafa avec qui j’ai pu avoir a` la fois des conversations serieuses´ et prolifiques, mais aussi des fou-rires tres` agreables.´ Merci aussi a` tous les autres que je n’ai pas cite,´ mais qui etaient´ present´ au quotidien ! Merci a` l’ensemble des membres de l’equipe´ EMSEC de l’IRISA pour leur accueil et pour la bonne ambiance qu’ils ont su instaurer au sein de nos bureaux. Je tiens a` remercier l’ensemble du groupe des thesards´ made in EMSEC : Alban le roi des Spares au bowling, Baptiste mon el´ eve` de beaufitude pref´ er´ e,´ Chen mon portugais pref´ er´ e,´ Claire une des pilieres` de la pause cafe,´ Pauline la bordelaise de service, Florent et ses ”pourquoi pas” quand vous lui proposez a` manger, et Raphael¨ le taulier du jeudi soir. Merci aussi aux titulaires, Patrick le serieux´ du Badminton, Stephanie´ qui sait organiser des soirees´ barbecue a` merveille, et Adeline pour son aide et son soutien. Petite pensee´ a` l’ancien, Brice Minaud, sa presence´ au badminton et sa sympathie quotidienne nous manque a` tous, et a` la petite nouvelle, Angele,` qui je suis sur, s’epanouira´ a` merveille dans cette equipe.´ Merci a` toi Cyrille, le meilleur co-bureau qu’un thesard´ puisse esperer.´ Merci mon ami pour toute l’aide que tu m’as apporte,´ nos fou-rires et nos chants. La meilleure ambiance etait´ chez nous a` ne pas en douter :p Ah oui, merci aussi d’avoir supporter les 30 degres´ que j’imposai reguli´ erement` dans notre bureau. Je tiens a` present´ a` remercier ma famille pour leur aide et leur soutien. Un remerciement tout particulier a` Thomas et Charlotte. Vous m’avez offert plus qu’un canape´ pour dormir durant ces trois annees.´ Merci a` vous mes parents, sans vous je ne serai pas l’homme que je suis aujourd’hui. Je vous dois beaucoup, et je vous en serai eternellement´ reconnaissant. Merci a` toi mon amour, Kun, d’avoir su repondre´ present´ pendant les moments de doutes. Cette these` nous a permis de nous rencontrer, et rien que pour cela cette these` valait le coup d’etreˆ vecue.´ Cette these` prend fin mais en ce qui nous concerne, ce n’est que le debut...´ 4 Resum´ e´ en franc¸ais Protocoles AKE La transmission de donnees´ personnelles entre deux entites´ a` travers un canal non securis´ e´ comme Internet ou les voix radios au sein des reseaux´ mobiles, est l’un des enjeux majeurs en cryptogra- phie. L’etablissement´ d’un canal securis´ e´ permet d’echanger´ des donnees´ sensibles en garantissant leurs confidentialites´ et integrit´ es´ durant leurs echanges.´ Dans le but de garantir ses propriet´ es,´ l’utilisation de primitives cryptographiques tels que des algorithmes de chiffrement authentifie,´ est requise. Ses algorithmes necessitent´ que les deux entites´ possedent` une clef secrete` commune. Par consequent,´ un echange´ au prealable´ de clefs entre les deux entites´ doit etreˆ effectue´ entre les deux entites´ afin d’etablir´ le canal securis´ e.´ L’etablissement´ d’un canal securis´ e´ se repose sur l’execution´ d’un protocole d’echange´ de clefs authentifies,´ appele´ AKE (Authenticated Key Exchange). Propriet´ es´ de securit´ e´ classiques. Les protocoles AKE execut´ es´ entre deux entites´ doivent garan- tir l’etablissement´ d’un canal securis´ e,´ a` travers l’echange´ d’une ou plusieurs clefs temporaires (autrement appelees´ clefs de sessions), en considerant´ la presence´ potentielle d’un adversaire de type ”Homme-du-Milieu” (MitM) capable d’observer et d’intercepter l’ensemble des commu- nications entre ses entites.´ Cet attaquant peut etreˆ soit passif (espionnant les communications echang´ ees)´ ou actif (capable de stopper, reordonner´ et injecter les messages de son choix). Con- siderant´ les adversaires de type MitM, les protocoles AKE doivent garantir les propriet´ es´ suivantes: • La confidentialite´ des clefs de sessions echang´ ees´ : un adversaire ne peut pas obtenir la moindre information a` propos des clefs de sessions durant leur etablissement.´ • La confidentialite´ des secrets permanents : un adversaire ne peut pas obtenir la moin- dre information a` propos des informations secretes` permanentes qui sont utilisees´ durant l’execution´ du protocole. • L’authentification : toutes les entites´ qui doivent etreˆ authentifies´ durant le protocole AKE ne peuvent pas etreˆ impersonnifiees´ par un adversaire. • La ”non-rejouabilite”´ des messages : cette propriet´ e´ requit la fraicheur des messages echang´ es´ durant l’execution´ du protocole AKE. Une propriet´ e´ supplementaire´ primordiale : le respect de la vie privee.´ La notion de vie privee´ peut prendre different´ sens, comme le soulignent Pftzmann et Hansen [95]. Dans ce manuscrit, les notions qui seront utilisees,´ sont celles qui sont habituellement utilisees´ pour etudier´ les protocoles d’authentification et de derivations´ de clefs, e.g., la confidentialite´ de donnees´ caracteristiques´ des utilisateurs, et de trac¸abilite.´ Les utilisateurs sont tous caracteris´ es´ par des donnees´ personnelles permanentes qui les caracterisent´ telles qu’un identifiant, des etats,´ une localisation etc. Un pre- mier niveau de respect de la vie privee´ des utilisateurs est garanti par une propriet´ e´ consistant a` assurer la confidentialite´ de l’ensemble de ses donnees.´ Cette propriet´ e´ est essentiellement cap- turee´ par l’incapacite´ pour un attaquant de type ”Homme-du-Milieu” d’obtenir de l’information a` 5 6 propos de donnees´ caracteristiques´ des utilisateurs. La non trac¸abilite´ des utilisateurs est la notion la plus forte, qui en plus de considerer´ la confidentialite´ des donnees´ usagers, considere` qu’un attaquant ne peut pas tracer un utilisateur, ce qui est potentiellement possible memeˆ sans avoir des informations sur ses donnees´ permanentes. En effet, par exemple, en reliant certaines informations temporelles, le profil de l’utilisateur pourrait etreˆ retrouve.´ Typiquement, les protocoles AKE requierent` la garantie de non trac¸abilite´ des utilisateurs, qui est globalement definit´ par le fait qu’aucun adversaire n’est capable de distinguer si deux executions´ distinctes du protocole ont implique´ le memeˆ client ou deux clients distincts. Dans ce manuscrit, la non trac¸abilite´ des utilisateurs sera etudi´ ee´ en considerant´ les attaquants de type ”Homme-du-Milieu”. Une garantie plus forte, vus comme un anonymat total des utilisateurs, se base sur le fait que memeˆ un honneteˆ participant ne peut pas tracer l’identite´ des autres participants au sein des communications. Une telle propriet´ e´ pourrait etreˆ atteinte, dans une certaine mesure, si le protocole AKE reposait sur une authentification basee´ sur un groupe, comme
Recommended publications
  • Mihir Bellare Curriculum Vitae Contents
    Mihir Bellare Curriculum vitae August 2018 Department of Computer Science & Engineering, Mail Code 0404 University of California at San Diego 9500 Gilman Drive, La Jolla, CA 92093-0404, USA. Phone: (858) 534-4544 ; E-mail: [email protected] Web Page: http://cseweb.ucsd.edu/~mihir Contents 1 Research areas 2 2 Education 2 3 Distinctions and Awards 2 4 Impact 3 5 Grants 4 6 Professional Activities 5 7 Industrial relations 5 8 Work Experience 5 9 Teaching 6 10 Publications 6 11 Mentoring 19 12 Personal Information 21 2 1 Research areas ∗ Cryptography and security: Provable security; authentication; key distribution; signatures; encryp- tion; protocols. ∗ Complexity theory: Interactive and probabilistically checkable proofs; approximability ; complexity of zero-knowledge; randomness in protocols and algorithms; computational learning theory. 2 Education ∗ Massachusetts Institute of Technology. Ph.D in Computer Science, September 1991. Thesis title: Randomness in Interactive Proofs. Thesis supervisor: Prof. S. Micali. ∗ Massachusetts Institute of Technology. Masters in Computer Science, September 1988. Thesis title: A Signature Scheme Based on Trapdoor Permutations. Thesis supervisor: Prof. S. Micali. ∗ California Institute of Technology. B.S. with honors, June 1986. Subject: Mathematics. GPA 4.0. Class rank 4 out of 227. Summer Undergraduate Research Fellow 1984 and 1985. ∗ Ecole Active Bilingue, Paris, France. Baccalauréat Série C, June 1981. 3 Distinctions and Awards ∗ PET (Privacy Enhancing Technologies) Award 2015 for publication [154]. ∗ Fellow of the ACM (Association for Computing Machinery), 2014. ∗ ACM Paris Kanellakis Theory and Practice Award 2009. ∗ RSA Conference Award in Mathematics, 2003. ∗ David and Lucille Packard Foundation Fellowship in Science and Engineering, 1996. (Twenty awarded annually in all of Science and Engineering.) ∗ Test of Time Award, ACM CCS 2011, given for [81] as best paper from ten years prior.
    [Show full text]
  • Cryptographic Agility in Practice Emerging Use-Cases
    CRYPTOGRAPHIC AGILITY IN PRACTICE EMERGING USE-CASES AUTHORS: Tyson Macaulay Chief Product Officer InfoSec Global Richard Henderson Chief Technology Officer North America InfoSec Global USE CASES WHITEPAPER Summary Cryptography is the bedrock upon which modern data and communications security rests. Cryptography provides the ability to not just keep data and communications confidential, but also underlies virtually all means to establish the identity of people and things in a virtualized world. But cryptography has historically been static: “set and forget”. The world has changed while cryptography has not, and there is a pressing need to move towards dynamically managed and agile cryptographic systems: “cryptographic agility”. Data transparently moves in and out of trusted and untrusted hardware, software, within complex, integrated IoT/IIoT (Internet of Things/Industrial Internet of Things) devices and platforms, and across international borders. Once deployed or implemented, virtually all of these are unable to make changes to their digital identities or the cryptography they use without a hands-on, bespoke process of re-installation, re-configuration, and downtime... if fixes and updates are available at all. What does this mean? For devices and platforms, a cryptographic vulnerability in may require the device be replaced, discarded, or additional in-line infrastructure be deployed to mitigate the threat. For applications and systems, patches must be applied, systems shut down, and expensive human expertise contracted to make it all work. This “static” cryptographic security model has already caused substantial public safety, consumer privacy, financial, and health risks - all associated with device and system vulnerabilities exploited by malicious actors. For now, there are no standards and few tools for the management of cryptography.
    [Show full text]
  • Agile and Versatile Quantum Communication: Signatures and Secrets
    PHYSICAL REVIEW X 11, 011038 (2021) Agile and Versatile Quantum Communication: Signatures and Secrets ‡ † ‡ Stefan Richter ,1,2,*, Matthew Thornton ,3, , Imran Khan,1,2 Hamish Scott ,3 Kevin Jaksch ,1,2 Ulrich Vogl,1,2 Birgit Stiller,1,2 Gerd Leuchs,1,2 Christoph Marquardt,1,2 and Natalia Korolkova 3 1Max Planck Institute for the Science of Light, Staudtstraße 2, 91058 Erlangen, Germany 2Institute of Optics, Information and Photonics, University of Erlangen-Nuremberg, Staudtstraße 7/B2, Erlangen, Germany 3School of Physics and Astronomy, University of St Andrews, North Haugh, St Andrews KY16 9SS, United Kingdom (Received 27 January 2020; revised 24 November 2020; accepted 18 December 2020; published 24 February 2021; corrected 9 March 2021) Agile cryptography allows for a resource-efficient swap of a cryptographic core in case the security of an underlying classical cryptographic algorithm becomes compromised. Conversely, versatile cryptography allows the user to switch the cryptographic task without requiring any knowledge of its inner workings. In this paper, we suggest how these related principles can be applied to the field of quantum cryptography by explicitly demonstrating two quantum cryptographic protocols, quantum digital signatures (QDS) and quantum secret sharing (QSS), on the same hardware sender and receiver platform. Crucially, the protocols differ only in their classical postprocessing. The system is also suitable for quantum key distribution (QKD) and is highly compatible with deployed telecommunication infrastructures, since it uses standard quadrature phase-shift keying encoding and heterodyne detection. For the first time, QDS protocols are modified to allow for postselection at the receiver, enhancing protocol performance. The cryptographic primitives QDS and QSS are inherently multipartite, and we prove that they are secure not only when a player internal to the task is dishonest, but also when (external) eavesdropping on the quantum channel is allowed.
    [Show full text]
  • Quantum Computing Threat: How to Keep Ahead
    Think openly, build securely White paper: Quantum Computing Threat: How to Keep Ahead Ë PQShield Ƕ February 2021 © PQShield Ltd | www.pqshield.com | PQShield Ltd, Oxford, OX2 7HT, UK Cryptographic agility and a clear roadmap to the upcoming NIST standards are key to a smooth and secure transition. 1 Background 1.1 New Cryptography Standards The NIST (U.S. National Institute of Standards and Technology) Post‐Quantum Cryptography (PQC) Project has been running since 2016 and is now in its third, final evaluation round. This project standardizes new key establishment and digital signature algorithms that have been designed to be resistant against attacks by quantum computers. These new algorithms are intended to replace current classical‐security RSA and Elliptic Cryptography (ECDH, ECDSA) standards in applications. The particular mathematical problems that RSA and Elliptic Cryptography are based onareeasy (polynomial‐time solvable) for quantum computers. Unless complemented with quantum‐safe cryptography, this will allow for the forgery of digital signatures (integrity compromise) and de‐ cryption of previously encrypted data (confidentiality compromise) in the future. This is aheight‐ ened risk for organizations that need to secure data for long periods of time; government orga‐ nizations that handle and secure classified information have largely been the drivers ofthepost‐ quantum standardization and its adoption in the field, but banks, financial services, healthcare providers, those developing intellectual property and many others increasingly feel the need to ensure that they can protect their customers and IP – now and in the future. 1.2 Quantum Threat and Post-Quantum Cryptography The current position of NCSC (UK’s National Cyber Security Centre) and NSA (USA’s National Se‐ curity Agency) is that the best mitigation against the threat of quantum computers is quantum‐ safe cryptography, also known as post‐quantum cryptography (PQC).
    [Show full text]
  • Agile Cryptography About & Beyond PKI
    Agile Cryptography About & Beyond PKI June 11, 2018 Dr. Tomislav Nad [email protected] 1 Digital safety relies on cryptography Devices Cloud Transport Servers Surveillance Payment Network Traffic STRONG CRYPTOGRAPHY IS CORE OF SECURITY Confidentiality STRICTLYIntegrity CONFIDENTIAL Authenticity 2 What if foundation becomes in-secure ? 3 Impact of weak crypto is material IMPACT OF WEAK CRYPTOGRAHY Risk Risk Risk Impact Financial Loss Public Safety Data Loss Compliance CRYPTO VULNERABILITY | SHALL IMMEDIATELY BE FIXED 4 Cryptographic failures 5 Malware Flame MD5 Certificates ▪ Discovered 2012, attacks Windows ▪ Components of Flame were signed with a fraudulent certificate, made it appear to have originated from Microsoft ▪ Specific Microsoft certificate still used MD5 as hash function ▪ Malware authors produced a counterfeit copy of the certificate ▪ Rogue certificates demonstrated in 2008 by Sotirov et.al. ▪ MD5 is a cryptographic hash function published in 1992 and broken in 2004 6 DUAL_EC_DRBG RNG with backdoor ▪ Algorithm that was presented as a cryptographically secure pseudorandom number generator ▪ Standardized by ANSI, NIST and ISO ▪ RSA made Dual_EC_DRBG the default CSPRNG in BSAFE ▪ Juniper were using it in their VPN products ▪ Contains a backdoor 7 SHATTERED SHA-1 collisions ▪ SHA-1 is a cryptographic hash function ▪ SHA-1 theoretically broken in 2005 ▪ Since 2005 constant progress towards a practical attack ▪ Officially deprecated by NIST in 2011 ▪ SHA-1 is used everywhere ▪ Digital Certificate signatures ▪ Email
    [Show full text]
  • Transitioning the Use of Cryptographic Algorithms and Key Lengths
    NIST Special Publication 800-131A Revision 2 Transitioning the Use of Cryptographic Algorithms and Key Lengths Elaine Barker Allen Roginsky This publication is available free of charge from: https://doi.org/10.6028/NIST.SP.800-131Ar2 C O M P U T E R S E C U R I T Y NIST Special Publication 800-131A Revision 2 Transitioning the Use of Cryptographic Algorithms and Key Lengths Elaine Barker Allen Roginsky Computer Security Division Information Technology Laboratory This publication is available free of charge from: https://doi.org/10.6028/NIST.SP.800-131Ar2 March 2019 U.S. Department of Commerce Wilbur L. Ross, Jr., Secretary National Institute of Standards and Technology Walter Copan, NIST Director and Under Secretary of Commerce for Standards and Technology Authority This publication has been developed by NIST in accordance with its statutory responsibilities under the Federal Information Security Modernization Act (FISMA) of 2014, 44 U.S.C. § 3551 et seq., Public Law (P.L.) 113-283. NIST is responsible for developing information security standards and guidelines, including minimum requirements for federal information systems, but such standards and guidelines shall not apply to national security systems without the express approval of appropriate federal officials exercising policy authority over such systems. This guideline is consistent with the requirements of the Office of Management and Budget (OMB) Circular A-130. Nothing in this publication should be taken to contradict the standards and guidelines made mandatory and binding on federal agencies by the Secretary of Commerce under statutory authority. Nor should these guidelines be interpreted as altering or superseding the existing authorities of the Secretary of Commerce, Director of the OMB, or any other federal official.
    [Show full text]
  • Hybrid-Key Exchanges As an Interim-To-Permanent Solution to Cryptographic Agility Matthew Campagna Amazon Web Services Agenda
    Hybrid-Key Exchanges as an Interim-to-Permanent Solution to Cryptographic Agility Matthew Campagna Amazon Web Services Agenda Classical cryptographic reasoning Post-quantum cryptography Hybrid key exchange Post-Quantum-s2n Here is what keeps me up at night Record AWS Cloud Client Internet Here is what keeps me up at night Record New capabilities AWS Cloud Client Internet Here is what keeps me up at night Record plaintext data and harvest New capabilities AWS Cloud Client Internet Confidentiality requirement Security of an algorithm The computation complexity of the best known attacks. ! • Defines the bit strength of an algorithm. • Bounds the algorithm security lifetime. O(2n) How assured am I better attacks are not coming? L [a, c] n • How long has this problem been studied? • Who has studied it and what is the published record of that analysis. • No compression of the iterative analyze/discover/disseminate process Best known attacks Best known attack Invented Standardized Widely used Year Attack ECC 1985 1999 2000s 1978 Pollard rho 2" 1/3 FF 1976 1991 1990s 1990 NFS Ln[1/3, (64/9) ] 1/3 RSA 1978 1998 1990s 1990 NFS Ln[1/3, (64/9) ] AES 1998 2001 2005 - Exhaust 2n DES 1975 1977 1980s 1991 Differential cryptanalysis SHA1 - 1995 1990s 2005 Collision < 2" SHA2 2001 2002 2005 - Birthday attack 2" SHA3 2008 2015 ? - Birthday attack 2" ChaCha20 2008 2015 2018 - Exhaust 2n Impact of quantum computing on cryptography Shor’s algorithm (1994): Can solve the discrete log problem (breaking Diffie-Hellman and Elliptic Curve Cryptography), and factor
    [Show full text]
  • Tr 103 619 V1.1.1 (2020-07)
    ETSI TR 103 619 V1.1.1 (2020-07) TECHNICAL REPORT CYBER; Migration strategies and recommendations to Quantum Safe schemes 2 ETSI TR 103 619 V1.1.1 (2020-07) Reference DTR/CYBER-QSC-0013 Keywords quantum safe cryptography ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N° 348 623 562 00017 - NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N° 7803/88 Important notice The present document can be downloaded from: http://www.etsi.org/standards-search The present document may be made available in electronic versions and/or in print. The content of any electronic and/or print versions of the present document shall not be modified without the prior written authorization of ETSI. In case of any existing or perceived difference in contents between such versions and/or in print, the prevailing version of an ETSI deliverable is the one made publicly available in PDF format at www.etsi.org/deliver. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at https://portal.etsi.org/TB/ETSIDeliverableStatus.aspx If you find errors in the present document, please send your comment to one of the following services: https://portal.etsi.org/People/CommiteeSupportStaff.aspx Copyright Notification No part may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying and microfilm except as authorized by written permission of ETSI.
    [Show full text]
  • Measuring and Securing Cryptographic Deployments
    University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 2019 Measuring And Securing Cryptographic Deployments Luke Taylor Valenta University of Pennsylvania, [email protected] Follow this and additional works at: https://repository.upenn.edu/edissertations Part of the Computer Sciences Commons Recommended Citation Valenta, Luke Taylor, "Measuring And Securing Cryptographic Deployments" (2019). Publicly Accessible Penn Dissertations. 3507. https://repository.upenn.edu/edissertations/3507 This paper is posted at ScholarlyCommons. https://repository.upenn.edu/edissertations/3507 For more information, please contact [email protected]. Measuring And Securing Cryptographic Deployments Abstract This dissertation examines security vulnerabilities that arise due to communication failures and incentive mismatches along the path from cryptographic algorithm design to eventual deployment. I present six case studies demonstrating vulnerabilities in real-world cryptographic deployments. I also provide a framework with which to analyze the root cause of cryptographic vulnerabilities by characterizing them as failures in four key stages of the deployment process: algorithm design and cryptanalysis, standardization, implementation, and endpoint deployment. Each stage of this process is error-prone and influenced by various external factors, the incentives of which are not always aligned with security. I validate the framework by applying it to the six presented case studies, tracing each vulnerability back to communication
    [Show full text]
  • Analysis of CAMP Technical Designs for Initial and Final
    Development of DSRC Device and Communication System Performance Measures Recommendations for DSRC OBE Performance and Security Requirements www.its.dot.gov/index.htm Final Report – May 22, 2016 FHWA-JPO-17-483 1.1.1.1.1.1 Produced by Booz Allen Hamilton for the National Highway Traffic Safety Administration U.S. Department of Transportation Notice This document is disseminated under the sponsorship of the Department of Transportation in the interest of information exchange. The United States Government assumes no liability for its contents or use thereof. The U.S. Government is not endorsing any manufacturers, products, or services cited herein and any trade name that may appear in the work has been included only because it is essential to the contents of the work. Technical Report Documentation Page 1. Report No. 2. Government Accession No. 3. Recipient’s Catalog No. FHWA-JPO-17-483 4. Title and Subtitle 5. Report Date Development of DSRC Device and Communication System Performance May 22, 2016 Measures 6. Performing Organization Code Recommendations for DSRC OBE Performance and Security Requirements 7. Author(s) 8. Performing Organization Report No. Ed Adams, Scott Andrews, Mona Asudegi, Seyithan Ayhan, Patrick Chuang, John Collins, Justin Fisher, Dennis Fleming, Larry Frank, Derek Freckleton, Ben Fuja, Dominie Garcia, Stefanie Goodwin, Dwayne Henclewood, Christopher Hill, Raj Kamalanathsharma, Josh Kolleda, Virendra Kumar, Steven Le, Justin McNew, Nick Nahas, Jonathan Petit, Tyler Poling, Kelli Raboy, Ray Resendes, Sara Sarkhili, William Whyte 9. Performing Organization Name And Address 10. Work Unit No. (TRAIS) Booz Allen Hamilton 8283 Greensboro Drive 11. Contract or Grant No.
    [Show full text]
  • Key Reuse, and Cryptographic Agility Joint Security Key Reuse in EMV Cryptographic Agility BC Attacks Concluding Remarks
    Key Separation, Key Reuse, and Cryptographic Agility Joint Security Key Reuse in EMV Cryptographic Agility BC Attacks Concluding Remarks Key Reuse: Theory and Practice Kenny Paterson Royal Holloway, University of London based on joint work with Jean Paul Degabriele, Tibor Jager, Anja Lehmann, Jacob C.N. Schudlt, Nigel P. Smart, Juraj Somorovsky, Martijn Stam, Mario Strefler, Susan Thomson Workshop on Real-World Cryptography Kenny Paterson Royal Holloway, University of London | Key Reuse: Theory and Practice 1/29 Key Separation, Key Reuse, and Cryptographic Agility Joint Security Key Reuse in EMV Cryptographic Agility BC Attacks Concluding Remarks Outline 1 Key Separation, Key Reuse, and Cryptographic Agility 2 Joint Security 3 Key Reuse in EMV 4 Cryptographic Agility 5 BC Attacks 6 Concluding Remarks Kenny Paterson Royal Holloway, University of London | Key Reuse: Theory and Practice 2/29 Key Separation, Key Reuse, and Cryptographic Agility Joint Security Key Reuse in EMV Cryptographic Agility BC Attacks Concluding Remarks Motivation for Key Reuse Reusing an asymmetric key-pair in different primitives can reduce: Storage requirements for certificates and keys; Costs of key certification; Net certificate verification time; Footprint of cryptographic code and development effort. ::: but breaks the key separation principle of using different keys for different purposes. Kenny Paterson Royal Holloway, University of London | Key Reuse: Theory and Practice 3/29 Key Separation, Key Reuse, and Cryptographic Agility Joint Security Key Reuse in EMV Cryptographic Agility BC Attacks Concluding Remarks Motivation for Key Reuse Reusing an asymmetric key-pair in different primitives can reduce: Storage requirements for certificates and keys; Costs of key certification; Net certificate verification time; Footprint of cryptographic code and development effort.
    [Show full text]
  • TLS) Protocol Configurations
    National Security Agency | Cybersecurity Information Eliminating Obsolete Transport Layer Security (TLS) Protocol Configurations Executive summary1 The National Security Agency (NSA) emphatically recommends replacing obsolete protocol configurations with ones that utilize strong encryption and authentication to protect all sensitive information. Over time, new attacks against Transport Layer Security (TLS) and the algorithms it uses have been discovered. Network connections employing obsolete protocols are at an elevated risk of exploitation by adversaries. Sensitive and valuable data requires strong protections within electronic systems and transmissions. TLS and Secure Sockets Layer (SSL) were developed as protocols to create private, secure channels between a server and client using encryption and authentication. While the standards and most products have been updated, implementations often have not kept up. The accompanying, full-length guidance helps network administrators and security analysts make a plan on how to weed out obsolete TLS configurations in the environment by detecting, prioritizing, remediating, and then blocking obsolete TLS versions, cipher suites, and finally key exchange methods. This will also help organizations prepare for cryptographic agility to always stay ahead of malicious actors’ abilities and protect important information. Using obsolete encryption provides a false sense of security because it may look as though sensitive data is protected, even though it really is not. The NSA previously released urgent guidance indicating obsolete and otherwise weak TLS protocol implementations were being observed, and threat intelligence stating that “nation-state and sufficiently resourced actors are able to exploit these weak communications.” However, obsolete TLS configurations are still in use in U.S. Government systems. Obsolete configurations provide adversaries access to sensitive operational traffic using a variety of techniques, such as passive decryption and modification of traffic through man-in-the-middle attacks.
    [Show full text]