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
Paul Lou, Huijia Lin, Amit Sahai, Aayush Jain
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
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)
