TY - GEN
T1 - Feel the Quantum Functioning
T2 - Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy
AU - Bakas, Alexandros
AU - Michalas, Antonis
AU - Frimpong, Eugene
AU - Rabbaninejad, Reyhaneh
N1 - Funding Information:
This work was partially funded from the Technology Innovation Institute (TII), Abu Dhabi, United Arab Emirates, for the project ARROWSMITH: Living (Securely) on the edge. This work was partially funded by the Harpocrates project, Horizon Europe.
Publisher Copyright:
© 2022, IFIP International Federation for Information Processing.
PY - 2022
Y1 - 2022
N2 - Functional Encryption (FE) allows users who hold a specific decryption key, to learn a specific function of encrypted data while the actual plaintexts remain private. While FE is still in its infancy, it is our strong belief that in the years to come, this remarkable cryptograhic primitive will have matured to a degree that will make it an integral part of access-control systems, especially cloud-based ones. To this end, we believe it is of great importance to not only provide theoretical and generic constructions but also concrete instantiations of FE schemes from well-studied cryptographic assumptions. Therefore, in this paper, we undertake the task of presenting two instantiations of the generic work presented in [5] from the Decisional Diffie-Hellman (DDH) problem that also satisfy the property of verifiable decryption. Moreover, we present a novel multi-input FE (MIFE) scheme, that can be instantiated from Regev’s cryptosystem, and thus remains secure even against quantum adversaries. Finally, we provide a multi-party computation (MPC) protocol that allows our MIFE construction to be deployed in the multi-client model.
AB - Functional Encryption (FE) allows users who hold a specific decryption key, to learn a specific function of encrypted data while the actual plaintexts remain private. While FE is still in its infancy, it is our strong belief that in the years to come, this remarkable cryptograhic primitive will have matured to a degree that will make it an integral part of access-control systems, especially cloud-based ones. To this end, we believe it is of great importance to not only provide theoretical and generic constructions but also concrete instantiations of FE schemes from well-studied cryptographic assumptions. Therefore, in this paper, we undertake the task of presenting two instantiations of the generic work presented in [5] from the Decisional Diffie-Hellman (DDH) problem that also satisfy the property of verifiable decryption. Moreover, we present a novel multi-input FE (MIFE) scheme, that can be instantiated from Regev’s cryptosystem, and thus remains secure even against quantum adversaries. Finally, we provide a multi-party computation (MPC) protocol that allows our MIFE construction to be deployed in the multi-client model.
KW - Functional Encryption
KW - Learning With Errors
KW - Multi-Party Computation
KW - Verifiable Decryption
U2 - 10.1007/978-3-031-10684-2_16
DO - 10.1007/978-3-031-10684-2_16
M3 - Conference contribution
AN - SCOPUS:85135013313
SN - 9783031106835
T3 - Lecture Notes in Computer Science
SP - 279
EP - 299
BT - Data and Applications Security and Privacy XXXVI - 36th Annual IFIP WG 11.3 Conference, DBSec 2022, Proceedings
A2 - Sural, Shamik
A2 - Lu, Haibing
PB - Springer
Y2 - 18 July 2022 through 20 July 2022
ER -