Advances in Cryptology - Crypto 2006

by Dwork, Cynthia

• ISBN13: 9783540374329
• ISBN10: 3540374329
• Format: Paperback
• Copyright: 2006-09-15
• Publisher: Springer-Verlag New York Inc

Summary

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

Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs	p. 1
On the Power of the Randomized Iterate	p. 22
Strengthening Digital Signatures Via Randomized Hashing	p. 41
Round-Optimal Composable Blind Signatures in the Common Reference String Model	p. 60
On Signatures of Knowledge	p. 78
Non-interactive Zaps and New Techniques for NIZK	p. 97
Rankin's Constant and Blockwise Lattice Reduction	p. 112
Lattice-Based Cryptography	p. 131
A Method for Making Password-Based Key Exchange Resilient to Server Compromise	p. 142
Mitigating Dictionary Attacks on Password-Protected Local Storage	p. 160
Rationality and Adversarial Behavior in Multi-party Computation	p. 180
When Random Sampling Preserves Privacy	p. 198
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models	p. 214
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets	p. 232
On Forward-Secure Storage	p. 251
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One	p. 271
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)	p. 290
Fast Algorithms for the Free Riders Problem in Broadcast Encryption	p. 308
The Number Field Sieve in the Medium Prime Case	p. 326
Inverting HFE Is Quasipolynomial	p. 345
Cryptanalysis of 2R[superscript -] Schemes	p. 357
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy	p. 373
Cryptographic Protocols for Electronic Voting	p. 393
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission	p. 394
Random Selection with an Adversarial Majority	p. 409
Oblivious Transfer and Linear Functions	p. 427
On Expected Constant-Round Protocols for Byzantine Agreement	p. 445
Robust Multiparty Computation with Linear Communication Complexity	p. 463
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation	p. 483
Scalable Secure Multiparty Computation	p. 501 Algebrai
Computations over Small Fields	p. 521
Automated Security Proofs with Sequences of Games	p. 537
On Robust Combiners for Private Information Retrieval and Other Primitives	p. 555
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions	p. 570
On the Higher Order Nonlinearities of Algebraic Immune Functions	p. 584
New Proofs for NMAC and HMAC: Security without Collision-Resistance	p. 602
Author Index	p. 621
Table of Contents provided by Ingram. All Rights Reserved.