Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
From MaRDI portal
Publication:2055603
DOI10.1007/978-3-030-45721-1_5zbMath1479.94103OpenAlexW3013890204MaRDI QIDQ2055603
Shweta Agrawal, Alice Pellet-Mary
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_5
Related Items (18)
Counterexamples to new circular security assumptions underlying iO ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Tracing quantum state distinguishers via backtracking ⋮ Indistinguishability obfuscation ⋮ Secure software leasing from standard assumptions ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ 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
Cites Work
- Unnamed Item
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Cryptanalyses of branching program obfuscations over GGH13 multilinear map from the NTRU problem
- Determinants and ranks of random matrices over \({\mathbb{Z}}_ m\)
- Some complexity results for polynomial ideals
- On the statistical leak of the GGH13 multilinear map and some variants
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- 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}\)
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Output-Compressing Randomized Encodings and Applications
- Perfect Structure on the Edge of Chaos
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of GGH Map
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Simple Functional Encryption Schemes for Inner Products
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- Secure Obfuscation in a Weak Multilinear Map Model
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- Efficient Public Key Encryption Based on Ideal Lattices
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- Obfuscation of Probabilistic Circuits and Applications
- Obfuscating Circuits via Composite-Order Graded Encoding
- Cryptanalyses of Candidate Branching Program Obfuscators
- Generating Shorter Bases for Hard Random Lattices
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- One-Way Functions and (Im)perfect Obfuscation
This page was built for publication: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
