Obfustopia built on secret-key functional encryption
From MaRDI portal
Publication:5925547
DOI10.1007/s00145-022-09429-zOpenAlexW3202306293WikidataQ114850015 ScholiaQ114850015MaRDI QIDQ5925547
Ryo Nishimaki, Keisuke Tanaka, Fuyuki Kitagawa
Publication date: 8 June 2022
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-022-09429-z
succinctnesscollusion-resistanceindistinguishability obfuscationpuncturable secret-key functional encryptionsecret-key functional encryption
Cites Work
- Unnamed Item
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Return of GGH15: provable security against zeroizing attacks
- Stronger security for reusable garbled circuits, general definitions and attacks
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Functional encryption for bounded collusions, revisited
- Preventing CLT attacks on obfuscation with linear overhead
- Function-private functional encryption in the private-key setting
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Obfuscating circuits via composite-order graded encoding
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Counterexamples to new circular security assumptions underlying iO
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Optimal bounded-collusion secure functional encryption
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Computationally private randomizing polynomials and their applications
- Perfect Structure on the Edge of Chaos
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Constrained Pseudorandom Functions and Their Applications
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Hosting Services on an Untrusted Cloud
- How to Obfuscate Programs Directly
- How to Generate and Use Universal Samplers
- Functional Encryption: Definitions and Challenges
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Secure Obfuscation in a Weak Multilinear Map Model
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Universal circuits (Preliminary Report)
- Watermarking Cryptographic Capabilities
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability Obfuscation from Functional Encryption
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Obfuscation of Probabilistic Circuits and Applications
- Graph-Induced Multilinear Maps from Lattices
- Breaking the Sub-Exponential Barrier in Obfustopia
- Cryptanalyses of Candidate Branching Program Obfuscators
- Fuzzy Identity-Based Encryption
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Protecting Obfuscation against Algebraic Attacks
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Obfustopia built on secret-key functional encryption
- Simple and generic constructions of succinct functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
This page was built for publication: Obfustopia built on secret-key functional encryption
