Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
From MaRDI portal
Recommendations
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Multi-input non-interactive functional encryption: constructions and applications
- Multi-input functional encryption
- Multi-input inner-product functional encryption from pairings
- Multi-input functional encryption with unbounded-message security
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- From single-input to multi-client inner-product functional encryption
- Multi-input functional encryption and its application in outsourcing computation
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
Cited in
(31)- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Multi-input non-interactive functional encryption: constructions and applications
- Multi-input functional encryption
- Function-private functional encryption in the private-key setting
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Multi-input inner-product functional encryption from pairings
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- FE and iO for Turing machines from minimal assumptions
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- scientific article; zbMATH DE number 1583777 (Why is no real title available?)
- Multi-input functional encryption and its application in outsourcing computation
- Multi-client functional encryption for separable functions
- Multi-input functional encryption with unbounded-message security
- Output-compressing randomized encodings and applications
- Multi-input functional encryption for unbounded arity functions
- Limits on the power of indistinguishability obfuscation and functional encryption
- Practical order-revealing encryption with limited leakage
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- From Minicrypt to Obfustopia via private-key functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Adaptively secure streaming functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Ad hoc PSM protocols: secure computation without coordination
- Updatable policy-compliant signatures
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- From cryptomania to obfustopia through secret-key functional encryption
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Decentralized multi-client functional encryption for inner product
This page was built for publication: Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739225)