Progress in Cryptology -- AFRICACRYPT 2011

Name: Progress in Cryptology -- AFRICACRYPT 2011 | 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011, Proceedings

Abderrahmane Nitaj David Pointcheval(Herausgeber*in)

Springer (Verlag)

Erschienen am 29. Juni 2011

XIII, 387 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-21969-6 (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
Protocols
Secure Outsourced Computation
Introduction
Background
Secure Multi-Party Computation
Linear Secret Sharing Schemes
Trusted Hardware in SMPC
Our Protocol
Security Model and Proof
Isolated Security Modules
Active and Covert Adversaries
Implementation Aspects
Efficiency Comparison
Data Transfer from Client to Servers
LSSS over F2
References
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
Introduction
Preliminaries
Security Notions for Coin-Flipping
Mixed Commitments
Mixed Commitment Schemes
The Protocol COMMITpk
Amplification Theorems for Strong Coin-Flipping
From (force,uncont) to (force,random)
From (force,random) to (force,force)
Application: Zero-Knowledge Proof of Knowledge
Simulatable Witness Encodings of NP
The Protocol
Application: Two-Party Function Evaluation
Oblivious Transfer
The Protocol
References
Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
Introduction
Preliminaries
Notation
ElGamal Encryption
Zero-Knowledge
Secure Two-Party Computation
Warm Up: (Basic) Pattern Matching Protocol
Secure Fast Fourier Transform and Polynomial Multiplication
FFT and Polynomial Multiplication: A Brief Recall
Secure Fast Polynomial Multiplication
Fast Secure Generalized Pattern Matching
Pattern Matching with Mismatches
Pattern Matching with Wildcards
Conclusion
References
Identification Schemes from Key Encapsulation Mechanisms
Introduction
Our Contribution
Related Works
Organization of the Paper
Preliminaries
Identification Scheme
Key Encapsulation Mechanism
The Computational Diffie-Hellman Assumption and the Twin Diffie-Hellman Technique
Identification Scheme from Key Encapsulation Mechanism
Construction
Proof of Theorem 1
A One-Way-CCA Secure KEM Based on the CDH Assumption
Construction
Proof of Theorem 2
A Tuning for Efficiency and the Corresponding Identification Scheme
Efficiency Comparison
Conclusion
References
Cryptanalysis
Attacking Bivium and Trivium with theCharacteristic Set Method
Introduction
Trivium and Bivium
Guessing Strategy
The Characteristic Set Method
Attack Bivium-B by MFCS Algorithm
Attacking Trivium by MFCS
References
Improved Cryptanalysis of the Multi-Prime $\phi$-Hiding Assumption
Introduction
Preliminaries
Attacking the Multi-Prime -Hiding Assumption
Future Work and Open Problems
References
FPGA Implementation of a Statistical Saturation Attack against PRESENT
Introduction
Background
The Block Cipher PRESENT
Statistical Saturation Attacks
Hardware Architecture
Hardware Technology
PRESENT Architecture
Distribution Generator Architecture
Complete Design
Experimental Results
Conclusion and Open Problems
References
Collisions of MMO-MD5 and Their Impact on Original MD5
Introduction
Specifications and Notations
Description of MD5
MMO-MD5, Miyaguchi-Preneel-MD5, and Other PGV Modes
Related Work
Free-Start Collision Attack on MD5
Collision Attack on MD5
Collisions of MMO-MD5 and Miyaguchi-Preneel-MD5
Overall Strategy
Attack Procedure
Chaining Variable Modification
Experiment
Remarks
Collisions in Miyaguchi-Preneel and Other PGV Modes
Impact of Collisions in MMO Mode to DM Mode
Free-Start Given-Message Collisions
Given-Message Colliding Keys for NMAC
Conclusions and Future Work
References
Secret-Key Cryptography
Really Fast Syndrome-Based Hashing
Introduction
DesignofRFSB
Speed of RFSB-509
Attacks against RFSB
References
Montgomery's Trick and Fast Implementation of Masked AES
Introduction
Related Work
Our Results
Paper Organization
Notations and Basics on AES and SCA
Montgomery's Trick to Secure the AES Inv-Layer: Core Idea
Classical Approach
Approach with Montgomery's Trick
Secure Computation
Secure and Efficient Implementations of the Primitives
Field and Logical Multiplications Secure at Any Order
Dirac Computation Secure at Any Order
Security and Complexity Analysis of the Proposal
Experimentations
Conclusion
References
Efficient Implementations
Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation
Introduction
Preliminaries
Scalar Multiplication Methods
New x-Coordinate Only Formulæ
Differential Addition-And-Doubling
(X,Y,Z) Recovery
Optimizations for Dynamic ECC Parameters
In-Place vs. Out-of-Place Formulæ
Discussion
Security Analysis
Performance Analysis
Conclusion
References
Appendix
Efficient Multiplication in Finite Field Extensions of Degree 5
Introduction
Montgomery's Approach
Our Approach
Newton's Interpolation
Simplifying Operations in Newton's Interpolation
Results and Comparison
Technical Details and Implementation
Cost of Additions and Shifts in C Language
Division by Small Constants
Implementation Results
Results and Comparison for Quintic and Sextic Polynomials
Cryptographic Use
Conclusion
References
Cryptographic Schemes
Achieving Optimal Anonymity in TransferableE-Cash with a Judge
Introduction
Definitions for Transferable E-Cash with Judge
Algorithms
Global Variables and Oracles
Security Properties
Unforgeability
Identification of Double-Spenders
Exculpability
Anonymity Properties in Transferable E-Cash
Cryptographic Tools
Assumptions
Groth-Sahai Proofs
Commuting Signatures
A Tranferable E-Cash System with Judge
Overview of Our Solution
Key-Generation Algorithms
Withdrawal Protocol
Spending Protocol
Deposit and Identify Procedures
Security Considerations
References
Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model
Introduction
Preliminaries
Symmetric Bilinear Groups and Hardness Assumptions
Automorphic Signatures
NIWI Proofs for Pairing Product Equations
Revocable Attribute-Based Signatures: Protocols and Security
Syntactic Definition
Security Definitions
The New Scheme
The Intuition: A Linkable Scheme
Achieving Non-linkability
Admitting more General Signing Policies
Security in the Standard Model
Prime Order Bilinear Groups
References
Algorithmic Problems
Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design
Introduction
The (Inhomogeneous) Simultaneous Approximation Problem
Motivation
Definition
Hardness Assumption
A Bit Commitment Scheme Based on DISAP
Binding Property
Hiding Property
Proof
On the Underlying Assumption
A Concrete Instantiation and Implementation
Future Work and Conclusions
References
Analyzing Standards for RSA Integers
Introduction
RSA Integers in General
Toolbox
Some Common Definitions for RSA Integers
A Fixed Bound Notion
An Algorithmically Inspired Notion
Generating RSA Integers Properly
Rejection Sampling
Inverse Transform Sampling
Other Constructions
Summary
Output Entropy
Complexity Theoretic Considerations
Impact on Standards and Implementations
RSA-OAEP
IEEE
NIST
ANSI
OpenSSL
GnuPG
GNU Crypto
Conclusion
References
Elliptic Curves
Hashing into Hessian Curves
Introduction
Background on Hessian Curves
The Encoding Map
The Encoding Map from Fq to Hd(Fq)
Size of the Image Set Hd
Correspondence between the Sets Xd and Hd
Randomness of the Encoding Map hd
An Injective Encoding Map
Concluding Remarks
References
On Randomness Extraction in Elliptic Curves
Introduction
Preliminaries
Deterministic Extractor
Character Sums and Elliptic Curves
On Character Sums
Elliptic Curves
Randomness Extraction in E(Fqn )
Conclusion
References
Fault Analysis
Fault Analysis of Grain-128 by Targeting NFSR
Introduction
Specification of the Grain-128 Stream Cipher
Fault Analysis Model of Grain-128
Assumptions of the Fault Model
Proposed Fault Analysis of Grain-128
Determining the Fault Location in the NFSR
Pre-computation of Fault Traces
Determining the NFSR Bits
Determining the LFSR Bits
Inverting Internal States
Complexity, Limitations and Extensions
Conclusion
References
Appendix
Differential Fault Analysis of Sosemanuk
Introduction
Fault Analysis Attacks
The Sosemanuk Specification
The Attack Overview
The Main Idea
The Steps of the Attack
Reducing the Number of Candidates for LFSR Registers (s0, s1, s2, s3) and (s8, s9, s10, s11)
Recovering the S-Box Differences
Restricting the Number of Candidates for the LFSR Registers
Further Pruning of the LFSR Registers Candidates
Recovering the Rest of the Inner State
Summary and Conclusions
References
An Improved Differential Fault Analysis on AES-256
Introduction
Preliminaries
The AES Algorithm
Fault Model Used
Existing Fault Analysis
First Phase of the Attack
Second Phase of the Attack
Third Phase of the Attack
Analysis
Attack Time and Search Space Complexity Reduction Techniques
The First Observation
The Second Observation
Improved Attack on AES-256 Using Two Faulty Ciphertexts
First Phase of the Proposed Attack
Second Phase of the Proposed Attack
Experimental Results
Comparison
Conclusions
References
Security Proofs
Benaloh's Dense Probabilistic Encryption Revisited
Introduction
Original Description of Benaloh's Scheme
ASmallCounter-Example
Applications
Receipt-Free Elections
Private Multi-party Trust Computation
Secure Cards Dealing
Corrected Version of Benaloh's Scheme
Probability of Failure of Benaloh's Scheme
Related Schemes
Semantic Security of the Corrected Scheme
Conclusion
References
On the Security of the Winternitz One-Time Signature Scheme
Introduction
Existential Unforgeability of the Winternitz One-Time Signature Scheme
The Winternitz One-Time Signature Scheme
Security Notions for Signature Schemes and Function Families
Security Reduction
Security Level
Strong Unforgeability of the Winternitz One-Time Signature Scheme
Security Notions for Signature Schemes and Function Families II
Security Reductions
Security Level
Relation between Security Notions
Conclusion
References
Invited Talks
Efficient Zero-Knowledge Proofs
Some Key Techniques on Pairing Vector Spaces
References
The NIST SHA-3 Competition: A Perspective on the Final Year
Background
The SHA-3 Competition
Conclusions
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken