Cryptanalysis of candidate obfuscators for affine determinant programs
From MaRDI portal
Publication:2170024
DOI10.1007/978-3-031-06944-4_22zbMath1496.94072OpenAlexW4285228989MaRDI QIDQ2170024
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_22
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- 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
- Candidate obfuscation via oblivious LWE sampling
- Counterexamples to new circular security assumptions underlying iO
- 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}\)
- New techniques for obfuscating conjunctions
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Succinct LWE sampling, random polynomials, and obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Cryptanalysis of GGH Map
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Cryptanalysis of the Multilinear Map over the Integers
- Indistinguishability Obfuscation from Compact Functional Encryption
- Indistinguishability Obfuscation from Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Cryptanalyses of Candidate Branching Program Obfuscators
- Watermarking cryptographic capabilities
- Protecting Obfuscation against Algebraic Attacks
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
This page was built for publication: Cryptanalysis of candidate obfuscators for affine determinant programs
