Abstract / Description of output
In functional encryption (FE) a sender, Alice, encrypts plaintexts for which a receiver, Bob, can obtain functional evaluations, while Charlie is responsible for initializing the encryption keys and issuing the decryption keys. Standard notions of security for FE deal with a malicious Bob and guarantee the confidentiality of Alice’s messages despite the leakage that occurs due to the functional keys that are revealed to the adversary via various forms of indistinguishability experiments that correspond to IND-CPA, IND-CCA and simulation-based security.
In this work we provide a complete and systematic investigation of Consistency, a natural security property for FE, that deals with attacks that can be mounted by Alice, Charlie or a collusion of the two against Bob. We develop three main types of consistency notions according to which set of parties is corrupted and investigate their relation to the standard security properties of FE. To validate our different consistency types, we extend the universally composable framework for FE by Matt and Maurer (CSF 2015) and we show that our consistency notions naturally complement FE security by proving how they imply (and are implied by) UC security depending on which set of parties is corrupted; in this way we demonstrate a complete characterization of consistency for FE. Finally, we provide explicit constructions that achieve consistency efficiently either directly via a construction based on MDDH for specific function classes of inner products over a modulo group or generically for all the consistency types via compilers using standard cryptographic tools.
In this work we provide a complete and systematic investigation of Consistency, a natural security property for FE, that deals with attacks that can be mounted by Alice, Charlie or a collusion of the two against Bob. We develop three main types of consistency notions according to which set of parties is corrupted and investigate their relation to the standard security properties of FE. To validate our different consistency types, we extend the universally composable framework for FE by Matt and Maurer (CSF 2015) and we show that our consistency notions naturally complement FE security by proving how they imply (and are implied by) UC security depending on which set of parties is corrupted; in this way we demonstrate a complete characterization of consistency for FE. Finally, we provide explicit constructions that achieve consistency efficiently either directly via a construction based on MDDH for specific function classes of inner products over a modulo group or generically for all the consistency types via compilers using standard cryptographic tools.
Original language | English |
---|---|
Title of host publication | 2021 IEEE 34th Computer Security Foundations Symposium (CSF) |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 1-16 |
Number of pages | 47 |
ISBN (Electronic) | 978-1-7281-7607-9 |
ISBN (Print) | 978-1-7281-7608-6 |
DOIs | |
Publication status | Published - 10 Aug 2021 |
Event | 34th IEEE Computer Security Foundations Symposium - Duration: 21 Jun 2021 → 25 Jun 2021 https://www.ieee-security.org/TC/CSF2021/accepted.html |
Publication series
Name | |
---|---|
ISSN (Print) | 1940-1434 |
ISSN (Electronic) | 2374-8303 |
Symposium
Symposium | 34th IEEE Computer Security Foundations Symposium |
---|---|
Abbreviated title | CSF 2021 |
Period | 21/06/21 → 25/06/21 |
Internet address |