Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
From MaRDI portal
Publication:2292644
Recommendations
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Indistinguishability obfuscation: from approximate to exact
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Lower bounds on assumptions behind indistinguishability obfuscation
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Secure Obfuscation in a Weak Multilinear Map Model
- Random-oracle uninstantiability from indistinguishability obfuscation
Cited in
(60)- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Obfuscation from low noise multilinear maps
- 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
- 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
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Offline witness encryption with semi-adaptive security
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Succinct LWE sampling, random polynomials, and obfuscation
- Lower bounds on assumptions behind indistinguishability obfuscation
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Secure Obfuscation in a Weak Multilinear Map Model
- One-Way Functions and (Im)perfect Obfuscation
- Obfustopia built on secret-key functional encryption
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Identity-based encryption in DDH hard groups
- Candidate iO from homomorphic encryption schemes
- 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
- Two-round concurrent 2PC from sub-exponential LWE
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Registered (inner-product) functional encryption
- Lower bounds for lattice-based compact functional encryption
- An algebraic algorithm for breaking NTRU with multiple keys
- Time-lock puzzles from lattices
- 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
- Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
- Perfect indistinguishability obfuscation for Boolean polynomial vector spaces via learning
- 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
- Pseudorandom FE, iO and applications
- Lower bounds on the overhead of indistinguishability obfuscation
- Indistinguishability obfuscation from ring key-homomorphic weak PRFs
This page was built for publication: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292644)
