Advances in Cryptology - CRYPTO 2006

26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings

Buch | Softcover

XIV, 622 Seiten

2006 | 2006
Springer Berlin (Verlag)
978-3-540-37432-9 (ISBN)

Artikel merken

lt;p>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.

Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs.- On the Power of the Randomized Iterate.- Strengthening Digital Signatures Via Randomized Hashing.- Round-Optimal Composable Blind Signatures in the Common Reference String Model.- On Signatures of Knowledge.- Non-interactive Zaps and New Techniques for NIZK.- Rankin's Constant and Blockwise Lattice Reduction.- Lattice-Based Cryptography.- A Method for Making Password-Based Key Exchange Resilient to Server Compromise.- Mitigating Dictionary Attacks on Password-Protected Local Storage.- Rationality and Adversarial Behavior in Multi-party Computation.- When Random Sampling Preserves Privacy.- Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.- On Forward-Secure Storage.- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles).- Fast Algorithms for the Free Riders Problem in Broadcast Encryption.- The Number Field Sieve in the Medium Prime Case.- Inverting HFE Is Quasipolynomial.- Cryptanalysis of 2R? Schemes.- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy.- Cryptographic Protocols for Electronic Voting.- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission.- Random Selection with an Adversarial Majority.- Oblivious Transfer and Linear Functions.- On Expected Constant-Round Protocols for Byzantine Agreement.- Robust Multiparty Computation with Linear Communication Complexity.- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.- Scalable Secure Multiparty Computation.- Algebraic Geometric Secret Sharing Schemes andSecure Multi-Party Computations over Small Fields.- Automated Security Proofs with Sequences of Games.- On Robust Combiners for Private Information Retrieval and Other Primitives.- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions.- On the Higher Order Nonlinearities of Algebraic Immune Functions.- New Proofs for NMAC and HMAC: Security Without Collision-Resistance.

Erscheint lt. Verlag	8.8.2006
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XIV, 622 p.
Verlagsort	Berlin
Sprache	englisch
Maße	152 x 229 mm
Gewicht	1070 g
Themenwelt	Informatik ► Theorie / Studium ► Kryptologie
Schlagworte	Algebraic Geometry • algorithms • authentication • broadcast encryption • collision resistance • Complexity • Cryptanalysis • cryptographic protocols • cryptography • Cryptology • Cryptosystems • data encryption • Digital Signatures • group computation • Identity • Information • multipart computation • Oracle • privacy • Public Key Cryptography • security
ISBN-10	3-540-37432-9 / 3540374329
ISBN-13	978-3-540-37432-9 / 9783540374329
Zustand	Neuware