Pages that link to "Item:Q1648854"
From MaRDI portal
The following pages link to Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation) (Q1648854):
Displaying 15 items.
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\) (Q626620) (← links)
- Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds (Q1405738) (← links)
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation (Q1690190) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions (Q2170046) (← links)
- Matrix PRFs: constructions, attacks, and applications to obfuscation (Q2175904) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Generating random bits from an arbitrary source: fundamental limits (Q4859757) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- (Q6062142) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
