Pages that link to "Item:Q2986863"
From MaRDI portal
The following pages link to Barriers in cryptography with weak, correlated and leaky sources (Q2986863):
Displaying 16 items.
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Deterministic public-key encryption for adaptively-chosen plaintext distributions (Q1994638) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- Incompressible encodings (Q2096497) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Incompressible cryptography (Q2170026) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- Approximate-Deterministic Public Key Encryption from Hard Learning Problems (Q3179474) (← links)
- Security Against Related Randomness Attacks via Reconstructive Extractors (Q3460096) (← links)
- Constructing tree decompositions of graphs with bounded gonality (Q5918255) (← links)
