Protecting obfuscation against algebraic attacks
From MaRDI portal
Recommendations
Cited in
(68)- Cutting-edge cryptography through the lens of secret sharing
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Return of GGH15: provable security against zeroizing attacks
- On virtual grey box obfuscation for general circuits
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- How to build time-lock encryption
- Efficient obfuscation for CNF circuits and applications in cloud computing
- White-box cryptography: don't forget about grey-box attacks
- Obfuscating circuits via composite-order graded encoding
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
- Constrained pseudorandom functions from functional encryption
- Secret-sharing for NP
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Lower bounds on assumptions behind indistinguishability obfuscation
- Indistinguishability obfuscation: from approximate to exact
- Functional Encryption for Turing Machines
- On the correlation intractability of obfuscated pseudorandom functions
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Cryptographic assumptions: a position paper
- How to avoid obfuscation using witness PRFs
- Cutting-edge cryptography through the lens of secret sharing
- Functional encryption without obfuscation
- Contention in cryptoland: obfuscation, leakage and UCE
- Shorter circuit obfuscation in challenging security models
- A unified approach to idealized model separations via indistinguishability obfuscation
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation combiners
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- How to obfuscate programs directly
- Delegating RAM computations with adaptive soundness and privacy
- Secure Obfuscation in a Weak Multilinear Map Model
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
- Compactness vs collusion resistance in functional encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability obfuscation from compact functional encryption
- Practical order-revealing encryption with limited leakage
- Obfuscating circuits via composite-order graded encoding
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Lattice-based SNARGs and their application to more efficient obfuscation
- Cryptanalyses of Candidate Branching Program Obfuscators
- Constraining pseudorandom functions privately
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- On Removing Graded Encodings from Functional Encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- One-Way Functions and (Im)perfect Obfuscation
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Structure-preserving compilers from new notions of obfuscations
- Candidate iO from homomorphic encryption schemes
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Indistinguishability obfuscation
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Towards general-purpose program obfuscation via local mixing
- Indistinguishability obfuscation from well-founded assumptions
- Obfuscating pseudorandom functions is post-quantum complete
This page was built for publication: Protecting obfuscation against algebraic attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418698)
