Progress in Cryptology -- AFRICACRYPT 2012

Name: Progress in Cryptology -- AFRICACRYPT 2012 | 5th International Conference on Cryptology in Africa, Ifrane, Morocco, July 10-12, 2012, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

5th International Conference on Cryptology in Africa, Ifrane, Morocco, July 10-12, 2012, Proceedings

Aikaterini Mitrokotsa Serge Vaudenay(Herausgeber*in)

Springer (Verlag)

Erschienen am 21. Juni 2012

XI, 424 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-31410-0 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title
Preface
Organization
Table of Contents
Signature Schemes
Batch Verification of ECDSA Signatures
Introduction
Notations
Naive Batch Verification Algorithms N and N' for ECDSA
A New Batch-Verification Algorithm for ECDSA (Algorithm S1)
Symbolic Computation of R=i=1tRi
Solving the Multivariate Equations
A Strategy for Faster Equation Generation
Retrieving the Unknown y-Coordinates
Analysis of Algorithm S1
Running Time
Unique Solvability of the Linearized System
Security Analysis
Cases of Failure for Algorithm S1
A More Efficient Batch-Verification Algorithm (Algorithm S2)
Analysis of Algorithm S2
Running Time
Security Analysis
Efficient Variants of S1 and S2
Algorithm S1'
Algorithm S2'
Experimental Results
Conclusion
References
Extended Security Argumentsfor Signature Schemes
Introduction
Preliminaries
Extended Security Arguments for Digital Signatures
n-Generic Signature Schemes
An Extended Forking Lemma
Security of n-Generic Signature Schemes
Applications
n-Generic Signature Schemes Derived from Identification Schemes
Examples
References
Sanitizable Signatures with Several Signers and Sanitizers
Introduction
Multi-players Sanitizable Signatures
Security Requirements
Primitives
A New Tool: Trapdoor ``or'' Proof
Full Transparent and Fully Anonymous Multi-players Sanitizable Signature
References
Stream Ciphers
Attack Based on Direct Sum Decomposition against the Nonlinear Filter Generator
Introduction
Preliminaries
Using Direct Sum Decomposition to Distinguish the Shifted Sequence
Attack Based on Direct Sum Decomposition against the NLFG
Main Idea
Computing the Coefficient Matrix At+c
Attack against the NLFG
Results
Conclusion
References
Applications of Information Theory
Fuzzy Vault for Multiple Users
Introduction
Fuzzy Vault (FV) Scheme
Folded Reed-Solomon Codes
A Few Definitions
List Decoding of Folded Reed-Solomon Codes
Generalization to List Recovery
Extended Fuzzy Vault (EFV) Scheme
LOCK
UNLOCK
Security Properties of the EFV Scheme
Uniform Case
General Case
Implementation Aspects
Noise
Complexity
Conclusion
References
Bounds and Constructions for 1-Round (0, d)-Secure Message Transmission against Generalized Adversary
Introduction
Preliminaries
Secure Message Transmission
Secret Sharing
Linear Secret Sharing Scheme
Secret Sharing Scheme with Cheaters
Relations between Secret Sharing with Cheating and 1-Round (0, )-SMT against a Generalized Adversary
From Secret Sharing to Secure Message Transmission Tolerating a Generalized Adversary
From Secure Message Transmission to Secret Sharing Tolerating a Generalized Adversary
Lower Bound on Communication Complexity of 1-Round (0, 0)-SMT and (0, )-SMT against Generalized Adversaries
An Efficient 1-Round (0, )-SMT Protocol against a Generalized Adversary
Comparison with the Protocol in CKP11
References
Improving the Performance of the SYND Stream Cipher
Introduction
Coding Theory Background
The SYND Stream Cipher
Our Proposal: XSYND
Security of XSYND
Theoretical Security
Practical Security
Parameters and Experimental Results
Conclusion
References
Block Ciphers
Impossible Differential Cryptanalysis of the Lightweight Block Ciphers TEA, XTEA and HIGHT
Introduction
Preliminary
Notations
Brief Description of TEA and XTEA
Brief Description of HIGHT
Diffusion Properties of TEA, XTEA and HIGHT
Impossible Differential Attacks on Reduced XTEA and TEA
Impossible Differentials of TEA and XTEA
Impossible Differential Attack of 23-Round XTEA
Impossible Differential Attack of 17-Round TEA
Impossible Differential Cryptanalysis of Reduced HIGHT
Improved Impossible Differential Attack on 26-Round HIGHT
Impossible Differential Attack on 27-Round HIGHT
Conclusion
References
Three-Subset Meet-in-the-Middle Attack on Reduced XTEA
Introduction
Specification of XTEA
Previous Work
Previous Meet-in-the-Middle Attack on XTEA
Three-Subset Meet-in-the-Middle Attack
Maintaining Small Data Complexity in Three-Subset MitM Attack with Splice-and-Cut Technique
Attacks on XTEA
Known Plaintext Attack on 25-Round XTEA
Chosen Plaintext Attack on 28-Round XTEA
Concluding Remarks
References
Differential Cryptanalysis of Reduced-Round ICEBERG
Introduction
Description of ICEBERG
Non-linear Layer
Linear Layer K
Differential Distinguishers of 6-Round ICEBERG
Differential Characteristic of 6-Round ICEBERG
Property of Linear Layer P64-DP4-P64
Search the 6-Round Differential Characteristics
Differentials of 6-Round ICEBERG
Structures of Differentials of 6-Round ICEBERG
Attacks against Reduced-Round ICEBERG
Structure Attack to 7-Round ICEBERG
Multiple Differential Attack against 8-Round ICEBERG
Summary
References
Compact Implementation and Performance Evaluation of Block Ciphers in ATtiny Devices
Introduction
Investigated Ciphers
Methodology and Metrics
Description of the ATtiny45 Microcontroller
Implementation Details
Performance Evaluation
Conclusion
References
Network Security Protocols
Cryptanalysis of Enhanced TTS, STS and All Its Variants, or: Why Cross-Terms Are Important
Introduction
Cryptanalysis of Enhanced STS
Cryptanalysis of Enhanced STS Variants
Cryptanalysis of Enhanced TTS
Conclusions or: Where Do We Take It from Here?
References
A Complementary Analysis of the (s)YZ and DIKE Protocols
Introduction
The Canetti-Krawczyk Security Model(s)
The CKHMQV Model
The YZ Protocols Family
On the Attributes of the (s)YZ Protocols
The Deniable Internet Key Exchange (DIKE)
Conclusion
References
Public-Key Cryptography
A New Attack on RSA and CRT-RSA
Introduction
Preliminaries
The Original RSA and CRT-RSA
Bivariate Linear Equations Modulo Divisors
A New Class of Weak Public Exponents in RSA
Application to CRT-RSA
Experimental Results
A Working Example
Massive Experiments
Conclusion
References
Shift-Type Homomorphic Encryptionand Its Application to Fully Homomorphic Encryption
Introduction
Contribution and Related Work
Outline
Preliminaries
Notation
Public-Key Homomorphic Encryption Schemes
The Subset Membership Problem
Shift-Type Homomorphic Encryption
Fully Homomorphic Encryption (FHE)
Gentry's Bootstrapping Technique: Leveled FHE Schemes
Gentry's Bootstrapping Technique: FHE Schemes
Gentry's Bootstrapping Technique: The Existing Schemes
Conclusion
References
Cryptanalysis of Hash Functions
The Collision Security of MDC-4
Introduction
Preliminaries
General Notations
The MDC-4 Compression Function
Security of the MDC-4 Compression Function and the MDC-4 Hash Function
Proof of Collision Resistance
Proof Model
Our Results
Proof Preliminaries
Details
Conclusion
References
SPN-Hash: Improving the Provable Resistance against Differential Collision Attacks
Introduction
Our Contributions
Preliminaries
The SPN-Hash Functions
The Internal Permutation P
Generalized Optimal Diffusion
MDS Layer
Security Analysis of SPN-Hash
Differential Collision Attack
(Second)-Preimage Attack
Rebound Attack - Distinguishing Attack on Permutation P
Exploiting the MDS Layer Structure for 128- and 256-bit SPN-Hash
Implementation
Software Performance
Hardware Performance
References
Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
Introduction
Preliminaries
Preimage, Second Preimage and Collision Security
Indifferentiability
Hash Function Design Strategies
BLAKE
Grøstl
JH
Keccak
Skein
Conclusions
References
Hash Functions: Design and Implementation
The GLUON Family: A Lightweight Hash Function Family Based on FCSRs
Background
Sponge Constructions
FCSR Automata in Word Ring Representation
Description of the GLUON Hash Family
Details of the f Function
The Sponge Construction Deduced from the f Function
Proposed Instances
Design Rationale
Flat Sponge Claim
Choice of the f Function
Security Analysis
Performances
Hardware Performances
Software Performances
Conclusion
References
SHA-3 on ARM11 Processors
Introduction
The ARM11 Processor Family
Blake
Implementation Details
Grøstl
Implementation Details
JH
Implementation Details
Keccak
Implementation Details
Skein
Implementation Details
SHA-256
Results and Comparison
References
Algorithms for Public-Key Cryptography
Improved Fixed-Base Comb Method for Fast Scalar Multiplication
Introduction
Preliminaries
Generic Methods
Fixed Base-Point Methods
Fixed-Base Comb Methods
Lim and Lee Method
Tsaur and Chou Method
Our Proposed Method
Simultaneous Scalar Multiplication
Resistance to Side Channel Attacks
Discussion and Results
Conclusion
References
Optimal First-Order Masking with Linear and Non-linear Bijections
Introduction
Studied Implementation and Its Leakage
Optimal Function in Zero-Offset dth-Order CPA
Optimal Function fopt Definition
Condition on F for the Resistance against 2nd-Order CPA
Condition on F for the Resistance against dth-Order CPA
Existence of Bijections Meeting Eqn. (6)
Optimal Linear Bijections
Optimal Non-linear Bijections
Security and Leakage Evaluations of the Optimal Linear and Non-linear Bijections
Verification of the Security for n=8
Verification of the Leakage of the Identified Bijections
Results in Imperfect Models
Conclusions
References
Cryptographic Protocols
Size-Hiding in Private Set Intersection: Existential Results and Constructions
Introduction
Preliminaries: Definitions and Tools
Definitions
Tools
Two-Side Size-Hiding: The Unconditional Case
Impossibility in the Plain Model
Feasibility in the Model with a Setup by a TTP
Two-Side Size-Hiding: The Computationally Secure Case
An AND-Based TS-SHI-PSI Protocol
Threshold-Based Protocol
One-Side Size-Hiding Set Intersection Protocols
Pseudorandom Function Evaluation Based Protocols
RSA-Based Protocol
Three-Round ROM Based Protocol
One-Round ROM Based Protocol
Open Problems
References
Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
Introduction
Preliminaries
Construction
Analyzing the Simulator
General Observations
Running Time
Indistinguishability
Conclusion
References
Invited Talks
Stream Ciphers, a Perspective
Black-Box Reductions and Separations in Cryptography
Introduction
Black-Box Constructions
One-Way Functions Are Necessary
One-Way Functions Are Sufficient for Minicrypt
Black-Box Separations
Relativizing Reductions: Separating Key Agreement from One-Way Functions
Fully Black-Box Reductions: The Two-Oracle Technique by Hsiao and Reyzin
The Meta-reduction Technique
Non-black-Box Constructions
Karp Reductions Are Non-black-Box
Barak's Non-black-Box Zero-Knowledge Proofs
Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken