Dynamic bounded-collusion streaming functional encryption from minimal assumptions
From MaRDI portal
Cites work
- A generic approach to constructing and proving verifiable random functions
- ABE for DFA from LWE against bounded collusions, revisited
- Adaptively secure garbled circuits from one-way functions
- Bounded CCA2-Secure Encryption
- Bounded Collusion ABE for TMs from IBE
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
- Bounded-collusion IBE from key homomorphism
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Collusion resistant traitor tracing from learning with errors
- Dynamic collusion bounded functional encryption from identity-based encryption
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Foundations of Cryptography
- Foundations of Cryptography
- Function-private functional encryption in the private-key setting
- Functional encryption for bounded collusions, revisited
- Functional encryption for randomized functionalities
- Functional Encryption for Turing Machines
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 2086699 (Why is no real title available?)
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Multi-input functional encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input functional encryption with unbounded-message security
- Obfuscation of probabilistic circuits and applications
- On the black-box complexity of private-key inner-product functional encryption
- On the cryptographic hardness of finding a Nash equilibrium
- Optimal bounded-collusion secure functional encryption
- Reusable garbled circuits and succinct functional encryption
- Streaming functional encryption
- Stronger security for reusable garbled circuits, general definitions and attacks
- Topics in Cryptology – CT-RSA 2004
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: Dynamic bounded-collusion streaming functional encryption from minimal assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863936)
