![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
2. AFRICACRYPT 2009: Gammarth, Tunisia
- Bart Preneel:
Progress in Cryptology - AFRICACRYPT 2009, Second International Conference on Cryptology in Africa, Gammarth, Tunisia, June 21-25, 2009. Proceedings. Lecture Notes in Computer Science 5580, Springer 2009, ISBN 978-3-642-02383-5
Hash Functions
- Gaoli Wang, Shaohui Wang:
Second Preimage Attack on 5-Pass HAVAL and Partial Key-Recovery Attack on HMAC/NMAC-5-Pass HAVAL. 1-13 - Jean-Philippe Aumasson, Orr Dunkelman
, Florian Mendel
, Christian Rechberger, Søren S. Thomsen:
Cryptanalysis of Vortex. 14-28 - Florian Mendel
:
Two Passes of Tiger Are Not One-Way. 29-40
Block Ciphers
- Joana Treger, Jacques Patarin:
Generic Attacks on Feistel Networks with Internal Permutations. 41-59 - Marine Minier, Raphael C.-W. Phan
, Benjamin Pousse:
Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks. 60-76
Asymmetric Encryption
- Thierry P. Berger, Pierre-Louis Cayrel, Philippe Gaborit, Ayoub Otmani
:
Reducing Key Length of the McEliece Cryptosystem. 77-97 - Abderrahmane Nitaj:
Cryptanalysis of RSA Using the Ratio of the Primes. 98-115
Digital Signatures
- Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes. 116-134 - David Galindo
, Flavio D. Garcia:
A Schnorr-Like Lightweight Identity-Based Signature Scheme. 135-148 - Go Ohtake, Arisa Fujii, Goichiro Hanaoka, Kazuto Ogawa:
On the Theoretical Gap between Group Signatures with and without Unlinkability. 149-166 - Ilker Nadi Bozkurt, Kamer Kaya, Ali Aydin Selçuk
:
Practical Threshold Signatures with Linear Secret Sharing Schemes. 167-178
Asymmetric Encryption and Anonymity
- Pooya Farshim, Bogdan Warinschi:
Certified Encryption Revisited. 179-197 - Siamak Fayyaz Shahandashti
, Reihaneh Safavi-Naini:
Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems. 198-216 - Laila El Aimani:
Anonymity from Public Key Encryption to Undeniable Signatures. 217-234
Key Agreement Protocols
- Manuel Barbosa
, Pooya Farshim:
Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps. 235-253 - Michel Abdalla
, Dario Catalano, Céline Chevalier, David Pointcheval
:
Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness. 254-271
Cryptographic Protocols
- Ueli M. Maurer:
Unifying Zero-Knowledge Proofs of Knowledge. 272-286 - Carmine Ventre
, Ivan Visconti:
Co-sound Zero-Knowledge with Public Keys. 287-304 - Julien Bringer, Hervé Chabanne:
Another Look at Extended Private Information Retrieval Protocols. 305-322 - Huafei Zhu, Feng Bao:
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions. 323-333
Efficient Implementations
- Marc Joye, Michael Tunstall
:
Exponent Recoding and Regular Exponentiation Algorithms. 334-349 - Owen Harrison, John Waldron:
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware. 350-367 - Neil Costigan, Peter Schwabe:
Fast Elliptic-Curve Cryptography on the Cell Broadband Engine. 368-385 - Billy Bob Brumley
, Kaisa Nyberg:
On Modular Decomposition of Integers. 386-402
Implementation Attacks
- Markus Kasper, Timo Kasper, Amir Moradi
, Christof Paar:
Breaking KeeLoq in a Flash: On Extracting Keys at Lightning Speed. 403-420 - Debdeep Mukhopadhyay:
An Improved Fault Based Attack of the Advanced Encryption Standard. 421-434
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.