The following pages link to (Q5750403):
Displaying 50 items.
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- On the XOR of Multiple Random Permutations (Q2794522) (← 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)
- Network Oblivious Transfer (Q2829221) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection (Q2975818) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
- A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys (Q3102797) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← 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)
- Composition Implies Adaptive Security in Minicrypt (Q3593104) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- On the Security Loss in Cryptographic Reductions (Q3627428) (← links)
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model (Q3627447) (← 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)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- On characterizations of escrow encryption schemes (Q4571999) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)
- Secure commitment against a powerful adversary (Q5096801) (← links)
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols (Q5502762) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)