Efficient obfuscation for CNF circuits and applications in cloud computing
From MaRDI portal
Publication:2001194
Recommendations
Cites work
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Black-box obfuscation for \(d\)-CNFs
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- Cryptanalysis of the new CLT multilinear map over the integers
- Fully homomorphic encryption using ideal lattices
- Functional encryption: definitions and challenges
- Graph-induced multilinear maps from lattices
- Hosting services on an untrusted cloud
- How to obfuscate programs directly
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 1996402 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- New Multilinear Maps Over the Integers
- Obfuscating conjunctions
- On the (im)possibility of obfuscating programs
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Practical multilinear maps over the integers
- Protecting obfuscation against algebraic attacks
- Secure Obfuscation in a Weak Multilinear Map Model
- Symmetric-key based proofs of retrievability supporting public verification
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
This page was built for publication: Efficient obfuscation for CNF circuits and applications in cloud computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001194)