How to obfuscate programs directly
From MaRDI portal
Recommendations
Cited in
(49)- Cutting-edge cryptography through the lens of secret sharing
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- On the bit security of cryptographic primitives
- Homomorphic lower digits removal and improved FHE bootstrapping
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Proofs of Work from worst-case assumptions
- On virtual grey box obfuscation for general circuits
- Implementing indistinguishability obfuscation using GGH15
- How to build time-lock encryption
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Obfuscating circuits via composite-order graded encoding
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
- Multilinear maps from obfuscation
- Efficient and scalable universal circuits
- Constrained pseudorandom functions from functional encryption
- Cryptanalysis of the CLT13 multilinear map
- Indistinguishability obfuscation: from approximate to exact
- On the correlation intractability of obfuscated pseudorandom functions
- Multilinear maps from obfuscation
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- How to avoid obfuscation using witness PRFs
- Obfuscating conjunctions under entropic ring LWE
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Shorter circuit obfuscation in challenging security models
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Obfuscating conjunctions
- Efficient and Provable White-Box Primitives
- Black-box obfuscation for \(d\)-CNFs
- Practical order-revealing encryption with limited leakage
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Obfuscating conjunctions
- Lattice-based SNARGs and their application to more efficient obfuscation
- Cryptanalyses of Candidate Branching Program Obfuscators
- Protecting obfuscation against algebraic attacks
- Constraining pseudorandom functions privately
- Universal samplers with fast verification
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- On Removing Graded Encodings from Functional Encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
- Breaking the size barrier: universal circuits meet lookup tables
- The random oracle model: a twenty-year retrospective
This page was built for publication: How to obfuscate programs directly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948392)
