Advances in Cryptology – CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings

Elad Barkan, Eli Biham, Adi Shamir (auth.), Cynthia Dwork (eds.)3540374329, 9783540374329

This book constitutes the refereed proceedings of the 26th Annual International Cryptology Conference, CRYPTO 2006, held in Santa Barbara, California, USA in August 2006.

The 34 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 250 submissions. The papers address all current foundational, theoretical and research aspects of cryptology, cryptography, and cryptanalysis as well as advanced applications.

---

Table of contents :
Front Matter….Pages –
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs….Pages 1-21
On the Power of the Randomized Iterate….Pages 22-40
Strengthening Digital Signatures Via Randomized Hashing….Pages 41-59
Round-Optimal Composable Blind Signatures in the Common Reference String Model….Pages 60-77
On Signatures of Knowledge….Pages 78-96
Non-interactive Zaps and New Techniques for NIZK….Pages 97-111
Rankin’s Constant and Blockwise Lattice Reduction….Pages 112-130
Lattice-Based Cryptography….Pages 131-141
A Method for Making Password-Based Key Exchange Resilient to Server Compromise….Pages 142-159
Mitigating Dictionary Attacks on Password-Protected Local Storage….Pages 160-179
Rationality and Adversarial Behavior in Multi-party Computation….Pages 180-197
When Random Sampling Preserves Privacy….Pages 198-213
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models….Pages 214-231
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets….Pages 232-250
On Forward-Secure Storage….Pages 251-270
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One….Pages 271-289
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)….Pages 290-307
Fast Algorithms for the Free Riders Problem in Broadcast Encryption….Pages 308-325
The Number Field Sieve in the Medium Prime Case….Pages 326-344
Inverting HFE Is Quasipolynomial….Pages 345-356
Cryptanalysis of 2R − Schemes….Pages 357-372
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy….Pages 373-392
Cryptographic Protocols for Electronic Voting….Pages 393-393
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission….Pages 394-408
Random Selection with an Adversarial Majority….Pages 409-426
Oblivious Transfer and Linear Functions….Pages 427-444
On Expected Constant-Round Protocols for Byzantine Agreement….Pages 445-462
Robust Multiparty Computation with Linear Communication Complexity….Pages 463-482
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation….Pages 483-500
Scalable Secure Multiparty Computation….Pages 501-520
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields….Pages 521-536
Automated Security Proofs with Sequences of Games….Pages 537-554
On Robust Combiners for Private Information Retrieval and Other Primitives….Pages 555-569
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions….Pages 570-583
On the Higher Order Nonlinearities of Algebraic Immune Functions….Pages 584-601
New Proofs for NMAC and HMAC : Security Without Collision-Resistance….Pages 602-619
Back Matter….Pages –