Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum iO
From MaRDI portal
Publication:6138084
DOI10.1007/978-3-031-30545-0_8zbMATH Open1530.94033OpenAlexW4365934954MaRDI QIDQ6138084FDOQ6138084
Authors: Aayush Jain, Huijia Lin, Paul Lou, Amit Sahai 
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_8
Recommendations
- Candidate obfuscation via oblivious LWE sampling
- Lower bounds on assumptions behind indistinguishability obfuscation
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
Cites Work
- Secure Arithmetic Computation with No Honest Majority
- Practical multilinear maps over the integers
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- How to use indistinguishability obfuscation
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Candidate Multilinear Maps from Ideal Lattices
- Multi-input functional encryption
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Title not available (Why is that?)
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Obfuscation of probabilistic circuits and applications
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Graph-induced multilinear maps from lattices
- From cryptomania to obfustopia through secret-key functional encryption
- Verifiable functional encryption
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation with non-trivial efficiency
- Cryptanalysis of the new CLT multilinear map over the integers
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Protecting obfuscation against algebraic attacks
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Hardness of SIS and LWE with small parameters
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- 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-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Sum-of-squares meets program obfuscation, revisited
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
- Title not available (Why is that?)
- Counterexamples to new circular security assumptions underlying iO
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Succinct LWE sampling, random polynomials, and obfuscation
Cited In (1)
This page was built for publication: Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138084)
