How to leverage hardness of constant-degree expanding polynomials over R to build iO
From MaRDI portal
Publication:2292646
Recommendations
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Breaking the sub-exponential barrier in obfustopia
- Indistinguishability obfuscation from compact functional encryption
- When does functional encryption imply obfuscation?
Cited in
(47)- 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
- 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\)
- 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
- Obfustopia built on secret-key functional encryption
- 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
- Candidate iO from homomorphic encryption schemes
- 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
- Two-round concurrent 2PC from sub-exponential LWE
- Registered (inner-product) functional encryption
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Public-key watermarkable PRFs with dynamic bounded collusion
- Indistinguishability obfuscation from well-founded assumptions
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- Obfuscating pseudorandom functions is post-quantum complete
- Lower bounds on the overhead of indistinguishability obfuscation
- Unbounded quadratic functional encryption and more from pairings
- Indistinguishability obfuscation from ring key-homomorphic weak PRFs
This page was built for publication: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292646)
