Theory of Cryptography
From MaRDI portal
Publication:5901762
DOI10.1007/b95566zbMath1197.94202OpenAlexW2498336418MaRDI QIDQ5901762
Salil P. Vadhan, Luca Trevisan, Omer Reingold
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95566
Related Items (74)
Memory-Tight Reductions for Practical Key Encapsulation Mechanisms ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the round complexity of black-box secure MPC ⋮ Limits on the usefulness of random oracles ⋮ Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Tightness subtleties for multi-user PKE notions ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ On building fine-grained one-way functions from strong average-case hardness ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ A lower bound on the length of signatures based on group actions and generic isogenies ⋮ Multi-instance secure public-key encryption ⋮ Does Secure Time-Stamping Imply Collision-Free Hash Functions? ⋮ On the impossibility of key agreements from quantum random oracles ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? ⋮ On tight security proofs for Schnorr signatures ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Lifting standard model reductions to common setup assumptions ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Round-optimal black-box MPC in the plain model ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness ⋮ Circular security is complete for KDM security ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ The cost of adaptivity in security games on graphs ⋮ Unnamed Item ⋮ Possibility and impossibility results for selective decommitments ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Non-adaptive programmability of random oracle ⋮ Limits on the Computational Power of Random Strings ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Bounds on the efficiency of black-box commitment schemes ⋮ Composition Implies Adaptive Security in Minicrypt ⋮ Compression from Collisions, or Why CRHF Combiners Have a Long Output ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Semi-honest to Malicious Oblivious Transfer—The Black-Box Way ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Homomorphic Evaluation Requires Depth ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Efficiency Bounds for Adversary Constructions in Black-Box Reductions ⋮ On the Theoretical Gap between Group Signatures with and without Unlinkability ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ On the Necessary and Sufficient Assumptions for UC Computation ⋮ Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ On the memory-tightness of hashed ElGamal
This page was built for publication: Theory of Cryptography
