Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of eurocrypt 2009
Preface and frontmatter
Page
Title
1-35
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
36-53
Breaking RSA Generically Is Equivalent to Factoring
54-71
Resettably Secure Computation
72-87
On the Security Loss in Cryptographic Reductions
88-105
On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
106-120
Cryptanalysis of MDC-2
121-133
Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC
134-152
Finding Preimages in Full MD5 Faster Than Exhaustive Search
153-170
Asymmetric Group Key Agreement
171-188
Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
189-205
Traitors Collaborating in Public: Pirates 2.0
206-223
Key Agreement from Close Secrets over Unsecured Channels
224-241
Order-Preserving Symmetric Encryption
242-259
A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
260-277
On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
278-299
Cube Attacks on Tweakable Black Box Polynomials
300-312
Smashing SQUASH-0
313-332
Practical Chosen Ciphertext Secure Encryption from Factoring
333-350
Realizing Hash-and-Sign Signatures under Standard Assumptions
351-368
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
369-370
Cryptography without (Hardly Any) Secrets ?
371-388
Salvaging Merkle-Damgård for Practical Applications
389-406
On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model
407-424
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme
425-442
On the Portability of Generalized Schnorr Proofs
443-461
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
462-482
A Leakage-Resilient Mode of Operation
483-501
ECM on Graphics Cards
502-517
Double-Base Number System for Multi-scalar Multiplications
518-535
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
536-553
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
554-571
Verifiable Random Functions from Identity-Based Key Encapsulation
572-589
Optimal Randomness Extraction from a Diffie-Hellman Element
590-609
A New Randomness Extraction Paradigm for Hybrid Encryption