Incompressible functional encryption
From MaRDI portal
Cites work
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Bootstrapping homomorphic encryption via functional encryption
- Collusion resistant traitor tracing from learning with errors
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Hardness of non-interactive differential privacy from one-way functions
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Incompressible cryptography
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Laconic function evaluation and applications
- Laconic function evaluation for Turing machines
- Laconic oblivious transfer and its applications
- Leakage-resilient incompressible cryptography: constructions and barriers
- Lockable obfuscation
- Multi-instance randomness extraction and security against bounded-storage mass surveillance
- New directions in cryptography
- Obfuscating compute-and-compare programs under LWE
- On Forward-Secure Storage
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Predicate encryption for circuits from LWE
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Rate-1 incompressible encryption from standard assumptions
- Reusable garbled circuits and succinct functional encryption
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Risky traitor tracing and new differential privacy negative results
This page was built for publication: Incompressible functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296697)
