CRYPTO 2006

Santa Barbara, California, USA

Cynthia Dwork (Ed.): Advances in Cryptology - CRYPTO ’06: 26th Annual International Cryptology Conference, USA, August 20-24, 2006, Proceedings. Lecture Notes in Computer Science Volume 4117, Springer, 2006, ISBN-13 978-3-540-37432-9

Read the paper abstracts. More »

Table of Contents

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