Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
From MaRDI portal
Recommendations
- On virtual grey box obfuscation for general circuits
- On virtual grey box obfuscation for general circuits
- Obfuscating circuits via composite-order graded encoding
- Obfuscating circuits via composite-order graded encoding
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Graded encoding schemes from obfuscation
- Obfuscation of probabilistic circuits and applications
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
Cited in
(71)- Cutting-edge cryptography through the lens of secret sharing
- Impossibility of order-revealing encryption in idealized models
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Proofs of Work from worst-case assumptions
- 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
- 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
- On constructing one-way permutations from indistinguishability obfuscation
- 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
- 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
- On constructing one-way permutations from indistinguishability obfuscation
- Contention in cryptoland: obfuscation, leakage and UCE
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Shorter circuit obfuscation in challenging security models
- A unified approach to idealized model separations via indistinguishability obfuscation
- Obfuscation combiners
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- On virtual grey box obfuscation for general circuits
- Black-box obfuscation for \(d\)-CNFs
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- Delegating RAM computations with adaptive soundness and privacy
- Secure Obfuscation in a Weak Multilinear Map Model
- Compactness vs collusion resistance in functional encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Obfuscating conjunctions
- 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
- Protecting obfuscation against algebraic attacks
- 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
- How to obfuscate MPC inputs
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Indistinguishability obfuscation
- Signature for objects: formalizing how to authenticate physical data and more
- Two-round concurrent 2PC from sub-exponential LWE
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Indistinguishability obfuscation from well-founded assumptions
- Obfuscating pseudorandom functions is post-quantum complete
- Obfuscating finite automata
This page was built for publication: Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746330)
