1 option
Theory of Cryptography : First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings / edited by Moni Naor.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2951.
- Lecture Notes in Computer Science, 0302-9743 ; 2951
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Operating systems (Computers).
- Algorithms.
- Computers and civilization.
- Management information systems.
- Computer science.
- Cryptology.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Computers and Society.
- Management of Computing and Information Systems.
- Local Subjects:
- Cryptology.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Computers and Society.
- Management of Computing and Information Systems.
- Algorithms.
- Physical Description:
- 1 online resource (XII, 532 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Contents:
- Notions of Reducibility between Cryptographic Primitives
- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
- On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
- Universally Composable Commitments Using Random Oracles
- Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes
- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument
- On the Possibility of One-Message Weak Zero-Knowledge
- Soundness of Formal Encryption in the Presence of Active Adversaries
- Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
- Alternatives to Non-malleability: Definitions, Constructions, and Applications
- A Note on Constant-Round Zero-Knowledge Proofs for NP
- Lower Bounds for Concurrent Self Composition
- Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation
- A Quantitative Approach to Reductions in Secure Computation
- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
- Physically Observable Cryptography
- Efficient and Universally Composable Committed Oblivious Transfer and Applications
- A Universally Composable Mix-Net
- A General Composition Theorem for Secure Reactive Systems
- Unfair Noisy Channels and Oblivious Transfer
- Computational Collapse of Quantum State with Application to Oblivious Transfer
- Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
- Composition of Random Systems: When Two Weak Make One Strong
- Simpler Session-Key Generation from Short Random Passwords
- Constant-Round Oblivious Transfer in the Bounded Storage Model
- Hierarchical Threshold Secret Sharing
- On Compressing Encrypted Data without the Encryption Key
- On the Notion of Pseudo-Free Groups.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-24638-1
- 9783540246381
- 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.