Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
From MaRDI portal
Publication:2056782
Recommendations
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Breaking the sub-exponential barrier in obfustopia
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A dichotomy for local small-bias generators
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Algebraic attacks against random local functions and their countermeasures
- Candidate iO from homomorphic encryption schemes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate one-way functions based on expander graphs
- From cryptomania to obfustopia through secret-key functional encryption
- From selective to adaptive security in functional encryption
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully secure functional encryption for inner products, from standard assumptions
- Functional encryption for bounded collusions, revisited
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Hardness of SIS and LWE with small parameters
- How to Generate and Use Universal Samplers
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Multi-input functional encryption
- New Algorithms for Learning in Presence of Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete security of Goldreich's pseudorandom generator
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- On the security of Goldreich's one-way function
- One-Time Programs
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Predicate encryption for circuits from LWE
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Reusable garbled circuits and succinct functional encryption
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Revisiting the hardness of binary error LWE
- Secure Obfuscation in a Weak Multilinear Map Model
- Simple functional encryption schemes for inner products
- Sum of squares lower bounds for refuting any CSP
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Watermarking cryptographic capabilities
Cited in
(37)- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Candidate iO from homomorphic encryption schemes
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Counterexamples to new circular security assumptions underlying iO
- Indistinguishability obfuscation from compact functional encryption
- Fine-grained polynomial functional encryption
- Breaking the sub-exponential barrier in obfustopia
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Registered (inner-product) functional encryption
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Unbounded quadratic functional encryption and more from pairings
- Simpler constructions of asymmetric primitives from obfuscation
- Candidate witness encryption from lattice techniques
- Indistinguishability obfuscation
- On the algebraic immunity of direct sum constructions
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Candidate obfuscation via oblivious LWE sampling
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Time-lock puzzles with efficient batch solving
- Constructions for quantum indistinguishability obfuscation
- Multi-input attribute based encryption and predicate encryption
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Succinct LWE sampling, random polynomials, and obfuscation
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Obfuscation of pseudo-deterministic quantum circuits
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Witness encryption and null-iO from evasive LWE
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- A minor note on obtaining simpler iO constructions via depleted obfuscators
This page was built for publication: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056782)
