3. AFRICACRYPT 2011: Dakar, Senegal

Abderrahmane Nitaj, David Pointcheval (Eds.): Progress in Cryptology - AFRICACRYPT 2011 - 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. Lecture Notes in Computer Science 6737 Springer 2011, ISBN 978-3-642-21968-9

Protocols

Jake Loftus, Nigel P. Smart:
Secure Outsourced Computation. 1-20
Carolin Lunemann, Jesper Buus Nielsen:
Fully Simulatable Quantum-Secure Coin-Flipping and Applications. 21-40
Damien Vergnaud:
Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform. 41-58
Hiroaki Anada, Seiko Arita:
Identification Schemes from Key Encapsulation Mechanisms. 59-76

Cryptanalysis

ZhenYu Huang, Dongdai Lin:
Attacking Bivium and Trivium with the Characteristic Set Method. 77-91
Mathias Herrmann:
Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption. 92-99
Stéphanie Kerckhof, Baudoin Collard, François-Xavier Standaert:
FPGA Implementation of a Statistical Saturation Attack against PRESENT. 100-116
Yu Sasaki:
Collisions of MMO-MD5 and Their Impact on Original MD5. 117-133

Secret-Key Cryptography

Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Really Fast Syndrome-Based Hashing. 134-152
Laurie Genelle, Emmanuel Prouff, Michaël Quisquater:
Montgomery's Trick and Fast Implementation of Masked AES. 153-169

Efficient Implementations

Michael Hutter, Marc Joye, Yannick Sierra:
Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation. 170-187
Nadia El Mrabet, Aurore Guillevic, Sorina Ionica:
Efficient Multiplication in Finite Field Extensions of Degree 5. 188-205

Cryptographic Schemes

Olivier Blazy, Sébastien Canard, Georg Fuchsbauer, Aline Gouget, Hervé Sibert, Jacques Traoré:
Achieving Optimal Anonymity in Transferable E-Cash with a Judge. 206-223
Alex Escala, Javier Herranz, Paz Morillo:
Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model. 224-241

Algorithmic Problems

Frederik Armknecht, Carsten Elsner, Martin Schmidt:
Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design. 242-259
Daniel Loebenberger, Michael Nüsken:
Analyzing Standards for RSA Integers. 260-277

Elliptic Curves

Reza Rezaeian Farashahi:
Hashing into Hessian Curves. 278-289
Abdoul Aziz Ciss, Djiby Sow:
On Randomness Extraction in Elliptic Curves. 290-297

Fault Analysis

Sandip Karmakar, Dipanwita Roy Chowdhury:
Fault Analysis of Grain-128 by Targeting NFSR. 298-315
Yaser Esmaeili Salehani, Aleksandar Kircanski, Amr M. Youssef:
Differential Fault Analysis of Sosemanuk. 316-331
Subidh Ali, Debdeep Mukhopadhyay:
An Improved Differential Fault Analysis on AES-256. 332-347

Security Proofs

Laurent Fousse, Pascal Lafourcade, Mohamed Alnuaimi:
Benaloh's Dense Probabilistic Encryption Revisited. 348-362
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andreas Hülsing, Markus Rückert:
On the Security of the Winternitz One-Time Signature Scheme. 363-378

Invited Talks

Jens Groth:
Efficient Zero-Knowledge Proofs. 379
Tatsuaki Okamoto, Katsuyuki Takashima:
Some Key Techniques on Pairing Vector Spaces. 380-382
Bart Preneel:
The NIST SHA-3 Competition: A Perspective on the Final Year. 383-386

Last update Tue May 22 03:55:48 2012 CET by the DBLP Team —

This material is Open Data

Data released under the ODC-BY 1.0 license — See also our legal information page