Advances in Cryptology - CRYPTO 2017

Name: Advances in Cryptology - CRYPTO 2017 | 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III
Brand: Springer
Price: 96.29 EUR
Availability: OnlineOnly

37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III

Jonathan Katz Hovav Shacham(Herausgeber*in)

Springer (Verlag)

Erschienen am 8. August 2017

XV, 713 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-63697-9 (ISBN)

96,29 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Crypto 2017 The 37th IACR International Cryptology Conference
Contents - Part III
Authenticated Encryption
Boosting Authenticated Encryption Robustness with Minimal Modifications
1 Introduction
1.1 Robust Algorithms
1.2 Release of Unverified Plaintext
1.3 Contributions
2 Related Work
3 Preliminaries
3.1 Notation
3.2 Adversaries and Advantages
3.3 Authenticated Encryption Schemes
4 Resilience to Nonce Misuse
4.1 OCB Attacks
4.2 Chosen-Plaintext Confidentiality
4.3 Authenticity
4.4 Chosen-Ciphertext Confidentiality
5 Adding RUP Security to Encryption Schemes
5.1 Definitions
5.2 Generic Construction
5.3 GCM-RUP
A Algorithm Descriptions
A.1 OCB
A.2 GCM
A.3 ChaCha20+Poly1305
B Formal Security Argument For The Generic Construction
C Application to Tor
C.1 Tor
C.2 The Crypto-tagging Attack
C.3 Avoiding the Attack
References
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication
1 Introduction
2 Preliminaries
3 Specification of ZMAC
3.1 Overview
3.2 Specification of ZHASH for the Case t N
3.3 Specification of ZHASH for the Case t & n
3.4 Finalization
4 The PRF Security of ZMAC
4.1 XT Tweak Extension
4.2 Collision Probability of ZHASH
4.3 PRF Security of Finalization
4.4 PRF Security of ZMAC
4.5 Other Variants of ZMAC
5 Application to Authenticated Encryption: ZAE
6 MAC and AE Instances
6.1 Handling the Domain Separation of TBC Instances
6.2 Efficiency Comparisons
References
Message Franking via Committing Authenticated Encryption
1 Introduction
2 Preliminaries
3 Message Franking and End-to-End Encryption
4 Committing AEAD
5 Are Existing AEAD Schemes Committing?
5.1 Committing Encode-then-Encipher
5.2 Encrypt-then-MAC
5.3 MAC-then-Encrypt
5.4 Some Non-binding AEAD Schemes
6 Composing Commitment and AEAD
7 Nonce-Based Committing AEAD and the CEP Construction
8 Analysis of CEP
9 Related Work
References
Key Rotation for Authenticated Encryption
1 Introduction
2 Updatable AE
3 Confidentiality and Integrity for Updatable Encryption
3.1 Message Confidentiality
3.2 Ciphertext Integrity
4 Practical Updatable AE Schemes
4.1 Authenticated Encryption
4.2 (In-)Security of AE-Hybrid Construction
4.3 Improving AE-Hybrid
5 Indistinguishability of Re-encryptions
6 Revisiting the BLMR Scheme
6.1 Negative Result About Provable UP-IND Security of BLMR
7 An Updatable AE Scheme with Re-encryption Indistinguishability
7.1 Security of ReCrypt
7.2 Instantiating the Key-Homomorphic PRF
7.3 Implementation and Performance
8 Conclusion and Open Problems
A Bidirectional Updatable AE
A.1 XOR-KEM: A Bidirectional Updatable AE Scheme
References
Public-Key Encryption
Kurosawa-Desmedt Meets Tight Security
1 Introduction
2 Preliminaries
2.1 Notations
2.2 Hash Functions
2.3 Prime-Order Groups
2.4 Public-Key Encryption
2.5 Key Encapsulation Mechanism
3 Qualified Proof Systems
4 The OR-Proof
4.1 Public Parameters and the OR-Languages
4.2 A Construction Based on MDDH
5 Key Encapsulation Mechanism
References
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
1 Introduction
1.1 Background
1.2 Our Contributions
1.3 Related Works
2 Technical Overview
2.1 A Twist on the Admissible Hash
2.2 Our First Lattice IBE
2.3 Our First VRF
2.4 Other Constructions
3 Preliminaries
3.1 Cryptographic Primitives
3.2 Preliminaries on Lattices and Bilinear Maps
4 Partitioning Functions
4.1 Definition
4.2 Construction from Admissible Hash Function
4.3 Our Construction Based on Modified Admissible Hash Function
4.4 Our Construction Based on Affine Functions
5 Our IBE Schemes
5.1 Compatible Algorithms for Partitioning Functions
5.2 Construction
5.3 Multi-bit Variant
6 Our VRF Scheme Based on FMAH
6.1 Construction
6.2 A Variant with Short Verification Keys
7 Comparisons
References
Identity-Based Encryption from Codes with Rank Metric
1 Introduction
1.1 Code-Based Cryptography
1.2 Identity Based Encryption
1.3 Hardness of Problems in Rank Metric
1.4 Our Contribution
2 Background on Rank Metric and Cryptography
2.1 Notation
2.2 Definitions
2.3 Decoding Rank Codes
2.4 Difficult Problem for Rank-Based Cryptography
2.5 Complexity of the Rank Decoding Problem
3 A New Public Key Encryption
3.1 Public-Key Encryption
3.2 Description of the Cryptosystem RankPKE
3.3 Security
4 On the Difficulty of the Rank Support Learning Problem
4.1 A Related Problem: The Support Learning Problem
4.2 Both Problems Reduce to Linear Algebra When N is Large Enough
4.3 Solving the Subspace Problem with Information-Set Decoding
4.4 Link Between Rank Support Learning and Decoding over the Rank Metric
5 Identity Based Encryption
5.1 Trapdoor Functions from RankSign
5.2 Scheme
5.3 Security
6 Parameters
6.1 General Parameters for RankSign and RankEnc
6.2 Practical Evaluation of the Security
References
Stream Ciphers
Degree Evaluation of NFSR-Based Cryptosystems
1 Introduction
1.1 Our Contributions
1.2 Related Work
1.3 Organization
2 Preliminaries
3 An Iterative Method for Estimating Algebraic Degree of NFSR-Based Cryptosystems
4 Applications to Trivium-Like Ciphers
4.1 A Brief Description of Trivium-Like Ciphers
4.2 The Algorithm for Estimation of Degree of Trivium-Like Ciphers
4.3 Experimental Results
5 Improved Estimation of Degree of Trivium-Like Ciphers
6 Conclusions
A The Full Procedures of DegMul and DegMul
B The Best Cube Testers
References
Cube Attacks on Non-Blackbox Polynomials Based on Division Property
1 Introduction
2 Preliminaries
2.1 Mixed Integer Linear Programming
2.2 Cube Attack
2.3 Higher-Order Differential Cryptanalysis and Division Property
3 How to Analyze Non-Blackbox Polynomials
3.1 What Is Guaranteed by Division Property
3.2 Superpoly Recovery
4 Toward Key Recovery
4.1 Evaluating Time Complexity
5 Applications
5.1 Application to Trivium
5.2 Application to Grain128a
5.3 Application to ACORN
6 Discussions
6.1 Validity of Assumptions1 and 2
6.2 Multiple-Bits Recovery only from One Cube
6.3 Comparison with Previous Techniques
7 Conclusion
References
Lattice Crypto
Middle-Product Learning with Errors
1 Introduction
2 Background
2.1 Probabilities
2.2 Polynomials and Structured Matrices
2.3 The Polynomial Learning with Errors Problem (PLWE)
3 The Middle-Product Learning with Errors Problem
3.1 The Middle-Product
3.2 Middle-Product Learning with Errors
3.3 Hardness of MP-LWE
4 Public-Key Encryption from MP-LWE
References
All-But-Many Lossy Trapdoor Functions from Lattices and Applications
1 Introduction
1.1 Our Contribution
1.2 Other Related Works
2 Preliminaries
2.1 Randomness Extractor
2.2 Discrete Gaussians
2.3 Gadget Matrices
2.4 Homomorphic Evaluation Algorithms
2.5 Computational Assumptions
3 Definitions
3.1 Weak Pseudorandom Functions
3.2 Chameleon Hash Functions
3.3 Lossy Trapdoor Functions
3.4 All-But-Many Lossy Trapdoor Functions
4 All-But-Many Lossy Trapdoor Function from LWE
4.1 Basic LTF from [10]
4.2 Our Construction of ABM-LTF
4.3 Correctness
4.4 Parameter Selections
4.5 Security Proofs
5 IND-SO-CCA2 Secure PKE from Lattices
5.1 Definition of IND-SO-CCA2 Security
5.2 Construction of IND-SO-CCA2 PKE
5.3 Security Proof
5.4 Tightly Secure IND-CCA2 PKE
6 Conclusion
References
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
1 Introduction
1.1 Our Results
1.2 Our Techniques
1.3 Related Work
2 Background
2.1 Randomness Extraction
2.2 Reminders on Lattices
2.3 The Learning with Errors Problem
2.4 Lossy Trapdoor Functions
2.5 All-But-Many Lossy Trapdoor Functions
2.6 Selective-Opening Chosen-Ciphertext Security
3 An All-But-Many Lossy Trapdoor Function from LWE
3.1 An LWE-Based Lossy Trapdoor Function
3.2 An All-But-Many Lossy Trapdoor Function from LWE
3.3 Joint Use of Lossy and All-But-Many Functions
4 Selective Opening Chosen-Ciphertext Security
4.1 Description
4.2 Indistinguishability-Based (IND-SO-CCA2) Security
4.3 Achieving Simulation-Based (SIM-SO-CCA2) Security
References
Amortization with Fewer Equations for Proving Knowledge of Small Secrets
1 Introduction
1.1 Prior Work
1.2 Our Results
1.3 Paper Organization
2 Preliminaries
2.1 Notation
2.2 Homomorphic OWF
2.3 Rejection Sampling and the Normal Distribution
2.4 Zero-Knowledge Proofs of Knowledge
2.5 Imperfect Proof of Knowledge and a Compiler
3 Warmup Construction
4 Amortized Proof for f(xi)=yi with Fewer Equations
5 Proving f(xi)=2yi with Even Fewer Equations
6 Proof Size
References
Leakage and Subversion
Private Multiplication over Finite Fields
1 Introduction
1.1 Our Problem
1.2 Related Work
1.3 Our Contributions
2 Preliminaries
2.1 Notation
2.2 Arithmetic Circuits and Privacy
2.3 Compositional Security Notions
2.4 Relations Between Compositional Security Notions
2.5 Case of Study
3 Algebraic Characterizations
3.1 Bilinear Probes and Matrix Notation
3.2 Algebraic Characterization for Privacy
3.3 Algebraic Characterization for Non-Interference
4 Construction with a Linear Number of Bilinear Multiplications
4.1 Construction
4.2 Security Analysis
4.3 Probabilistic Construction
4.4 Small Cases
5 Construction with Linear Randomness Complexity
5.1 Construction
5.2 Security Analysis
5.3 Probabilistic Construction
5.4 Small Cases
5.5 Lower Bound
References
Anonymous Attestation with Subverted TPMs
1 Introduction
1.1 Our Contribution
1.2 Related Work
2 A Security Model for DAA with Optimal Privacy
2.1 Ideal Functionality [pdaa]
2.2 Comparison with [daa]l
2.3 Modeling Subverted Parties in the UC Framework
3 Insufficiency of Existing DAA Schemes
4 Building Blocks
4.1 Proof Protocols
4.2 Homomorphic Encryption Schemes
4.3 Signature Schemes for Encrypted Messages
4.4 Split Signatures
5 Construction
5.1 Our DAA Protocol with Optimal Privacy [pdaa]
5.2 Security
6 Concrete Instantiation and Efficiency
References
Hedging Public-Key Encryption in the Real World
1 Introduction
2 Crypto Libraries
3 Preliminaries
3.1 Public-Key Encryption with Associated Data
3.2 Sources
4 Security Notions
4.1 IND Security
4.2 MMR Security
4.3 ANON Security
4.4 MM Security
5 Relations Among the Notions
6 Constructions
6.1 EME-OAEP
6.2 Hybrid Encryption Construction
6.3 Generic Constructions
References
Symmetric-Key Crypto
Information-Theoretic Indistinguishability via the Chi-Squared Method
1 Introduction
2 Preliminaries
3 The Chi-Squared Method
4 The XOR Construction
5 The Encrypted Davies-Meyer Construction
6 The Swap-or-Not Construction
A Another Variant of the Xor of Two Permutations
References
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient
1 Introduction
2 Preliminaries
3 Attack Against 4-Round Simulators
4 The 5-Round Simulator
4.1 Pseudocode of the Simulator and Game Transitions
5 Proof of Indifferentiability
5.1 Main Result and Proof Overview
5.2 Executions of G2: Definitions and Basic Properties
5.3 Bad Events
5.4 Efficiency of the Simulator
5.5 Probability of Good Executions
5.6 Indistinguishability of G1 and G4
6 Final Thoughts: 4 and 6 Rounds
References
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
1 Introduction
1.1 Our Contribution
2 Preliminaries
2.1 Universal Hash Functions
2.2 Distinguishers
2.3 H-Coefficient Technique
2.4 Pseudorandom Function Security
3 Mirror Theory
3.1 System of Equations
3.2 Main Result
3.3 Extension to Relaxed Inequality Conditions
3.4 Example
4 Security of EDMp1,p2
4.1 General Setting and Transcripts
4.2 Attainable Index Mappings
4.3 Bad Transcripts
4.4 Probability of Bad Transcripts ()
4.5 Ratio for Good Transcripts ()
5 Security of EWCDMh,p1,p2
5.1 General Setting and Transcripts
5.2 Attainable Index Mappings
5.3 Bad Transcripts
5.4 Probability of Bad Transcripts ()
5.5 Ratio for Good Transcripts ()
6 Security of EDMDp1,p2
7 Towards a Single Permutation
A Proof Sketch of Theorem 2
References
Real-World Crypto
A Formal Treatment of Multi-key Channels
1 Introduction
1.1 Secure Cryptographic Channels
1.2 Multi-key Channels
1.3 Our Contributions
1.4 Related Work
2 Multi-key Channels
2.1 Syntax Rationale
3 Security Notions for Multi-key Channels
3.1 Confidentiality
3.2 Integrity
3.3 Modeling Rationale
3.4 Relations Between Multi- and Single-Key Notions
3.5 Generic Composition
4 AEAD-Based Construction of a Multi-key Channel
4.1 Security Analysis
4.2 Comparison to the TLS 1.3 Record Protocol
5 Conclusions and Future Work
References
Ratcheted Encryption and Key Exchange: The Security of Messaging
1 Introduction
2 Preliminaries
3 Oracle Diffie-Hellman with Exposures
4 Ratcheted Key Exchange
4.1 Definition of Ratcheted Key Exchange
4.2 Security of Ratcheted Key Exchange
4.3 Construction of a Ratcheted Key Exchange Scheme
4.4 Security Proof for Our Ratcheted Key Exchange Scheme
5 Ratcheted Encryption
References
PRF-ODH: Relations, Instantiations, and Impossibility Results
1 Introduction
1.1 The PRF-ODH Assumption
1.2 Evaluating the PRF-ODH Assumptions
1.3 Our Results
2 PRF-ODH Definition
3 Instantiating the PRF-ODH Assumption
3.1 Standard-Model Instantiation of nnPRF-ODH
3.2 Random-Oracle Instantiation of mmPRF-ODH and nmPRF-ODH
3.3 Random-Oracle Instantiation of mmPRF-ODH
3.4 On the Relation Between PRF-ODH and Security Against Related-Key Attacks
4 PRF-ODH Relations
4.1 Separations in the Standard Model
4.2 Separations in the Random Oracle Model
4.3 Discussion
5 On the Impossibility of Instantiating PRF-ODH in the Standard Model
5.1 Overview
5.2 DDH-augmented Cryptographic Problems
5.3 Algebraic Reductions for the snPRF-ODH Assumption
5.4 Outline of Steps
5.5 Defining the All-Powerful Adversary
5.6 Reductions Without Help
5.7 Our Meta-reduction
5.8 Analysis
6 PRF-ODH Security of HMAC
7 Conclusion
References
A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing
1 Introduction
2 Definitions and Preliminaries
3 New Bounds for FRS Sketches
3.1 Secure Sketches for Flat Distributions
3.2 Layered Hashing for Non-flat Distributions
4 A New Construction: Layer Hiding Hash
5 Typo-Tolerant Password-Based Key Derivation
5.1 Brute-Force Checkers
5.2 Typo-Tolerant PBAS Using Secure Sketches
5.3 Popularity-Proportional Hashing
6 Comparing the PBAS Approaches
6.1 PBAS-BF versus FRS1 for Flat Distributions
6.2 PPH versus FRS2 and LHH
6.3 Brute-Force Checking versus PPH
7 Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken