The following pages link to Theory of Cryptography (Q5901762):
Displaying 50 items.
- Limits on the usefulness of random oracles (Q290382) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Non-adaptive programmability of random oracle (Q500974) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Reproducible circularly secure bit encryption: applications and realizations (Q1698399) (← links)
- A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- On the memory-tightness of hashed ElGamal (Q2119004) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Tightness subtleties for multi-user PKE notions (Q2149787) (← links)
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality (Q2152072) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q2692335) (← links)
- Circular security is complete for KDM security (Q2692344) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives (Q2790034) (← links)
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models (Q2796117) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Limits on the Computational Power of Random Strings (Q3012814) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
- On the Necessary and Sufficient Assumptions for UC Computation (Q3408190) (← links)
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs (Q3408193) (← links)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
- Does Secure Time-Stamping Imply Collision-Free Hash Functions? (Q3503876) (← links)
- Composition Implies Adaptive Security in Minicrypt (Q3593104) (← links)
- Compression from Collisions, or Why CRHF Combiners Have a Long Output (Q3600232) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Efficiency Bounds for Adversary Constructions in Black-Box Reductions (Q3634498) (← links)
- On the Theoretical Gap between Group Signatures with and without Unlinkability (Q3637138) (← links)
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms (Q5041159) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
