Pages that link to "Item:Q2931431"
From MaRDI portal
The following pages link to On the randomness complexity of efficient sampling (Q2931431):
Displaying 12 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- On subset-resilient hash function families (Q2115743) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
- A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators (Q3098001) (← links)
- (Q5090388) (← links)
- (Q5092467) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Collision Resistance from Multi-collision Resistance (Q6489330) (← links)
