Normal view MARC view ISBD view

Advances in Cryptology â€" EUROCRYPT 2014 : 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings.

By: Nguyen, Phong Q.
Contributor(s): Oswald, Elisabeth.
Material type: TextTextSeries: eBooks on Demand.Publisher: Berlin/Heidelberg : Springer Berlin Heidelberg, 2014Copyright date: ©2014Description: 1 online resource (728 pages).Content type: text Media type: computer Carrier type: online resourceISBN: 9783642552205.Subject(s): Computer security-Congresses | Data encryption (Computer science)-Congresses | Computer networks-Security measures-CongressesGenre/Form: Electronic books.Additional physical formats: Print version:: Advances in Cryptology â€" EUROCRYPT 2014 : 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. ProceedingsDDC classification: 005.8 LOC classification: QA76.9.A25 .A383 2014Online resources: Click here to view this ebook.
Contents:
Intro -- Preface -- EUROCRYPT 2014 -- Table of Contents -- Public-Key Cryptanalysis -- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic -- 1 Introduction -- 2 Main Result -- 3 Consequences for Various Ranges of Parameters -- 3.1 Case Where the Field is Fq2k, with q ≈ k -- 3.2 Case Where the Characteristic is Polynomial in the Input Size -- 3.3 Case Where q = Lq2k(α) -- 4 Main Algorithm: Proof of Proposition 2 -- 5 Supporting the Heuristic Argument in the Proof -- 6 Some Directions of Improvement -- 6.1 Complexity Improvement -- 6.2 Practical Improvements -- 7 Conclusion -- References -- Polynomial Time Attack on Wild McEliece over Quadratic Extensions -- 1 Introduction -- 2 Notation, Definitions and Prerequisites -- 3 A Distinguisher Based on Square Codes -- 3.1 Square Code -- 3.2 A Distinguisher Obtained by Shortening -- 4 The Code Filtration -- 4.1 Main Tool -- 4.2 The Computation of the Filtration -- 5 An Efficient Attack Using the Distinguisher -- 6 Improvement of the Attack -- 7 Complexity and Implementation -- 7.1 Computation of a Code Product -- 7.2 Computation of the Filtration -- 7.3 Other Computations -- 7.4 Implementation -- 8 Conclusion -- References -- Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus -- 1 Introduction -- 2 Summation Polynomials and Index Calculus -- 3 Action of Torsion Points -- 3.1 Equivariant Morphisms -- 3.2 Reducing the Factor Base -- 3.3 Symmetries of Summation Polynomials -- 4 Summation Polynomials Associated to Degree Two Morphisms -- 4.1 Speeding Up the Relation Search Using One 2-Torsion Point -- 4.2 Action of the Full 2-Torsion -- 4.3 Invariant Fields and Invariant Rings -- 5 Examples and Applications -- 5.1 Computation of Summation Polynomials -- 5.2 Index Calculus on E(Fq5) -- 6 Conclusion.
References -- Identity-Based Encryption -- Why Proving HIBE Systems Secure Is Difficult -- 1 Introduction -- 2 Preliminaries -- 2.1 Prefix Encryption -- 2.2 Hierarchical Identity-Based Encryption -- 2.3 Non-interactive Decisional Problems and Simple Black Box Reductions -- 2.4 Obtaining Prefix Encryption from HIBE -- 3 Main Result -- 4 Implications for Existing Constructions -- 4.1 The Boneh-Boyen HIBE Construction -- References -- Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack -- 1 Introduction -- 2 Preliminaries -- 2.1 Key Derivation Functions -- 2.2 Efficiently Samplable and Explainable Domain -- 3 Extractable IBE with One-Sided Public Openability (Extractable 1SPO-IBE) -- 4 Strengthened Cross-authentication Codes -- 5 Proposed SIM-SO-CCA Secure IBE Scheme -- 6 Proposed IND-ID-CCA Secure Extractable 1SPO-IBE Scheme -- References -- Key Derivation and Quantum Computing -- Key Derivation without Entropy Waste -- 1 Introduction -- 1.1 Our Main Results -- 1.2 Computational Extractors -- 2 Preliminaries -- 3 Defining Extractors for Unpredictability Applications -- 4 Constructing Unpredictability Extractors -- 4.1 Sufficient Independence Provides Balance -- 4.2 Minimizing the Seed Length -- 4.3 A Probabilistic Method Bound -- 5 SRT Lower-Bound: Samplability Doesn't Improve Entropy Loss -- References -- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Our Techniques -- 1.3 Related Works -- 2 Preliminaries -- 2.1 Definitions of Non-malleable Codes -- 3 Improved Leakage-Resilient Codes -- 4 Non-malleable Codes -- 4.1 Proof of Theorem 2 -- 5 Non-malleable Key-Derivation -- References -- Revocable Quantum Timed-Release Encryption -- 1 Introduction -- 1.1 Example Applications -- 1.2 Our Contribution -- 1.3 Preliminaries.
2 Defining Revocable TREs -- 3 Constructing Revocably One-Way TREs -- 4 Revocably Hiding TREs -- 5 TREs in the Random Oracle Model -- 5.1 One-Way to Hiding -- 5.2 Precomputation -- 5.3 Iterated Hashing -- References -- Secret-Key Analysis and Implementations -- Generic Universal Forgery Attack on Iterative Hash-Based MACs -- 1 Introduction -- 2 Description of NMAC and HMAC -- 3 Previous Functional-Graph-Based Attacks for HMAC -- 4 General Description of the Universal Forgery Attack -- 4.1 The Height Property of a Node in a Functional Graph -- 4.2 Deducing Online the Height of a Few Intermediate Hash Values -- 4.3 Deducing Offline the Height of Many Chosen Values -- 4.4 Exploiting the Height Information Leakage -- 4.5 Attack Summary -- 5 Full Procedure of the Universal Forgery Attack -- 5.1 Complexity and Success Probability Analysis -- 5.2 Experimental Verification -- 6 Conclusion -- References -- Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities -- 1 Introduction -- 2 Preliminaries -- 2.1 ML and TD Setting and Notation -- 2.2 Mathematical Link -- 2.3 Complexity of an Attack -- 3 Complexity of a Distinguishing Attack -- 3.1 ML Distinguishing Attacks -- 3.2 TD and SS Distinguishing Attacks -- 3.3 Comparison between ML and TD Distinguishers -- 4 TD and SS Key-Recovery Attacks -- 4.1 Last-Rounds TD and SS Key-Recovery Attack -- 4.2 Using the Link between TD and SS Attacks to Analyze the SS Attack on 24 Rounds of PRESENT -- 5 Comparison of TD and ML Key-Recovery Attacks -- 5.1 Partial Key-Recovery Attack on the First Rounds -- 5.2 Chosen-Plaintext Versus Known-Plaintext Attack -- 5.3 A Differential Attack on 26 Rounds of PRESENT -- 6 Links between Other Statistical Attacks -- 6.1 Integral, Zero-Correlation and Uniform TD Attacks -- 6.2 Impossible Differential and ML Attacks.
6.3 Classical Differential and Linear Cryptanalysis -- 7 Conclusion -- References -- Faster Compact Diffie-Hellman: Endomorphisms on the x-line -- 1 Introduction -- 2 The Curve -- 3 Efficient Endomorphisms on E, E' , and the x-line -- 4 Scalar Decompositions -- 5 Two-Dimensional Differential Addition Chains -- 6 Timings -- References -- Obfuscation and Multilinear Maps -- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation -- 1 Introduction -- 1.1 Other Related Work -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Constrained PRFs -- 2.3 RSA Assumption and Shamir's Lemma -- 2.4 Bilinear Groups and the CDH Assumption -- 2.5 The n-Diffie-Hellman Inversion Assumption -- 3 Full-Domain Hash Signatures (Selectively Secure) -- 4 Adaptively Secure RSA Full Domain Hash Signatures -- 5 Selectively Secure BLS Signatures -- 6 Adaptively Secure BLS Signatures -- 7 Extensions to Boneh-Franklin IBE and Aggregate Signatures -- References -- Protecting Obfuscation against Algebraic Attacks -- 1 Introduction -- 1.1 Our Techniques -- 2 Preliminaries -- 2.1 "Virtual Black-Box" Obfuscation in an Idealized Model -- 2.2 Branching Programs -- 3 Straddling Set System -- 4 The Ideal Graded Encoding Model -- 5 Obfuscation in the Ideal Graded Encoding Model -- 6 Proof of VBB in the the Ideal Graded Encoding Model -- References -- GGHLite: More Efficient Multilinear Mapsfrom Ideal Lattices -- 1 Introduction -- 2 Preliminaries -- 3 GGH and Its Re-randomization Procedure -- 3.1 The GGH Scheme -- 3.2 The GDDH, GCDH and Ext-GCDH Problems -- 3.3 The GGH Re-randomization Security Requirement -- 3.4 Our Security Goal: Canonical Assumptions -- 4 Polynomial Drowning via Rényi Divergence -- 5 A Discrete Gaussian Leftover Hash Lemma over R -- 6 Our Improved GGH Grading Scheme: GGHLite -- 7 Parameter Settings -- References.
Authenticated Encryption -- Reconsidering Generic Composition -- 1 Introduction -- 2 Definitions -- 3 AE from IV-Based Encryption and a vecMAC -- 4 AE from IV-Based Encryption and a strMAC -- 5 AE from Nonce-Based Encryption and a MAC -- 6 The ISO-Standard for Generic Composition -- References -- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Notations -- 2.2 Random Function and Pseudorandom Function -- 2.3 Definition of Authenticated Encryption -- 3 Specification of OTR -- 4 Security Bounds -- 5 Proofs of Theorems 1 and 2 -- 6 Experimental Results on Software -- 7 Remarks -- 7.1 Remove Inverse from OCB -- 7.2 Design Rationale for Masking -- 7.3 Comparison with Other Inverse-Free Modes -- 7.4 Other Instantiations -- 8 Concluding Remarks -- References -- Symmetric Encryption -- Honey Encryption: Security Beyond the Brute-Force Bound -- 1 Introduction -- 2 Related Work -- 3 HE Overview -- 4 Distribution-Transforming Encoders -- 5 DTE-Then-Encrypt Constructions -- 6 Balls-and-Bins Analyses -- 7 Example Applications, Bounds, and Deployment Considerations -- 7.1 HE for Credit Card Numbers, PINs, and CVVs -- 7.2 HE for RSA Secret Keys -- 7.3 Deployment Considerations -- 8 Conclusion -- References -- Sometimes-Recurse Shuffle Almost-Random Permutations in Logarithmic Expected Time -- 1 Introduction -- 2 Preliminaries -- 3 Mix-and-Cut Shuffle -- 4 Sometimes-Recurse Shuffle -- 5 Parameter Optimization -- 6 Incorporating Tweaks -- 7 Absence of Timing Attacks -- 8 Discussion -- References -- Tight Security Bounds for Key-Alternating Ciphers -- 1 Introduction -- 2 Definitions and Main Result -- 3 The H-Coefficient Technique in a Nutshell -- 4 Proof of Theorem 1 -- References -- The Locality of Searchable Symmetric Encryption -- 1 Introduction -- 2 Preliminaries.
3 Read Efficiency and Locality Metrics for SSE Schemes.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number URL Status Date due Barcode
Electronic Book UT Tyler Online
Online
QA76.9.A25 .A383 2014 (Browse shelf) https://ebookcentral.proquest.com/lib/uttyler/detail.action?docID=3096837 Available EBC3096837

Intro -- Preface -- EUROCRYPT 2014 -- Table of Contents -- Public-Key Cryptanalysis -- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic -- 1 Introduction -- 2 Main Result -- 3 Consequences for Various Ranges of Parameters -- 3.1 Case Where the Field is Fq2k, with q ≈ k -- 3.2 Case Where the Characteristic is Polynomial in the Input Size -- 3.3 Case Where q = Lq2k(α) -- 4 Main Algorithm: Proof of Proposition 2 -- 5 Supporting the Heuristic Argument in the Proof -- 6 Some Directions of Improvement -- 6.1 Complexity Improvement -- 6.2 Practical Improvements -- 7 Conclusion -- References -- Polynomial Time Attack on Wild McEliece over Quadratic Extensions -- 1 Introduction -- 2 Notation, Definitions and Prerequisites -- 3 A Distinguisher Based on Square Codes -- 3.1 Square Code -- 3.2 A Distinguisher Obtained by Shortening -- 4 The Code Filtration -- 4.1 Main Tool -- 4.2 The Computation of the Filtration -- 5 An Efficient Attack Using the Distinguisher -- 6 Improvement of the Attack -- 7 Complexity and Implementation -- 7.1 Computation of a Code Product -- 7.2 Computation of the Filtration -- 7.3 Other Computations -- 7.4 Implementation -- 8 Conclusion -- References -- Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus -- 1 Introduction -- 2 Summation Polynomials and Index Calculus -- 3 Action of Torsion Points -- 3.1 Equivariant Morphisms -- 3.2 Reducing the Factor Base -- 3.3 Symmetries of Summation Polynomials -- 4 Summation Polynomials Associated to Degree Two Morphisms -- 4.1 Speeding Up the Relation Search Using One 2-Torsion Point -- 4.2 Action of the Full 2-Torsion -- 4.3 Invariant Fields and Invariant Rings -- 5 Examples and Applications -- 5.1 Computation of Summation Polynomials -- 5.2 Index Calculus on E(Fq5) -- 6 Conclusion.

References -- Identity-Based Encryption -- Why Proving HIBE Systems Secure Is Difficult -- 1 Introduction -- 2 Preliminaries -- 2.1 Prefix Encryption -- 2.2 Hierarchical Identity-Based Encryption -- 2.3 Non-interactive Decisional Problems and Simple Black Box Reductions -- 2.4 Obtaining Prefix Encryption from HIBE -- 3 Main Result -- 4 Implications for Existing Constructions -- 4.1 The Boneh-Boyen HIBE Construction -- References -- Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack -- 1 Introduction -- 2 Preliminaries -- 2.1 Key Derivation Functions -- 2.2 Efficiently Samplable and Explainable Domain -- 3 Extractable IBE with One-Sided Public Openability (Extractable 1SPO-IBE) -- 4 Strengthened Cross-authentication Codes -- 5 Proposed SIM-SO-CCA Secure IBE Scheme -- 6 Proposed IND-ID-CCA Secure Extractable 1SPO-IBE Scheme -- References -- Key Derivation and Quantum Computing -- Key Derivation without Entropy Waste -- 1 Introduction -- 1.1 Our Main Results -- 1.2 Computational Extractors -- 2 Preliminaries -- 3 Defining Extractors for Unpredictability Applications -- 4 Constructing Unpredictability Extractors -- 4.1 Sufficient Independence Provides Balance -- 4.2 Minimizing the Seed Length -- 4.3 A Probabilistic Method Bound -- 5 SRT Lower-Bound: Samplability Doesn't Improve Entropy Loss -- References -- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Our Techniques -- 1.3 Related Works -- 2 Preliminaries -- 2.1 Definitions of Non-malleable Codes -- 3 Improved Leakage-Resilient Codes -- 4 Non-malleable Codes -- 4.1 Proof of Theorem 2 -- 5 Non-malleable Key-Derivation -- References -- Revocable Quantum Timed-Release Encryption -- 1 Introduction -- 1.1 Example Applications -- 1.2 Our Contribution -- 1.3 Preliminaries.

2 Defining Revocable TREs -- 3 Constructing Revocably One-Way TREs -- 4 Revocably Hiding TREs -- 5 TREs in the Random Oracle Model -- 5.1 One-Way to Hiding -- 5.2 Precomputation -- 5.3 Iterated Hashing -- References -- Secret-Key Analysis and Implementations -- Generic Universal Forgery Attack on Iterative Hash-Based MACs -- 1 Introduction -- 2 Description of NMAC and HMAC -- 3 Previous Functional-Graph-Based Attacks for HMAC -- 4 General Description of the Universal Forgery Attack -- 4.1 The Height Property of a Node in a Functional Graph -- 4.2 Deducing Online the Height of a Few Intermediate Hash Values -- 4.3 Deducing Offline the Height of Many Chosen Values -- 4.4 Exploiting the Height Information Leakage -- 4.5 Attack Summary -- 5 Full Procedure of the Universal Forgery Attack -- 5.1 Complexity and Success Probability Analysis -- 5.2 Experimental Verification -- 6 Conclusion -- References -- Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities -- 1 Introduction -- 2 Preliminaries -- 2.1 ML and TD Setting and Notation -- 2.2 Mathematical Link -- 2.3 Complexity of an Attack -- 3 Complexity of a Distinguishing Attack -- 3.1 ML Distinguishing Attacks -- 3.2 TD and SS Distinguishing Attacks -- 3.3 Comparison between ML and TD Distinguishers -- 4 TD and SS Key-Recovery Attacks -- 4.1 Last-Rounds TD and SS Key-Recovery Attack -- 4.2 Using the Link between TD and SS Attacks to Analyze the SS Attack on 24 Rounds of PRESENT -- 5 Comparison of TD and ML Key-Recovery Attacks -- 5.1 Partial Key-Recovery Attack on the First Rounds -- 5.2 Chosen-Plaintext Versus Known-Plaintext Attack -- 5.3 A Differential Attack on 26 Rounds of PRESENT -- 6 Links between Other Statistical Attacks -- 6.1 Integral, Zero-Correlation and Uniform TD Attacks -- 6.2 Impossible Differential and ML Attacks.

6.3 Classical Differential and Linear Cryptanalysis -- 7 Conclusion -- References -- Faster Compact Diffie-Hellman: Endomorphisms on the x-line -- 1 Introduction -- 2 The Curve -- 3 Efficient Endomorphisms on E, E' , and the x-line -- 4 Scalar Decompositions -- 5 Two-Dimensional Differential Addition Chains -- 6 Timings -- References -- Obfuscation and Multilinear Maps -- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation -- 1 Introduction -- 1.1 Other Related Work -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Constrained PRFs -- 2.3 RSA Assumption and Shamir's Lemma -- 2.4 Bilinear Groups and the CDH Assumption -- 2.5 The n-Diffie-Hellman Inversion Assumption -- 3 Full-Domain Hash Signatures (Selectively Secure) -- 4 Adaptively Secure RSA Full Domain Hash Signatures -- 5 Selectively Secure BLS Signatures -- 6 Adaptively Secure BLS Signatures -- 7 Extensions to Boneh-Franklin IBE and Aggregate Signatures -- References -- Protecting Obfuscation against Algebraic Attacks -- 1 Introduction -- 1.1 Our Techniques -- 2 Preliminaries -- 2.1 "Virtual Black-Box" Obfuscation in an Idealized Model -- 2.2 Branching Programs -- 3 Straddling Set System -- 4 The Ideal Graded Encoding Model -- 5 Obfuscation in the Ideal Graded Encoding Model -- 6 Proof of VBB in the the Ideal Graded Encoding Model -- References -- GGHLite: More Efficient Multilinear Mapsfrom Ideal Lattices -- 1 Introduction -- 2 Preliminaries -- 3 GGH and Its Re-randomization Procedure -- 3.1 The GGH Scheme -- 3.2 The GDDH, GCDH and Ext-GCDH Problems -- 3.3 The GGH Re-randomization Security Requirement -- 3.4 Our Security Goal: Canonical Assumptions -- 4 Polynomial Drowning via Rényi Divergence -- 5 A Discrete Gaussian Leftover Hash Lemma over R -- 6 Our Improved GGH Grading Scheme: GGHLite -- 7 Parameter Settings -- References.

Authenticated Encryption -- Reconsidering Generic Composition -- 1 Introduction -- 2 Definitions -- 3 AE from IV-Based Encryption and a vecMAC -- 4 AE from IV-Based Encryption and a strMAC -- 5 AE from Nonce-Based Encryption and a MAC -- 6 The ISO-Standard for Generic Composition -- References -- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Notations -- 2.2 Random Function and Pseudorandom Function -- 2.3 Definition of Authenticated Encryption -- 3 Specification of OTR -- 4 Security Bounds -- 5 Proofs of Theorems 1 and 2 -- 6 Experimental Results on Software -- 7 Remarks -- 7.1 Remove Inverse from OCB -- 7.2 Design Rationale for Masking -- 7.3 Comparison with Other Inverse-Free Modes -- 7.4 Other Instantiations -- 8 Concluding Remarks -- References -- Symmetric Encryption -- Honey Encryption: Security Beyond the Brute-Force Bound -- 1 Introduction -- 2 Related Work -- 3 HE Overview -- 4 Distribution-Transforming Encoders -- 5 DTE-Then-Encrypt Constructions -- 6 Balls-and-Bins Analyses -- 7 Example Applications, Bounds, and Deployment Considerations -- 7.1 HE for Credit Card Numbers, PINs, and CVVs -- 7.2 HE for RSA Secret Keys -- 7.3 Deployment Considerations -- 8 Conclusion -- References -- Sometimes-Recurse Shuffle Almost-Random Permutations in Logarithmic Expected Time -- 1 Introduction -- 2 Preliminaries -- 3 Mix-and-Cut Shuffle -- 4 Sometimes-Recurse Shuffle -- 5 Parameter Optimization -- 6 Incorporating Tweaks -- 7 Absence of Timing Attacks -- 8 Discussion -- References -- Tight Security Bounds for Key-Alternating Ciphers -- 1 Introduction -- 2 Definitions and Main Result -- 3 The H-Coefficient Technique in a Nutshell -- 4 Proof of Theorem 1 -- References -- The Locality of Searchable Symmetric Encryption -- 1 Introduction -- 2 Preliminaries.

3 Read Efficiency and Locality Metrics for SSE Schemes.

Description based on publisher supplied metadata and other sources.

There are no comments for this item.

Log in to your account to post a comment.