| 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 Z 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 lelated btatlstlcs Keyword Search and Oblivious Pseudorandom Functions Secure Computation II Evaluating 2-DNF Formulas on Ciphertexts Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computing Toward Privacy in Public Databases Quantum Cryptography and Universal Composability Cryptographic Primitives and Security Enccryption and Signatures Information Theoretic Cryptography Author Endex |
内容加载中，请稍后...
商品评论（0条）