1 option
Advances in Cryptology - CRYPTO 2007 : 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings / edited by Alfred Menezes.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Security and cryptology ; SL 4, 4622.
- Security and Cryptology ; 4622
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Management information systems.
- Computer science.
- Computer networks.
- Computer security.
- Computers and civilization.
- Computer science--Mathematics.
- Cryptology.
- Management of Computing and Information Systems.
- Computer Communication Networks.
- Systems and Data Security.
- Computers and Society.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Cryptology.
- Management of Computing and Information Systems.
- Computer Communication Networks.
- Systems and Data Security.
- Computers and Society.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XIV, 634 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- Contents:
- Cryptanalysis I
- Practical Cryptanalysis of SFLASH
- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- Secure Searching
- How Should We Solve Search Problems Privately?
- Public Key Encryption That Allows PIR Queries
- Invited Talk
- Information Security Economics - and Beyond
- Theory I
- Cryptography with Constant Input Locality
- Universally-Composable Two-Party Computation in Two Rounds
- Indistinguishability Amplification
- Lattices
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Improved Analysis of Kannan's Shortest Lattice Vector Algorithm
- Random Oracles
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier
- Random Oracles and Auxiliary Input
- Hash Functions
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
- Hash Functions and the (Amplified) Boomerang Attack
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Theory II
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Cryptography in the Multi-string Model
- Quantum Cryptography
- Secure Identification and QKD in the Bounded-Quantum-Storage Model
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Cryptanalysis II
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- Encryption
- Invertible Universal Hashing and the TET Encryption Mode
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Pirate Evolution: How to Make the Most of Your Traitor Keys
- Protocol Analysis
- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- Chernoff-Type Direct Product Theorems
- Public-Key Encryption
- Rerandomizable RCCA Encryption
- Deterministic and Efficiently Searchable Encryption
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Multi-party Computation
- Scalable and Unconditionally Secure Multiparty Computation
- On Secure Multi-party Computation in Black-Box Groups
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-74143-5
- 9783540741435
- 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.