How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)

DOI10.1007/978-3-030-17653-2_9zbMath1470.94090OpenAlexW2945147690MaRDI QIDQ2292646

Amit Sahai, Christian Matt, Aayush Jain, Huijia Lin

Publication date: 4 February 2020

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (34)

Counterexamples to new circular security assumptions underlying iO ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Identity-based encryption in DDH hard groups ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ 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 ⋮ Inner-product functional encryption with fine-grained access control ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ NIKE from affine determinant programs ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ 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 ⋮ 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 ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ 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: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)