Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
From MaRDI portal
Recommendations
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Functional encryption for randomized functionalities
- Functional encryption: deterministic to randomized functions from simple assumptions
- Function-private functional encryption in the private-key setting
- Function-private functional encryption in the private-key setting
Cites work
- A punctured programming approach to adaptively secure functional encryption
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained pseudorandom functions and their applications
- From selective to adaptive security in functional encryption
- Function-private functional encryption in the private-key setting
- Function-private identity-based encryption: hiding the function in functional encryption
- Function-private subspace-membership encryption and its applications
- Functional encryption for randomized functionalities
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Functional signatures and pseudorandom functions
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-Based Encryption from the Weil Pairing
- Multi-input functional encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- On extractability obfuscation
- On the (im)possibility of obfuscating programs
- On the achievability of simulation-based security for functional encryption
- On the practical security of inner product functional encryption
- On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
- Predicate Privacy in Encryption Systems
- Reusable garbled circuits and succinct functional encryption
Cited in
(19)- Functional encryption for bounded collusions, revisited
- Function-private functional encryption in the private-key setting
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Making public key functional encryption function private, distributively
- Steel: composable hardware-based stateful and randomised functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Offline witness encryption with semi-adaptive security
- On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
- Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
- Function-private functional encryption in the private-key setting
- Functional encryption for randomized functionalities
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- On Removing Graded Encodings from Functional Encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Functional encryption against probabilistic queries: definition, construction and applications
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Simulation secure multi-input quadratic functional encryption: applications to differential privacy
This page was built for publication: Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747658)
