Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
From MaRDI portal
Publication:2170025
DOI10.1007/978-3-031-06944-4_23zbMath1496.94052OpenAlexW4285208320MaRDI QIDQ2170025
Amit Sahai, Aayush Jain, Huijia Lin
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_23
Related Items (17)
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Registered attribute-based encryption ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Sublinear secure computation from new assumptions ⋮ Witness encryption and null-iO from evasive LWE ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Computational wiretap coding from indistinguishability obfuscation ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Streaming functional encryption ⋮ Candidate iO from homomorphic encryption schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Combiners for functional encryption, unconditionally
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Amplifying the security of functional encryption, unconditionally
- From FE combiners to secure MPC and back
- 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
- Output-Compressing Randomized Encodings and Applications
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Arithmetic Cryptography
- Candidate One-Way Functions Based on Expander Graphs
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Fully Homomorphic Encryption over the Integers
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Indistinguishability Obfuscation from Functional Encryption
- Obfuscation of Probabilistic Circuits and Applications
- Obfuscating Circuits via Composite-Order Graded Encoding
- Reusable garbled circuits and succinct functional encryption
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
