Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
From MaRDI portal
Publication:1690190
DOI10.1007/978-3-319-70500-2_5zbMath1410.94094OpenAlexW2766337303MaRDI QIDQ1690190
Vinod Vaikuntanathan, Alex Lombardi
Publication date: 19 January 2018
Full work available at URL: https://hdl.handle.net/1721.1/137870.2
Related Items (14)
One-Way Functions and (Im)perfect Obfuscation ⋮ An efficient structural attack on NIST submission DAGS ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Proofs of Work from worst-case assumptions ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Oblivious transfer with constant computational overhead ⋮ Indistinguishability obfuscation ⋮ Unnamed Item ⋮ On the complexity of compressing obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Candidate iO from homomorphic encryption schemes
This page was built for publication: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
