This book constitutes the refereed proceedings of the 29th Annual International Cryptology Conference, CRYPTO 2009, held in Santa Barbara, CA, USA in August 2009. The 38 revised full papers presented were carefully reviewed and selected from 213 submissions. Addressing all current foundational, theoretical and research aspects of cryptology, cryptography, and cryptanalysis as well as advanced applications, the papers are organized in topical sections on key leakage, hash-function cryptanalysis, privacy and anonymity, interactive proofs and zero-knowledge, block-cipher cryptanalysis, modes of operation, elliptic curves, cryptographic hardness, merkle puzzles, cryptography in the physical world, attacks on signature schemes, secret sharing and secure computation, cryptography and game-theory, cryptography and lattices, identity-based encryption and cryptographers’ toolbox.
Shai Halevi Bücher


Theory of cryptography
- 617 Seiten
- 22 Lesestunden
InhaltsverzeichnisZero-Knowledge.Concurrent Zero Knowledge Without Complexity Assumptions.Interactive Zero-Knowledge with Restricted Random Oracles.Non-interactive Zero-Knowledge from Homomorphic Encryption.Primitives.Ring Signatures: Stronger Definitions and Constructions Without Random Oracles.Efficient Blind and Partially Blind Signatures Without Random Oracles.Key Exchange Using Passwords and Long Keys.Mercurial Commitments: Minimal Assumptions and Efficient Constructions.Assumptions and Models.Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices.On Error Correction in the Exponent.On the Relation Between the Ideal Cipher and the Random Oracle Models.The Bounded-Retrieval Model.Intrusion-Resilience Via the Bounded-Storage Model.Perfectly Secure Password Protocols in the Bounded Retrieval Model.Privacy.Polylogarithmic Private Approximations and Efficient Matching.Calibrating Noise to Sensitivity in Private Data Analysis.Secret Sharing and Multi-party Computation (I).Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.Efficient Multi-party Computation with Dispute Control.Round-Optimal and Efficient Verifiable Secret Sharing.Universally-Composible Security.Generalized Environmental Security from Number Theoretic Assumptions.Games and the Impossibility of Realizable Ideal Functionality.Universally Composable Symbolic Analysis of Mutua