CryptoDB
Decentralized Multi-Client Functional Encryption with Strong Security
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | Decentralized Multi-Client Functional Encryption (DMCFE) extends the basic functional encryption to multiple clients that do not trust each other. They can independently encrypt the multiple plaintext-inputs to be given for evaluation to the function embedded in the functional decryption key, defined by multiple parameter-inputs. And they keep control on these functions as they all have to contribute to the generation of the functional decryption keys. Tags can be used in the ciphertexts and the keys to specify which inputs can be combined together. As any encryption scheme, DMCFE provides privacy of the plaintexts. But the functions associated to the functional decryption keys might be sensitive too (e.g. a model in machine learning). The function-hiding property has thus been introduced to additionally protect the function evaluated during the decryption process. In this paper, we provide new proof techniques to analyze a new concrete construction of function-hiding DMCFE for inner products, with strong security guarantees: the adversary can adaptively query multiple challenge ciphertexts and multiple challenge keys, with unbounded repetitions of the same tags in the ciphertext-queries and a fixed polynomially-large number of repetitions of the same tags in the key-queries. Previous constructions were proven secure in the selective setting only. |
BibTeX
@article{cic-2024-34396,
title={Decentralized Multi-Client Functional Encryption with Strong Security},
journal={cic},
publisher={International Association for Cryptologic Research},
volume={1, Issue 2},
url={https://cic.iacr.org//p/1/2/3},
doi={10.62056/andkp2fgx},
author={Ky Nguyen and David Pointcheval and Robert Schädlich},
year=2024
}