Front matter
1-13
A Memory Efficient Version of Satoh’s Algorithm
Frederik Vercauteren, Bart Preneel and Joos Vandewalle
14-29
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
Mireille Fouquet, Pierrick Gaudry and Robert Harley
30-39
How Secure Are Elliptic Curves over Composite Extension Fields?
Nigel P. Smart
40-59
Efficient and Non-interactive Non-malleable Commitment
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky and Adam Smith
60-77
How to Convert the Flavor of a Quantum Bit Commitment
Claude Crépeau, Frédéric Légaré and Louis Salvail
78-92
Cryptographic Counters and Applications to Electronic Voting
Jonathan Katz, Steven Myers and Rafail Ostrovsky
93-118
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Jan Camenisch and Anna Lysyanskaya
119-135
Priced Oblivious Transfer: How to Sell Digital Goods
Bill Aiello, Yuval Ishai and Omer Reingold
136-151
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Masayuki Abe
152-165
Practical Threshold RSA Signatures without a Trusted Dealer
Ivan Damgård and Maciej Koprowski
166-181
Hash Functions: From Merkle-Damgård to Shoup
Ilya Mironov
182-194
Key Recovery and Message Attacks on NTRU-Composite
Craig Gentry
195-210
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Eric R. Verheul
211-228
NSS: An NTRU Lattice-Based Signature Scheme
Jeffrey Hoffstein, Jill Pipher and Joseph H. Silverman
229-243
The Bit Security of Paillier’s Encryption Scheme and Its Applications
Dario Catalano, Rosario Gennaro and Nick Howgrave-Graham
244-261
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
Ahmad-Reza Sadeghi and Michael Steiner
262-279
On Adaptive vs. Non-adaptive Security of Multiparty Protocols
Ran Canetti, Ivan Damgaard, Stefan Dziembowski, Yuval Ishai and Tal Malkin
280-300
Multiparty Computation from Threshold Homomorphic Encryption
Ronald Cramer, Ivan Damgård and Jesper B. Nielsen
301-324
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Yevgeniy Dodis, Amit Sahai and Adam Smith
325-339
Cryptanalysis of Reduced-Round MISTY
Ulrich Kühn
340-357
The Rectangle Attack — Rectangling the Serpent
Eli Biham, Orr Dunkelman and Nathan Keller
358-372
Efficient Amplification of the Security of Weak Pseudo-random Function Generators
Steven Myers
373-393
Min-round Resettable Zero-Knowledge in the Public-Key Model
Silvio Micali and Leonid Reyzin
395-405
Structural Cryptanalysis of SASAS
Alex Biryukov and Adi Shamir
406-419
Hyper-bent Functions
Amr M. Youssef and Guang Gong
420-436
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Liam Keliher, Henk Meijer and Stafford Tavares
437-452
Lower Bounds for Multicast Message Authentication
Dan Boneh, Glenn Durfee and Matt Franklin
453-474
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Ran Canetti and Hugo Krawczyk
475-494
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Jonathan Katz, Rafail Ostrovsky and Moti Yung
495-511
Identification Protocols Secure against Reset Attacks
Mihir Bellare, Marc Fischlin, Shafi Goldwasser and Silvio Micali
512-528
Does Encryption with Redundancy Provide Authenticity?
Jee Hea An and Mihir Bellare
529-544
Encryption Modes with Almost Free Message Integrity
Charanjit S. Jutla
Back matter