DOCSLIB.ORG

Towards Secure Communication and Authentication: Provable Security Analysis and New Constructions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Towards Secure Communication and Authentication: Provable Security Analysis and New Constructions TOWARDS SECURE COMMUNICATION AND AUTHENTICATION: PROVABLE SECURITY ANALYSIS AND NEW CONSTRUCTIONS A Dissertation Presented to The Academic Faculty By Shan Chen In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Computer Science Georgia Institute of Technology May 2020 Copyright c Shan Chen 2020 TOWARDS SECURE COMMUNICATION AND AUTHENTICATION: PROVABLE SECURITY ANALYSIS AND NEW CONSTRUCTIONS Approved by: Dr. Alexandra Boldyreva, Advisor Dr. Paul Pearce School of Computer Science School of Computer Science Georgia Institute of Technology Georgia Institute of Technology Dr. Mustaque Ahamad Dr. Gaven Watson School of Computer Science Advanced Cryptography Georgia Institute of Technology Visa Research Dr. Vladimir Kolesnikov Date Approved: January 8, 2020 School of Computer Science Georgia Institute of Technology ACKNOWLEDGEMENTS I would like to first thank my advisor Alexandra (Sasha) Boldyreva for her generous support, great patience, and outstanding guidance throughout my doctoral study. I am also very grateful for her understanding and support of my needs besides research, which made my Ph.D. life much easier than it could have become. I was very fortunate to collaborate with many excellent researchers and talented stu- dents. My thanks go to David Pointcheval, Cristina Nita-Rotaru, Manuel Barbosa, Bogdan Warinschi, and my mentor Gaven Watson at Visa Research, as well as student co-authors Pierre-Alain Dupont, Samuel Jero, and Matthew Jagielski. I thank my proposal and thesis committee for their valuable time and helpful advice. I would also like to thank John Steinberger for introducing me to the fascinating world of cryptography and steered me in the right way towards establishing good research abilities. Finally, I would express my sincere gratitude to my parents and my girlfriend for their constant love and encouragement. I thank my labmates and all my dear friends for their support and wish them all the best in their lives. iii TABLE OF CONTENTS Acknowledgments . iii List of Tables . ix List of Figures . x Summary . xii Chapter 1: Introduction . 1 1.1 Motivation and Goal . 1 1.2 Contributions . 2 1.2.1 Human Authenticated Key Exchange . 3 1.2.2 Comparing TLS 1.3 (over TCP Fast Open) to QUIC . 7 1.2.3 Provable Security Analysis of FIDO2 . 12 1.3 Declaration of Co-Authorship and Previous Publications . 15 1.4 Road Map . 16 Chapter 2: Preliminaries . 17 2.1 Notations . 17 2.2 Pseudorandom Function . 17 2.3 Commitment Scheme . 18 iv 2.4 Message Authentication Code . 19 2.5 Authenticated Encryption . 19 2.6 Stateful Authenticated Encryption with Associated Data . 20 2.7 Collision-Resistant Hash Function Family . 21 2.8 Signature Scheme . 22 2.9 The Diffie-Hellman Assumptions . 22 2.10 Password-Authenticated Key Exchange . 23 Chapter 3: Human Authenticated Key Exchange . 26 3.1 Introduction . 26 3.1.1 Related Work . 26 3.1.2 Our Contributions . 27 3.2 HAKE Syntax and Security Model . 34 3.2.1 Protocol Syntax . 34 3.2.2 Security Model . 35 3.3 Human-Compatible Function Family . 41 3.3.1 Syntax . 41 3.3.2 Security . 42 3.3.3 Token-Based HC Function Family Instantiation . 46 3.3.4 Only-Human HC Function Family Instantiation . 46 3.4 Generic HAKE Protocols . 53 3.4.1 The Basic HAKE . 54 3.4.2 The Confirmed HAKE . 56 v 3.5 Device-Assisted HAKE Protocols . 59 3.5.1 Simplified Basic HAKE . 60 3.5.2 Time-Based HAKE . 60 Chapter 4: Comparing TLS 1.3 over TFO to QUIC . 65 4.1 Introduction . 65 4.1.1 Our Contributions . 65 4.2 Background . 68 4.2.1 TLS 1.3 over TFO . 69 4.2.2 QUIC over UDP . 73 4.2.3 QUIC with TLS 1.3 Key Exchange . 75 4.3 Multi-Stage Authenticated and Confidential Channel Establishment . 76 4.3.1 Protocol Syntax . 76 4.3.2 Security Models . 79 4.4 Provable Security Analysis . 90 4.4.1 TLS 1.3 over TFO . 90 4.4.2 QUIC over UDP . 95 4.4.3 QUIC[TLS] over UDP . 99 Chapter 5: Provable Security Analysis of FIDO2 . 102 5.1 Introduction . 102 5.1.1 Related Work and Focus . 102 5.1.2 Our Contributions . 103 5.2 IND-1$PA Security for Deterministic Encryption . 108 vi 5.3 PIN-Based Authenticator Setup and Authenticated Channel Establishment . 109 5.3.1 Protocol Syntax . 109 5.3.2 Security Model . 111 5.4 The Client to Authenticator Protocol v2.0 and its Security . 116 5.4.1 Protocol Description . 116 5.4.2 Security Results . 118 5.5 The PIN-Based Authenticator Setup and Key Exchange Protocol and its Security . 120 5.5.1 Protocol Description . 120 5.5.2 Security Results . 121 5.6 Authenticator-Assisted Passwordless User Authentication . 123 5.6.1 Protocol Syntax . 123 5.6.2 Security Model . 125 5.7 The W3C Web Authentication Protocol and its Security . 131 5.7.1 Protocol Description . 132 5.7.2 Security Results . 132 5.8 The WebAuthn+ Protocol and its Security . 133 5.9 Composition . 133 Chapter 6: Conclusion . 136 Appendix A: Proofs of Theorems . 138 A.1 Proof of Theorem 6 . 138 A.2 Proof of Theorem 7 . 139 vii A.3 Proof of Theorem 8 . 140 A.4 Proof of Theorem 9 . 141 A.5 Proof of Theorem 10 . 143 A.6 Proof of Theorem 11 . 144 A.7 Proof of Theorem 12 . 146 A.8 Proof of Theorem 13 . 146 Appendix B: QUIC and TLS 1.3’s Stateful AEAD Schemes and Their Security . 148 B.1 QUIC’s Stateful AEAD Scheme and its Security . 148 B.2 TLS 1.3’s Stateful AEAD Scheme and its Security . 149 Appendix C: msACCE-std Security of TLS 1.3 over TFO and QUIC over UDP . 151 C.1 TFO+TLS 1.3’s msACCE-std Security . 151 C.2 UDP+QUIC’s msACCE-std Security . 154 References . 164 Vita ........................................... 165 viii LIST OF TABLES 1.1 Latency comparison of layered protocols . 9 1.2 Security comparison . 11 3.1 Performance of the Time-Based Device-Assisted HAKE . 63 ix LIST OF FIGURES 2.1 Functionality FPAKE [50] . 24 3.1 Graph of the sequential oracle calls in the η-unforgeability experiment . 43 3.2 Basic HAKE construction . 54 3.3 Confirmed HAKE construction . 57 3.4 Time-Based HAKE construction . 61 4.1 TCP header. [96] . 68 4.2 UDP header. [97] . 68 4.3 TFO+TLS 1.3 (EC) DHE 2-RTT full handshake (left) and TFO+TLS 1.3 PSK-(EC) DHE 0-RTT resumption handshake (right). * indicates optional messages. () indicates messages protected using the 0-RTT keys derived from a pre-shared key. fg and [] indicate messages protected with initial and final keys. 70 4.4 QUIC 1-RTT full handshake (left) and UDP+QUIC 0-RTT resumption hand- shake (right). * indicates optional messages. fg and [] indicate messages protected with initial and final keys. 73 5.1 Communication Channels. 109 5.2 Relations between PASACE security notions..
Load more

Recommended publications
  • Critical Perspectives on Provable Security: Fifteen Years of “Another Look” Papers
    Advances in Mathematics of Communications doi:10.3934/amc.2019034 Volume 13, No. 4, 2019, 517{558 CRITICAL PERSPECTIVES ON PROVABLE SECURITY: FIFTEEN YEARS OF \ANOTHER LOOK" PAPERS Neal Koblitz Department of Mathematics University of Washington, USA Alfred Menezes Department of Combinatorics & Optimization University of Waterloo, Canada Abstract. We give an overview of our critiques of \proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. We also provide numerous additional examples and a few updates and errata. 1. Introduction What does \provable security" mean? If \proof" is understood in the strict mathematical sense | as in \proof of the Pythagorean Theorem" or \proof of Fermat's Last Theorem" | then there's a simple answer: There is no such thing. \Provable security" is an oxymoron. As Benjamin Franklin said 230 years ago, \in this world nothing can be said to be certain, except death and taxes." About communications security there can be no certainty. But it is wrong to reject proofs in cryptography just because in general they do not measure up to the standards of pure mathematics. To take such an inflexible position would be, as Jonathan Katz pointed out, \snobbery at its purest" [200]. Proofs can be useful in several ways. They enforce a kind of discipline on authors so that they strive for precision, systematic approaches, and completeness. They rule out certain categories of attacks or attacks on certain parts of the protocol so that testing can focus on other types of attacks and on the assumptions made in the provable security theorem.
    [Show full text]
  • Security Protocols in a Nutshell
    Security Protocols in a Nutshell Mohsen Toorani Department of Informatics University of Bergen, Norway [email protected] Abstract Security protocols are building blocks in secure communications. They deploy some security mechanisms to provide certain security services. Security protocols are considered abstract when analyzed, but they can have extra vulnerabilities when implemented. This manuscript provides a holistic study on security protocols. It reviews foundations of security protocols, taxonomy of attacks on security protocols and their implementations, and different methods and models for security analysis of protocols. Specifically, it clarifies differences between information-theoretic and computational security, and computational and symbolic models. Furthermore, a survey on computational security models for authenticated key exchange (AKE) and password-authenticated key exchange (PAKE) protocols, as the most impor- tant and well-studied type of security protocols, is provided. Keywords: Cryptographic protocols, Authenticated key exchange, Computational security, Provable security, Security models. arXiv:1605.09771v2 [cs.CR] 2 Jun 2016 Copyright c 2015 Mohsen Toorani. All Rights Reserved. Contents 1 Introduction 1 1.1 Security attacks . 2 1.2 Security services . 2 1.3 Security mechanisms . 3 2 Taxonomy of attacks 3 2.1 Attacks on security protocols . 3 2.2 Attacks on encryption schemes . 8 2.3 Attacks on implementations . 11 3 Security models 14 3.1 Information-theoretic vs computational security . 15 3.2 Idealized models in computational security . 16 3.3 Formal security models . 18 3.4 Security proofs in reality . 19 4 Security models for cryptographic protocols 20 4.1 AKE protocols . 22 4.1.1 Security models for AKE protocols . 23 4.1.2 PAKE protocols .
    [Show full text]
  • Securing Hardware, Software and Data (SHSD) • Frank Siebenlist, Argonne National Laboratory • Len Napolitano, Sandia National Laboratories
    Report of the Cyber Security Research Needs for Open Science Workshop July 23-24, 2007 Sponsored by the DOE Office of Science in Cooperation with the Office of Electricity Delivery and Energy Reliability PNNL-16971 Report of the Cyber Security Research Needs for Open Science Workshop July 23-24, 2007 Sponsored by the DOE Office of Science in Cooperation with the Office of Electricity Delivery and Energy Reliability i Acknowledgements The workshop chairs wish to thank Joree O’Neal and Rachel Smith for all their help and support with organizing the logistics and registration activities for this workshop; Sue Chin, Ted Tanasse, Barbara Wilson, and Stacy Larsen for their expert help with the assembly, text editing, and graphics for this report; and Lance Baatz for his masterful job as webmaster for this project. Finally, we wish to thank the Pacific Northwest National Laboratory for supporting the development and assembly of the final report. iii EXECUTIVE SUMMARY Protecting systems and users, while maintaining ease of access, represents the “perfect storm” of challenges in the area of cyber security. A fundamental tenet of every scientific investigation is the search for truth. Trust and integrity are immutable values that are fundamental to all research endeavors. By extension, the absolute integrity of information, encompassing systems, networks, and file systems is a critical requirement essential for promoting and facilitating discovery. These qualities are equally important for our nation’s critical energy infrastructure. To determine the cyber security research needs for open science and energy control systems, the U.S. Department of Energy’s (DOE) Office of Science (SC), in cooperation with the Office of Electricity Delivery and Energy Reliability (OE), organized a two-day workshop held July 23 and 24, 2007, at the Bethesda North Marriott Hotel in Bethesda, Maryland.
    [Show full text]
  • Security Notions and Definitions
    Security Notions and Definitions Nicolas T. Courtois - University College of London Security Notions Part 0 Some Vocabulary Revision 2 Nicolas T. Courtois, 2006-2010 Security Notions What is Cryptography ? • Classical notions (cf. dictionaries). – Cryptography: “the art keeping messages secure”. Classically - mostly about secure communication… – Cryptanalysis: the art/science of breaking codes and ciphers . – Cryptology: Cryptography+Cryptanalysis. • These definitions are very much outdated…. 3 Nicolas T. Courtois, 2006-2010 Security Notions My Own Definitions (1): Cryptography: The art and practical techniques for achieving “data security goals” … Cryptology: The science of achieving “data security goals” … 4 Nicolas T. Courtois, 2006-2010 Security Notions Cryptanalysis from the Greek • kryptós, "hidden“ • analýein , "to loosen" or "to untie“ = Breaking (secret) codes Term coined in 1920 by William F. Friedman. 5 Nicolas T. Courtois, 2006-2010 Security Notions More Modern Approach: Cryptanalysis = evaluation of existing weak points: Challenging the security goals by attacks and showing that the security is lower than expected (does not have to recover the key in practice, just show that some claims are not justified). 6 Nicolas T. Courtois, 2006-2010 Security Notions My Own Definitions (3): Cryptology: The science that allows to justify / undermine cryptographic security. Science: establishing facts and proving theorems. Modern Cryptology: Prove the “data security goals” are achieved, while minimising the number of, and maximizing the
    [Show full text]
  • Introduction to Provable Security
    Introduction to Provable Security Introduction to Provable Security Alejandro Hevia Dept. of Computer Science, Universidad de Chile Advanced Crypto School, Florian´opolis October 17, 2013 1/77 Introduction to Cryptography Part I Introduction 2/77 What Cryptography is about Introduction to Cryptography Classic Goals 1 Introduction to Cryptography What Cryptography is about Classic Goals 3/77 What Cryptography is about Introduction to Cryptography Classic Goals What Cryptography is about Cryptography is the discipline that studies systems (schemes, protocols) that preserve their functionality (their goal) even under the presence of an active disrupter. 4/77 What Cryptography is about Introduction to Cryptography Classic Goals What Cryptography is about Cryptography is the discipline that studies systems (schemes, protocols) that preserve their functionality (their goal) even under the presence of an active disrupter. 4/77 What Cryptography is about Introduction to Cryptography Classic Goals Classic Problems/Goals Integrity: Messages have not been altered Authenticity: Message comes from sender Secrecy: Message not known to anybody else 5/77 What Cryptography is about Introduction to Cryptography Classic Goals Integrity Alice wants to be sure that a message has not been modified. Analogy with mail We want to know that the envelope has not been opened 6/77 What Cryptography is about Introduction to Cryptography Classic Goals Authenticity There are two types: Case 1: Bob wants to interactively prove his identity to Alice. (eg. talking by phone) Case 2: Bob wants to prove his identity non-interactively to Alice. If the proof can convice a third party (judge), it's a signature. 7/77 What Cryptography is about Introduction to Cryptography Classic Goals Secrecy We want to 1 Store a document 2 Send a message We want..
    [Show full text]
  • Provable Security"
    Another Look at \Provable Security" Neal Koblitz Dept. of Mathematics, Box 354350 Univ. of Washington, Seattle, WA 98195 U.S.A. [email protected] Alfred J. Menezes Dept. of Combinatorics & Optimization Univ. of Waterloo, Waterloo, Ontario N2L 3G1 Canada [email protected] July 4, 2004¤ Abstract We give an informal analysis and critique of several typical \provable security" results. In some cases there are intuitive but convincing argu- ments for rejecting the conclusions suggested by the formal terminology and \proofs," whereas in other cases the formalism seems to be consistent with common sense. We discuss the reasons why the search for mathemat- ically convincing theoretical evidence to support the security of public-key systems has been an important theme of researchers. But we argue that the theorem-proof paradigm of theoretical mathematics is often of limited relevance here and frequently leads to papers that are confusing and mis- leading. Because our paper is aimed at the general mathematical public, it is self-contained and as jargon-free as possible. Key words. Cryptography, Public Key, Provable Security AMS subject classi¯cations. 94A60, 68P25, 11T71 1 Introduction Suppose that someone is using public-key cryptography to protect credit card numbers during online purchases, maintain con¯dentiality of medical records, or safeguard national security information. How can she be sure that the system is secure? What type of evidence could convince her that a malicious adversary could not somehow break into the system and learn her secret? At ¯rst glance it seems that this question has a straightforward answer. At the heart of any public-key cryptosystem is a \one-way function" | a function ¤updated on July 16, 2004; October 25, 2004; March 31, 2005; and May 4, 2005 1 y = f(x) that is easy to evaluate but for which it is computationally infeasible to ¯nd the inverse x = f ¡1(y).
    [Show full text]
  • Provable Security in Practice: Analysis of SSH and CBC Mode with Padding
    Provable Security in Practice: Analysis of SSH and CBC mode with Padding Gaven James Watson Technical Report RHUL{MA{2011{2 21 February 2011 Department of Mathematics Royal Holloway, University of London Egham, Surrey TW20 0EX, England http://www.rhul.ac.uk/mathematics/techreports Provable Security in Practice: Analysis of SSH and CBC mode with Padding Gaven James Watson Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Mathematics Royal Holloway, University of London 2010 Declaration These doctoral studies were conducted under the supervision of Prof. Kenneth G. Paterson. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Department of Mathe- matics as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Gaven James Watson June, 2010 2 Acknowledgements When I first started my PhD, I did not know where it would take me or even how much it was possible for me to achieve. I have been incredibly lucky to have worked on some interesting problems which have given birth to significant results. This has all been possible due to the excellent supervision of Prof. Kenny Paterson. His advice, constructive criticism and the odd amusing analogy have helped me, not only to develop as a researcher but have taught me a great deal about writing and presenting my work. What I have learnt will be invaluable in my future career, what- ever that may be.
    [Show full text]
  • Introduction to Provable Security in Public-Key Cryptography Contents
    Introduction to Provable Security in Public-Key Cryptography Damien Vergnaud (Mathematical Foundations of Asymmetric Cryptography) Sorbonne Universit´e– CNRS – IUF Aussois, Mar. 18 2019 Provable Security in PKC Damien Vergnaud 1 / 64 Contents 1 Introduction 2 Public-Key Encryption Definitions Security Notions for Public-Key Encryption 3 Discrete-log based encryption schemes ElGamal encryption scheme Random Oracle Model and Variants of ElGamal 4 Digital signatures Definitions Security Notions for Digital Signatures 5 Discrete-log based digital signatures One-time signatures Fiat-Shamir heuristic and Schnorr Signatures Aussois, Mar. 18 2019 Provable Security in PKC Damien Vergnaud 2 / 64 Cryptography Goal: enable “secure” communication in the presence of adversaries internet, phone line, ... eavesdrops Alice Bob Eve Aussois, Mar. 18 2019 Provable Security in PKC Damien Vergnaud 3 / 64 Encryption Alice sends a ciphertext to Bob Only Bob can recover the plaintext Confidentiality To recover the plaintext Which means can be used ? to find the whole plaintext ? just the ciphertext ? to get some information some extra information ? about it ? Aussois, Mar. 18 2019 Provable Security in PKC Damien Vergnaud 4 / 64 Why “Provable Security” ? Once a cryptosystem is described, how can we prove its security? by trying to exhibit an attack by proving that no attack exists attack found under some assumptions V system insecure! attack found attack not found V false assumption V ? ”Textbook” cryptosystems cannot be used as such Pratictioners need formatting rules to ensure operability. Paddings are used in practice : heuristic security Provable security is needed in upcoming systems. This is no longer just theory. Provable security is fun! :-) Aussois, Mar.
    [Show full text]
  • On Provable Security for Complex Systems
    On Provable Security for Complex Systems zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften der KIT-Fakult¨atf¨urInformatik des Karlsruher Instituts f¨urTechnologie (KIT) genehmigte Dissertation von Dirk Achenbach aus Villingen-Schwenningen Tag der m¨undlichenPr¨ufung: 29. Januar 2016 Erster Gutachter: Prof. Dr. J¨ornM¨uller-Quade Zweiter Gutachter: Prof. Dr. Ralf Reussner Abstract Computers are ubiquitous. They are critical for a multitude of operations in business, government, and society. Simultaneously they become ever more complex. Consequently, while they gain in importance, it is increasingly difficult to guarantee their security. Because security is a non-functional property, it can neither be tested for, nor can a system be made secure in an ad-hoc fashion. Security can only be included as an inherent property of a system by design. We investigate the contribution of cryptographic proofs of security to a systematic security engineering process. To this end we study how to model and prove security for concrete applications in three practical domains: computer networks, data outsourcing, and electronic voting. In the first domain, computer networks, we investigate the security of a network component irrespective of the surrounding network. As a concrete application, we study how to combine several candidate firewalls to yield one provably-secure firewall, even if one candidate is compromised. Our modeling of a firewall network allows us to define security independent of a firewall's functionality. We show that a concatenation of firewalls is not secure, while a majority decision is. Second, we develop a framework for the privacy of outsourced data. Specifically, we consider privacy in the presence of queries.
    [Show full text]
  • Provable Security of Cryptographic Hash Functions
    ARENBERG DOCTORAL SCHOOL Faculty of Engineering Science Provable Security of Cryptographic Hash Functions Bart Mennink Jury: Dissertation presented in partial Prof. dr. ir. Pierre Verbaeten, chairman fulfillment of the requirements Prof. dr. ir. Bart Preneel, promotor for the degree of Doctor in Prof. dr. ir. Vincent Rijmen, promotor Engineering Prof. dr. Marc Fischlin (Darmstadt University of Technology, Germany) Prof. dr. ir. Frank Piessens Dr. ir. Martijn Stam (University of Bristol, UK) Prof. dr. ir. Joos Vandewalle May 2013 Provable Security of Cryptographic Hash Functions Bart Mennink Jury: Dissertation presented in partial Prof. dr. ir. Pierre Verbaeten, chairman fulfillment of the requirements Prof. dr. ir. Bart Preneel, promotor for the degree of Doctor in Prof. dr. ir. Vincent Rijmen, promotor Engineering Prof. dr. Marc Fischlin (Darmstadt University of Technology, Germany) Prof. dr. ir. Frank Piessens Dr. ir. Martijn Stam (University of Bristol, UK) Prof. dr. ir. Joos Vandewalle May 2013 \Alle grote ontdekkingen komen voort uit onzinnige intu¨ıties.” Harry Mulisch, De Procedure c Katholieke Universiteit Leuven { Faculty of Engineering Science Arenbergkasteel, B-3001 Heverlee (Belgium) Alle rechten voorbehouden. Niets uit deze uitgave mag worden vermenigvuldigd en/of openbaar gemaakt worden door middel van druk, fotocopie, microfilm, elektronisch of op welke andere wijze ook zonder voorafgaande schriftelijke toestemming van de uitgever. All rights reserved. No part of the publication may be reproduced in any form by print, photoprint, microfilm or any other means without written permission from the publisher. D/2013/7515/46 ISBN 978-94-6018-660-8 Preface After months of thesis writing, it is time to start with the hardest but most important chapter of this thesis.
    [Show full text]
  • NIST Cryptographic Standards and Guidelines Development Process
    NIST Cryptographic Standards and Guidelines Development Process Report and Recommendations of the Visiting Committee on Advanced Technology of the National Institute of Standards and Technology July 2014 Preface This report from Visiting Committee on Advanced Technology (VCAT) of the National Institute of Standards and Technology (NIST) to the NIST Director contains the VCAT’s recommendations on how NIST can improve the cryptographic standards and guidelines development process. The report is based on the report from the VCAT Subcommittee on Cybersecurity to the VCAT. The Subcommittee based its recommendations on inputs received from a distinguished panel of experts, the Committee of Visitors (CoV), that was established with the specific tasks of reviewing NIST cryptographic processes and of providing the Subcommittee their individual assessments. The report is organized as follows. Section 1 contains a summary, in chronological order, of the events and meetings that occurred between February and June 2014 with detailed meeting minutes placed in appendices. Section 2 briefly discusses the individual CoV assessments and recommendations, with the original versions placed in appendices. Finally, Section 3 contains the VCAT observations and recommendations. ii Table of Contents Preface ...................................................................................................................................................... ii Table of Contents .................................................................................................................................
    [Show full text]
  • Practice-Oriented Provable Security and the Social Construction of Cryptography
    Practice-Oriented Provable Security and the Social Construction of Cryptography Phillip Rogaway∗ May 22, 2009† Abstract Traditionally, “provable security” was tied in the minds cryptographers to public-key cryptography, asymptotic analyses, number-theoretic primitives, and proof-of-concept designs. In this essay I survey some of the work that I have done (much of it joint with Mihir Bellare) that has helped to erode these associations. I will use the story of practice-oriented provable security as the backdrop with which to make the case for what might be called a “social constructionist” view of our field. This view entails the claim that the body of work our community has produced is less the inevitable consequence of what we aim to study than the contingent consequence of sensibilities and assumptions within our disciplinary culture. 1 Introduction This essay was written to accompany an invited talk at Eurocrypt 2009. This is not a traditional academic paper; it is only an essay. The plan. My aim is to accomplish a couple of things. First, I have never provided a general exposition of the research program that I initiated some 15+ years ago with Mihir Bellare, what we rather un-creatively termed practice-oriented provable security. So I’d like to do just that. I see practice-oriented provable security as a distinct and recognizable branch of contemporary cryptology, derived from, yet different from, classical provable-security cryptography. But I have no idea if others conceptualize this line of work as such, or if they even associate it to Mihir and me. So telling this story is the first thing I want to do.
    [Show full text]