Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation

DOI10.1007/978-3-030-17653-2_7zbMath1470.94072OpenAlexW2946470030MaRDI QIDQ2292644

Publication date: 4 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17653-2_7

Related Items (32)

One-Way Functions and (Im)perfect Obfuscation ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Identity-based encryption in DDH hard groups ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Candidate witness encryption from lattice techniques ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Streaming functional encryption ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Tracing quantum state distinguishers via backtracking ⋮ Indistinguishability obfuscation ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Offline witness encryption with semi-adaptive security ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption ⋮ Optimal broadcast encryption from pairings and LWE ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Combiners for functional encryption, unconditionally ⋮ Classical vs quantum random oracles ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Amplifying the security of functional encryption, unconditionally

This page was built for publication: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation