1 option
Advances in Cryptology - CRYPTO 2006 : 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings / edited by Cynthia Dwork.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 4117.
- Lecture Notes in Computer Science, 0302-9743 ; 4117
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Management information systems.
- Computer science.
- Computer networks.
- Operating systems (Computers).
- Computers and civilization.
- Computer science--Mathematics.
- Cryptology.
- Management of Computing and Information Systems.
- Computer Communication Networks.
- Operating Systems.
- Computers and Society.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Cryptology.
- Management of Computing and Information Systems.
- Computer Communication Networks.
- Operating Systems.
- Computers and Society.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XIV, 622 pages).
- Edition:
- First edition 2006.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
- System Details:
- text file PDF
- Contents:
- 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 and Secure 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-37433-6
- 9783540374336
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.