Advances in Cryptology - EUROCRYPT 2018

Name: Advances in Cryptology - EUROCRYPT 2018 | 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III
Brand: Springer
Price: 149.79 EUR
Availability: OnlineOnly

37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III

Jesper Buus Nielsen Vincent Rijmen(Herausgeber*in)

Springer (Verlag)

Erschienen am 16. April 2018

XIX, 719 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-78372-7 (ISBN)

149,79 €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
Eurocrypt 2018 The 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques
Abstract of Invited Talks
Desperately Seeking Sboxes
Thirty Years of Digital Currency: From DigiCash to the Blockchain
Contents -- Part III
Zero-Knowledge
On the Existence of Three Round Zero-Knowledge Proofs
1 Introduction
1.1 Our Results
1.2 Technical Overview
1.3 Implications to Lepinski's Protocol
1.4 Related Work
2 Preliminaries
2.1 Interactive Proofs and Arguments
2.2 Puncturable Pseudorandom Functions
2.3 Obfuscation
3 Impossibility of Three-Round Zero-Knowledge Proofs
3.1 Proof of Lemma 4
3.2 Proof of Lemma 5
4 Extending the Lower Bound to -Zero Knowledge
4.1 Proof of Lemma 10
References
Statistical Witness Indistinguishability (and more) in Two Messages
1 Introduction
1.1 Summary of Our Results
1.2 Other Related Work
2 Overview of Techniques
2.1 First Attempt: Compressing the Blum Protocol via OT
2.2 Compressing Interactive Arguments While Preserving Soundness
2.3 Applications to OT
2.4 On the Relationship with Non-malleability
3 Preliminaries
3.1 Oblivious Transfer
3.2 Proof Systems
4 Extractable Commitments
4.1 Definitions
4.2 Protocol
5 Two-Message Arguments with Statistical Privacy
5.1 Modified Blum Protocol
5.2 Compressing Four Message Argument to a Two Message Argument
5.3 Proofs of Privacy
6 Oblivious Transfer: Stronger Security and Reversal
6.1 Simulation-Secure Two-Message Oblivious Transfer
6.2 Reversing Oblivious Transfer
References
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge
1 Introduction
2 Our Results
3 Preliminaries
3.1 Interactive Proof Systems
3.2 Statistical Zero-Knowledge
3.3 Instance-Dependent Commitment Schemes
4 Constant-Round Statistical Zero-Knowledge Proofs
4.1 Instance-Dependent Statistical Zero-Knowledge Proofs
4.2 A Concrete Protocol for a SZK-Complete Problem
5 Efficient Transformation from Honest-Verifier SZK to SZK
References
Implementing Multiparty Computation
Efficient Maliciously Secure Multiparty Computation for RAM
1 Introduction
1.1 Background
1.2 Our Contribution
1.3 Related Work
2 Preliminaries
2.1 Oblivious RAM
2.2 Secure Computation in the RAM Model
3 Executing RAM Programs Using BMR
3.1 SPDZ Secret Sharing
3.2 The BMR-SPDZ Protocol
3.3 Towards RAM Computation
4 Accessing Memory
4.1 Memory via Embedded Authentication Sub-circuit
4.2 Memory via Wire Soldering
4.3 Memory via Free Conversion Between Keys and Shared Real Values
5 Realizing Functionality .
5.1 Security of Protocol .
6 Optimizing BMR Evaluation
6.1 The Technique
6.2 Security
7 Implementation
A The Generic Reactive MPC Functionality
References
Efficient Circuit-Based PSIpg via Cuckoo Hashing
1 Introduction
1.1 Motivation for Circuit-Based PSI
1.2 Our Contributions
1.3 Computing Symmetric Functions
1.4 Related Work
2 Preliminaries
3 Analyzing the Failure Probability
3.1 Using Probabilistic Constructions for Cryptography
3.2 Experimental Parameter Analysis
3.3 Our Constructions
4 An Asymptotic Construction Through Mirror Cuckoo Hashing
4.1 Mirror Cuckoo Hashing
4.2 Circuit-Based PSI from Mirror Cuckoo Hashing
5 A Concretely Efficient Construction Through 2D Cuckoo Hashing
5.1 Iterative 2D Cuckoo Hashing
5.2 Circuit-Based PSI from 2D Cuckoo Hashing
5.3 Extension to a Larger Number of Parties
5.4 No Extension to Security Against Malicious Adversaries
6 Evaluation
6.1 Simulations for Setting the Parameters of 2D Cuckoo Hashing
6.2 Circuit Complexities
6.3 Performance
References
Overdrive: Making SPDZ Great Again
1 Introduction
2 Preliminaries
2.1 Security Model
2.2 BGV
2.3 Zero-Knowledge Proofs
2.4 Overview of SPDZ
3 Low Gear: Triple Generation Using Semi-homomorphic Encryption
3.1 Enhanced CPA Security
3.2 Input Authentication
3.3 Triple Generation
3.4 Parameter Choice
4 High Gear: SPDZ with Global ZKPoK Check
5 Implementation
5.1 Vickrey Auction for 100 Parties
6 Future Work
References
Non-interactive Zero-Knowledge
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
1 Introduction
1.1 Designated-Verifier Non-interactive Zero-Knowledge
1.2 Our Contribution
1.3 Our Method
1.4 Applications
1.5 Related Work
1.6 Organization
2 Preliminaries
2.1 Encryption Schemes
2.2 Non-interactive Zero-Knowledge Proof Systems
3 A Framework for Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
3.1 Statements Defined by a Linear Map over G
3.2 A Framework for DVNIZK Proofs of Knowledge
3.3 Security Proof
4 Dual Variant of the Framework
4.1 Perfectly Binding Commitment over G
4.2 Equality of Plaintexts Between C and S
4.3 A Framework for Relations Between Plaintexts of S
References
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
1 Introduction
1.1 Quasi-Optimal SNARGs
1.2 Optimally-Laconic Arguments and 1-Bit SNARGs
1.3 Additional Related Work
2 Quasi-Optimal Linear MIP Construction Overview
2.1 Consistency Checking
3 Preliminaries
4 Quasi-Optimal Linear MIPs
4.1 Robust Decomposition for Circuit Satisfiability
4.2 Consistency Checking
4.3 Quasi-Optimal Linear MIP Construction
5 Quasi-Optimal SNARGs
5.1 Defining Quasi-Optimality
5.2 Quasi-Optimal SNARGs from Quasi-Optimal Linear MIPs
References
Anonymous Communication
Untagging Tor: A Formal Treatment of Onion Encryption
1 Introduction
2 Background and Preliminaries
2.1 An Overview of Tor
2.2 On the Relative Severity of Tagging Attacks
2.3 Notation
3 Modelling Onion Routing Networks
3.1 Onion Encryption
3.2 Correctness
3.3 Security
4 Channel Security
5 Anonymity
5.1 Capturing Tagging Attacks
6 Preventing Tagging Attacks
6.1 VIL Tweakable Ciphers and AEZ
6.2 Tor261: The Onion Encryption Scheme in Tor Proposal 261
6.3 Circuit Hiding
7 Conclusion
References
Exploring the Boundaries of Topology-Hiding Computation
1 Introduction
1.1 Our Results
1.2 Technical Overview
1.3 Related Work
2 Preliminaries
2.1 Secure Hardware
2.2 Topology Hiding Computation
2.3 Extended Definitions of THC
3 Lower Bounds
3.1 Semi-honest Topology-Hiding Broadcast Implies OT
3.2 Lower Bound on Information Leakage in Fail-Stop Model
4 Upper Bounds
4.1 OT Implies Semi-honest THC (for Small-Diameter Graphs)
4.2 Constructions for Fail-Stop Adversaries
References
Isogeny
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions
1 Introduction
1.1 Contributions
1.2 Related Work
2 Preliminaries
2.1 Background on Elliptic Curves
2.2 Quaternion Algebras, Bp, and the Deuring Correspondence
2.3 Supersingular Isogeny Graphs
2.4 The Charles-Goren-Lauter Hash Function
2.5 Isogeny-Based Cryptography
3 Problem Statements and Heuristics
3.1 The Deuring Correspondence
3.2 The Endomorphism Ring Computation Problem
3.3 Heuristics
4 Efficient Computations with Maximal Orders and Their Ideals
5 Equivalent Hard Problems in Supersingular Isogeny Graphs
5.1 Endomorphism Ring Computation Is not Harder than Inverse Deuring Correspondence
5.2 Quaternion -Isogeny Algorithm
5.3 Translating O0-Ideals to Isogenies
5.4 Inverse Deuring Correspondence Is not Harder than Endomorphism Ring Computation
5.5 Preimage and Collision Resistance of the CGL Hash Function
6 -PowerIsogeny Reduces to MaxOrder and Action-on-Torsion
6.1 Outline of Reduction
6.2 Reduction from -PowerIsogeny to MaxOrder and Action-on-Torsion
6.3 Going from an Ideal of Norm to a Corresponding Subgroup of Order
6.4 Isogeny Paths and Corresponding Filtrations of Left Ideals
6.5 Matching up a Filtration of an Ideal with a Factorization of an Isogeny
7 Some Easy Problems in Supersingular Isogeny Graphs
7.1 Constructive Deuring Correspondence, from Quaternion Orders to j-invariants
7.2 An Attack on the CGL Hash Function
8 The EndomorphismRing Problem
8.1 Representation Size of Endomorphism Rings
8.2 Compact Representations of Endomorphisms
8.3 EndomorphismRing Reduces to MaxOrder and Action-on-2-Torsion and Action-on-3-Torsion
8.4 EndomorphismRing Reduces to an Isogeny Problem
References
Leakage
On the Complexity of Simulating Auxiliary Input
1 Introduction
1.1 Upper Bound Results
1.2 Lower Bound Results
2 Preliminaries
2.1 Basic Definitions
2.2 Multiplicative Weight Update
3 Simulating Auxiliary Inputs
3.1 Boosting
3.2 Simulate Leakage with MWU
3.3 Efficient Approximation
4 Lower Bound for Leakage Simulation
4.1 Black-Box Model
4.2 Main Theorem and Related Results
4.3 Proof of Theorem 3
References
Key Exchange
Fuzzy Password-Authenticated Key Exchange
1 Introduction
1.1 Our Contributions
2 Security Model
3 General Construction Using Garbled Circuits
3.1 Building Blocks
3.2 Construction
3.3 An Efficient Circuit f for Hamming Distance
4 Specialized Construction for Hamming Distance
4.1 Building Blocks
4.2 Construction
4.3 Security of fPAKE RSS
4.4 Further Discussion
5 Comparison of fPAKE Protocols
References
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
1 Introduction
2 Bloom Filter Encryption
2.1 Formal Definition of Bloom Filters
2.2 Formal Model of BFE
2.3 Additional Properties of a PKEM
2.4 Security Definitions
2.5 Basic Bloom Filter Encryption
2.6 CCA-Security via Fujisaki-Okamoto
2.7 Time-Based Bloom Filter Encryption
3 Forward-Secret 0-RTT Key Exchange
3.1 Analysis
4 Conclusion
References
OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks
1 Introduction
2 The Strong aPAKE Functionality
3 Oblivious Pseudorandom Function
4 A Compiler from aPAKE to Strong aPAKE via OPRF
4.1 Proof of Security
5 A Compiler from AKE-KCI to Strong aPAKE via OPRF
5.1 UC Definition of AKE-KCI
5.2 Strong aPAKE Construction from OPRF and AKE-KCI
5.3 Proof of Security
6 OPAQUE: A Strong Asymmetric PAKE Instantiation
6.1 Protocol Details and Properties
6.2 An OPAQUE Variant: Multiplicative Blinding
A The DH-OPRF Protocol Realizing Revised FOPRF
References
Quantum
Unforgeable Quantum Encryption
1 Introduction
1.1 Our Approach
1.2 Summary of Results
2 Preliminaries
3 One-Time Ciphertext Authentication
4 Quantum Unforgeability
5 Quantum IND-CCA2
6 Quantum Authenticated Encryption
7 Constructions and Separations
8 Discussion
References
Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
1 Introduction
1.1 Background
1.2 Our Contributions
1.3 Technical Overview
1.4 Related Work
2 Preliminaries
2.1 Notation
2.2 Quantum Computation
2.3 Public-Key Encryption
2.4 Key Encapsulation
2.5 eXtendable-Output Functions
2.6 Assumptions
3 Disjoint Simulatability of Deterministic PKE
3.1 Definition
3.2 Sufficient Condition: Sparse Pseudorandomness
3.3 Instantiations
3.4 Generic Conversion from IND-CPA-Secure PKE
4 Conversion from Disjoint Simulatability to IND-CCA
5 Implementation
5.1 NTRU-HRSS
5.2 Experimental Results
A Missing Definitions
B Transformations in the Random Oracle Model
C Omitted Proofs
C.1 Proof of Lemma2.2
References
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
1 Introduction
1.1 Our Results
1.2 Concrete Bounds and Comparison with Unruh AC:Unruh17,cryptoeprint:2017:398
2 Preliminaries
2.1 Quantum Computation
2.2 Pseudorandom Functions
2.3 Canonical Identification Schemes
2.4 Digital Signatures
3 Fiat-Shamir in the Quantum Random-Oracle Model
3.1 Signatures from Identification Schemes
3.2 Security Proof
4 Dilithium-QROM
4.1 Preliminaries
4.2 The Identification Protocol
4.3 Security Properties
4.4 The Dilithium-QROM Signature Scheme and Concrete Parameters
4.5 Security Assumptions for Non-lossy Schemes
References
Non-maleable Codes
Non-malleable Randomness Encoders and Their Applications
1 Introduction
1.1 Prior Work
1.2 Our Results
1.3 Organization of the Paper
2 Preliminaries
2.1 Definitions
3 Building Blocks
3.1 One-Time Message Authentication Codes
3.2 Average-Case Extractors
4 Non-malleable Randomness Encoders
4.1 Definition
4.2 Notation
4.3 Construction Overview
4.4 Security Proof
4.5 Rate and Error Analysis
5 Non-malleable Codes from Non-malleable Randomness Encoders
5.1 Construction Overview
5.2 Security Proof
5.3 Rate and Error Analysis
6 Conclusion
A Proofs of Claims 2 and 3 in Sect.4.4
A.1 Proof of Claim 2 in Sect.4.4
A.2 Alternate proof of Claim 3 in Sect.4.4
B Appendix: From t-source Strong Non-malleable Extractors to t-state 1-augmented NMC
References
Non-malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
1 Introduction
1.1 Our Results
1.2 Technical Overview
1.3 Related Work
2 Definitions
3 Generic Construction for One-Bit Messages
4 One-Bit NMC for AC0
5 Construction for Multi-bit Messages
6 Efficient, Multi-bit NMC for AC0
7 One-Bit NMC Against Streaming Adversaries
References
Provable Symmetric Cryptography
Naor-Reingold Goes Public: The Complexity of Known-Key Security
1 Introduction
1.1 Overview and Motivation
1.2 Public-Seed Pseudorandomness via the NR Construction
1.3 Correlation Intractability
1.4 Technical Overview - psPRPs
1.5 Technical Overview - Correlation Intractability
2 Preliminaries
2.1 UCEs and psPRPs
2.2 Evasive Relations, Correlation Intractability
3 Public-Seed Pseudorandomness of Naor-Reingold
3.1 The NR Construction and Its Indistinguishability
3.2 The Case of Unpredictable Sources
3.3 The Case of Reset-Secure Sources
4 Correlation Intractability of Public-Seed Permutations
4.1 Strong Evasiveness
4.2 Partial Correlation Intractability of Two-Round Feistel
4.3 Correlation Intractability of the NR Construction
4.4 Proof of Proposition 3
References
Updatable Encryption with Post-Compromise Security
1 Introduction
2 Preliminaries
3 Formalizing Updatable Encryption
3.1 Security Properties
3.2 Definition of Oracles
3.3 ``Leakage'' Profiles
3.4 Security Notions for Updatable Encryption
4 Comparison with Existing Models
4.1 weakUPINDBI vs. strongUPINDBI
4.2 Insecurity of XORKEM in the strongUPINDBI and INDENC Model
4.3 INDENC vs. strongUPINDBI (and weakUPINDBI)
4.4 INDUPD vs. UPREENC
5 Constructions
5.1 Double Encryption (2ENC)
5.2 Schemes from Key-Homomorphic PRFs (BLMR and BLMR+)
5.3 Updatable Encryption Based on ElGamal (RISE)
6 Conclusion and Open Problems
A Symmetric Key-Encapsulation (SEKEM)
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken