Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
From MaRDI portal
Publication:1675747
DOI10.1007/978-3-319-63688-7_21zbMath1407.94139OpenAlexW2613226212MaRDI QIDQ1675747
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_21
Related Items (38)
One-Way Functions and (Im)perfect Obfuscation ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ An efficient structural attack on NIST submission DAGS ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ On the bit security of cryptographic primitives ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ From FE combiners to secure MPC and back ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ Multilinear maps from obfuscation ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Collusion-resistant functional encryption for RAMs ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Candidate witness encryption from lattice techniques ⋮ A survey on functional encryption ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Streaming functional encryption ⋮ Indistinguishability obfuscation ⋮ Unnamed Item ⋮ Candidate iO from homomorphic encryption schemes ⋮ Simple and generic constructions of succinct functional encryption ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Combiners for functional encryption, unconditionally ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
