Abstract is missing.
- Rigorous Bounds on Cryptanalytic Time/Memory TradeoffsElad Barkan, Eli Biham, Adi Shamir. 1-21 [doi]
- On the Power of the Randomized IterateIftach Haitner, Danny Harnik, Omer Reingold. 22-40 [doi]
- Strengthening Digital Signatures Via Randomized HashingShai Halevi, Hugo Krawczyk. 41-59 [doi]
- Round-Optimal Composable Blind Signatures in the Common Reference String ModelMarc Fischlin. 60-77 [doi]
- On Signatures of KnowledgeMelissa Chase, Anna Lysyanskaya. 78-96 [doi]
- Non-interactive Zaps and New Techniques for NIZKJens Groth, Rafail Ostrovsky, Amit Sahai. 97-111 [doi]
- Rankin s Constant and Blockwise Lattice ReductionNicolas Gama, Nick Howgrave-Graham, Henrik Koy, Phong Q. Nguyen. 112-130 [doi]
- Lattice-Based CryptographyOded Regev. 131-141 [doi]
- A Method for Making Password-Based Key Exchange Resilient to Server CompromiseCraig Gentry, Philip D. MacKenzie, Zulfikar Ramzan. 142-159 [doi]
- Mitigating Dictionary Attacks on Password-Protected Local StorageRan Canetti, Shai Halevi, Michael Steiner. 160-179 [doi]
- Rationality and Adversarial Behavior in Multi-party ComputationAnna Lysyanskaya, Nikos Triandopoulos. 180-197 [doi]
- When Random Sampling Preserves PrivacyKamalika Chaudhuri, Nina Mishra. 198-213 [doi]
- Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key ModelsMoni Naor, Gil Segev, Adam Smith. 214-231 [doi]
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close SecretsYevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith. 232-250 [doi]
- On Forward-Secure StorageStefan Dziembowski. 251-270 [doi]
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure OneRafael Pass, Abhi Shelat, Vinod Vaikuntanathan. 271-289 [doi]
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)Xavier Boyen, Brent Waters. 290-307 [doi]
- Fast Algorithms for the Free Riders Problem in Broadcast EncryptionZulfikar Ramzan, David P. Woodruff. 308-325 [doi]
- The Number Field Sieve in the Medium Prime CaseAntoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren. 326-344 [doi]
- Inverting HFE Is QuasipolynomialLouis Granboulan, Antoine Joux, Jacques Stern. 345-356 [doi]
- Cryptanalysis of 2R:::-::: SchemesJean-Charles Faugère, Ludovic Perret. 357-372 [doi]
- Receipt-Free Universally-Verifiable Voting with Everlasting PrivacyTal Moran, Moni Naor. 373-392 [doi]
- Cryptographic Protocols for Electronic VotingDavid Wagner. 393 [doi]
- Asymptotically Optimal Two-Round Perfectly Secure Message TransmissionSaurabh Agarwal, Ronald Cramer, Robbert de Haan. 394-408 [doi]
- Random Selection with an Adversarial MajorityRonen Gradwohl, Salil P. Vadhan, David Zuckerman. 409-426 [doi]
- Oblivious Transfer and Linear FunctionsIvan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner. 427-444 [doi]
- On Expected Constant-Round Protocols for Byzantine AgreementJonathan Katz, Chiu-Yuen Koo. 445-462 [doi]
- Robust Multiparty Computation with Linear Communication ComplexityMartin Hirt, Jesper Buus Nielsen. 463-482 [doi]
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty ComputationYuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. 483-500 [doi]
- Scalable Secure Multiparty ComputationIvan Damgård, Yuval Ishai. 501-520 [doi]
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small FieldsHao Chen, Ronald Cramer. 521-536 [doi]
- Automated Security Proofs with Sequences of GamesBruno Blanchet, David Pointcheval. 537-554 [doi]
- On Robust Combiners for Private Information Retrieval and Other PrimitivesRemo Meier, Bartosz Przydatek. 555-569 [doi]
- On the Impossibility of Efficiently Combining Collision Resistant Hash FunctionsDan Boneh, Xavier Boyen. 570-583 [doi]
- On the Higher Order Nonlinearities of Algebraic Immune FunctionsClaude Carlet. 584-601 [doi]
- New Proofs forMihir Bellare. 602-619 [doi]