Obfustopia built on secret-key functional encryption
From MaRDI portal
Recommendations
- Obfustopia built on secret-key functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- Indistinguishability obfuscation from functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- When does functional encryption imply obfuscation?
Cites work
- A proof of security of Yao's protocol for two-party computation
- A punctured programming approach to adaptively secure functional encryption
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Compactness vs collusion resistance in functional encryption
- Computationally private randomizing polynomials and their applications
- Constrained pseudorandom functions and their applications
- Counterexamples to new circular security assumptions underlying iO
- Cryptanalyses of Candidate Branching Program Obfuscators
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- From selective to adaptive security in functional encryption
- Function-private functional encryption in the private-key setting
- Functional encryption for bounded collusions, revisited
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional signatures and pseudorandom functions
- Fuzzy Identity-Based Encryption
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- Hosting services on an untrusted cloud
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How to Generate and Use Universal Samplers
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How to obfuscate programs directly
- How to use indistinguishability obfuscation: deniable encryption, and more
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Limits on the power of indistinguishability obfuscation and functional encryption
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Multi-input functional encryption
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Obfuscating circuits via composite-order graded encoding
- Obfuscation of probabilistic circuits and applications
- Obfustopia built on secret-key functional encryption
- On black-box constructions of predicate encryption from trapdoor permutations
- On the (im)possibility of obfuscating programs
- Optimal bounded-collusion secure functional encryption
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Preventing CLT attacks on obfuscation with linear overhead
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Return of GGH15: provable security against zeroizing attacks
- Reusable garbled circuits and succinct functional encryption
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Secure Obfuscation in a Weak Multilinear Map Model
- Simple and generic constructions of succinct functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Stronger security for reusable garbled circuits, general definitions and attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Universal circuits (Preliminary Report)
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Watermarking cryptographic capabilities
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(2)
This page was built for publication: Obfustopia built on secret-key functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925547)
