Theory of Cryptography Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kilian, Joe (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3378
• Θέματα: Computer science.; Operating systems (Computers).; Data encryption (Computer science).; Algorithms.; Computer science > Mathematics.; Computers and civilization.; Management information systems.; Computer Science.; Data Encryption.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Operating Systems.; Management of Computing and Information Systems.; Computers and Society.

TCC 2005, the 2nd Annual Theory of Cryptography Conference, was held in Cambridge,Massachusetts,onFebruary10–12,2005.Theconferencereceived84 submissions,ofwhichtheprogramcommitteeselected32forpresentation.These proceedings contain the revised versions of the submissions that were presented at the co...

Πίνακας περιεχομένων:

• Hardness Amplification and Error Correction
• Optimal Error Correction Against Computationally Bounded Noise
• Hardness Amplification of Weakly Verifiable Puzzles
• On Hardness Amplification of One-Way Functions
• Graphs and Groups
• Cryptography in Subgroups of
• Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs
• Simulation and Secure Computation
• Comparing Two Notions of Simulatability
• Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
• Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
• Security of Encryption
• Adaptively-Secure, Non-interactive Public-Key Encryption
• Adaptive Security of Symbolic Encryption
• Chosen-Ciphertext Security of Multiple Encryption
• Steganography and Zero Knowledge
• Public-Key Steganography with Active Attacks
• Upper and Lower Bounds on Black-Box Steganography
• Fair-Zero Knowledge
• Secure Computation I
• How to Securely Outsource Cryptographic Computations
• Secure Computation of the Mean and Related Statistics
• Keyword Search and Oblivious Pseudorandom Functions
• Secure Computation II
• Evaluating 2-DNF Formulas on Ciphertexts
• Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
• Toward Privacy in Public Databases
• Quantum Cryptography and Universal Composability
• The Universal Composable Security of Quantum Key Distribution
• Universally Composable Privacy Amplification Against Quantum Adversaries
• A Universally Composable Secure Channel Based on the KEM-DEM Framework
• Cryptographic Primitives and Security
• Sufficient Conditions for Collision-Resistant Hashing
• The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
• On the Relationships Between Notions of Simulation-Based Security
• Encryption and Signatures
• A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes
• Further Simplifications in Proactive RSA Signatures
• Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem
• Information Theoretic Cryptography
• Entropic Security and the Encryption of High Entropy Messages
• Error Correction in the Bounded Storage Model
• Characterizing Ideal Weighted Threshold Secret Sharing.