Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
From MaRDI portal
Publication:5918360
DOI10.1007/S00145-021-09400-4zbMath1470.94095OpenAlexW3183043281MaRDI QIDQ5918360
Publication date: 10 August 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09400-4
Cites Work
- Unnamed Item
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- On the complexity of the parity argument and other inefficient proofs of existence
- Order-Revealing Encryption and the Hardness of Private Learning
- Perfect Structure on the Edge of Chaos
- Cryptographic Assumptions: A Position Paper
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- How to Generate and Use Universal Samplers
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Functional Encryption: Definitions and Challenges
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Indistinguishability Obfuscation from Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Obfuscation of Probabilistic Circuits and Applications
- Breaking the Sub-Exponential Barrier in Obfustopia
- Fuzzy Identity-Based Encryption
- Advances in Cryptology - CRYPTO 2003
- Witness encryption and its applications
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
This page was built for publication: Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
