| Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs / Elad Barkan ; Eli Biham ; Adi Shamir |
| On the Power of the Randomized Iterate / Iftach Haitner ; Danny Harnik ; Omer Reingold |
| Strengthening Digital Signatures Via Randomized Hashing / Shai Halevi ; Hugo Krawczyk |
| Round-Optimal Composable Blind Signatures in the Common Reference String Model / Marc Fischlin |
| On Signatures of Knowledge / Melissa Chase ; Anna Lysyanskaya |
| Non-interactive Zaps and New Techniques for NIZK / Jens Groth ; Rafail Ostrovsky ; Amit Sahai |
| Rankin's Constant and Blockwise Lattice Reduction / Nicolas Gama ; Nick Howgrave-Graham ; Henrik Koy ; Phong Q. Nguyen |
| Lattice-Based Cryptography / Oded Regev |
| A Method for Making Password-Based Key Exchange Resilient to Server Compromise / Craig Gentry ; Philip MacKenzie ; Zulfikar Ramzan |
| Mitigating Dictionary Attacks on Password-Protected Local Storage / Ran Canetti ; Michael Steiner |
| Rationality and Adversarial Behavior in Multi-party Computation / Nikos Triandopoulos |
| When Random Sampling Preserves Privacy / Kamalika Chaudhuri ; Nina Mishra |
| Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models / Moni Naor ; Gil Segev ; Adam Smith |
| Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets / Yevgeniy Dodis ; Jonathan Katz ; Leonid Reyzin |
| On Forward-Secure Storage / Stefan Dziembowski |
| Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One / Rafael Pass ; Abhi Shelat ; Vinod Vaikuntanathan |
| Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) / Xavier Boyen ; Brent Waters |
| Fast Algorithms for the Free Riders Problem in Broadcast Encryption / David P. Woodruff |
| The Number Field Sieve in the Medium Prime Case / Antoine Joux ; Reynald Lercier ; Nigel Smart ; Frederik Vercauteren |
| Inverting HFE Is Quasipolynomial / Louis Granboulan ; Jacques Stern |
| Cryptanalysis of 2R[superscript -] Schemes / Jean-Charles Faugere ; Ludovic Perret |
| Receipt-Free Universally-Verifiable Voting with Everlasting Privacy / Tal Moran |
| Cryptographic Protocols for Electronic Voting / David Wagner |
| Asymptotically Optimal Two-Round Perfectly Secure Message Transmission / Saurabh Agarwal ; Ronald Cramer ; Robbert de Haan |
| Random Selection with an Adversarial Majority / Ronen Gradwohl ; Salil Vadhan ; David Zuckerman |
| Oblivious Transfer and Linear Functions / Ivan B. Damgard ; Serge Fehr ; Louis Salvail ; Christian Schaffner |
| On Expected Constant-Round Protocols for Byzantine Agreement / Chiu-Yuen Koo |
| Robust Multiparty Computation with Linear Communication Complexity / Martin Hirt ; Jesper Buus Nielsen |
| On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation / Yuval Ishai ; Eyal Kushilevitz ; Yehuda Lindell ; Erez Petrank |
| Scalable Secure Multiparty Computation / Ivan Damgard |
| Computations over Small Fields / Hao Chen |
| Automated Security Proofs with Sequences of Games / Bruno Blanchet ; David Pointcheval |
| On Robust Combiners for Private Information Retrieval and Other Primitives / Remo Meier ; Bartosz Przydatek |
| On the Impossibility of Efficiently Combining Collision Resistant Hash Functions / Dan Boneh |
| On the Higher Order Nonlinearities of Algebraic Immune Functions / Claude Carlet |
| New Proofs for NMAC and HMAC: Security without Collision-Resistance / Mihir Bellare |
| Author Index |
| Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs / Elad Barkan ; Eli Biham ; Adi Shamir |
| On the Power of the Randomized Iterate / Iftach Haitner ; Danny Harnik ; Omer Reingold |
| Strengthening Digital Signatures Via Randomized Hashing / Shai Halevi ; Hugo Krawczyk |
ＥＢ
