Welcome to the resource topic for 2016/524
Title:
Single-Key to Multi-Key Functional Encryption with Polynomial Loss
Authors: Sanjam Garg, Akshayaram Srinivasan
Abstract:Functional encryption (FE) enables fine-grained access to encrypted data. In a FE scheme, the holder of a secret key \SK_f (associated with a function f) and a ciphertext c (encrypting plaintext x) can learn f(x) but nothing more. An important parameter in the security model for FE is the number of secret keys that adversary has access to. In this work, we give a transformation from a FE scheme for which the adversary gets access to a single secret key (with ciphertext size sub-linear in the circuit for which this secret key is issued) to one that is secure even if adversary gets access to an {unbounded} number of secret keys. A novel feature of our transformation is that its security proof incurs only a {\em polynomial} loss.
ePrint: https://eprint.iacr.org/2016/524
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .