Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification

DOI10.1007/978-3-030-26954-8_10zbMath1436.94030OpenAlexW2967113598MaRDI QIDQ2304923

Amit Sahai, Christian Matt, Aayush Jain, Huijia Lin, Prabhanjan V. Ananth

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (35)

One-Way Functions and (Im)perfect Obfuscation ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Multi-input quadratic functional encryption from pairings ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Identity-based encryption in DDH hard groups ⋮ Functional encryption with secure key leasing ⋮ 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 ⋮ Indistinguishability obfuscation ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Combiners for functional encryption, unconditionally ⋮ 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 ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs

This page was built for publication: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification