Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
From MaRDI portal
Publication:1675746
DOI10.1007/978-3-319-63688-7_20zbMath1407.94138OpenAlexW2752847244MaRDI QIDQ1675746
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_20
Related Items (49)
One-Way Functions and (Im)perfect Obfuscation ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ FE and iO for Turing machines from minimal assumptions ⋮ An efficient structural attack on NIST submission DAGS ⋮ Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin ⋮ Multi-input quadratic functional encryption from pairings ⋮ 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 ⋮ Proofs of Work from worst-case assumptions ⋮ From FE combiners to secure MPC and back ⋮ Multilinear maps from obfuscation ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Multi-client functional encryption with fine-grained access control ⋮ 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 ⋮ A survey on functional encryption ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Streaming functional encryption ⋮ Indistinguishability obfuscation ⋮ Inner-product functional encryption with fine-grained access control ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ On the complexity of compressing obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Obfustopia built on secret-key functional encryption ⋮ Simple and efficient FE for quadratic functions ⋮ 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 ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Non-interactive anonymous router ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
