Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
From MaRDI portal
Publication:2056782
DOI10.1007/978-3-030-77883-5_4zbMath1479.94177OpenAlexW3037475319MaRDI QIDQ2056782
Romain Gay, Aayush Jain, Amit Sahai, Huijia Lin
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_4
Related Items (20)
Counterexamples to new circular security assumptions underlying iO ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ On the algebraic immunity of direct sum constructions ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Witness encryption and null-iO from evasive LWE ⋮ Candidate witness encryption from lattice techniques ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Indistinguishability obfuscation ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Candidate iO from homomorphic 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the security of Goldreich's one-way function
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Functional encryption for bounded collusions, revisited
- On the concrete security of Goldreich's pseudorandom generator
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Revisiting the hardness of binary error LWE
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- 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
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- (Leveled) fully homomorphic encryption without bootstrapping
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Hardness of SIS and LWE with Small Parameters
- Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- A Dichotomy for Local Small-Bias Generators
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simple Functional Encryption Schemes for Inner Products
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- How to Generate and Use Universal Samplers
- Functional Encryption: Definitions and Challenges
- New Algorithms for Learning in Presence of Errors
- Candidate One-Way Functions Based on Expander Graphs
- Secure Obfuscation in a Weak Multilinear Map Model
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Predicate Encryption for Circuits from LWE
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- One-Time Programs
- Indistinguishability Obfuscation from Functional Encryption
- Sum of squares lower bounds for refuting any CSP
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- How to use indistinguishability obfuscation
- Algebraic attacks against random local functions and their countermeasures
- Watermarking cryptographic capabilities
- Fuzzy Identity-Based Encryption
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Protecting Obfuscation against Algebraic Attacks
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
