Receiver‐ and sender‐deniable functional encryption
| Autor: | Angelo De Caro, Adam O'Neill, Vincenzo Iovino |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
Computer Networks and Communications Computer science 0102 computer and information sciences 02 engineering and technology computer.software_genre Encryption 01 natural sciences Multiple encryption Filesystem-level encryption 0202 electrical engineering electronic engineering information engineering Functional encryption cryptography functional encryption deniability business.industry Deniable encryption 010201 computation theory & mathematics Probabilistic encryption 020201 artificial intelligence & image processing Attribute-based encryption On-the-fly encryption business computer Software Information Systems Computer network |
| Zdroj: | IET Information Security. 12:207-216 |
| ISSN: | 1751-8717 |
| DOI: | 10.1049/iet-ifs.2017.0040 |
| Popis: | Deniable encryption, first introduced by Canetti et al. 1997, allows equivocation of encrypted communication. In this work, the authors generalise its study to functional encryption (FE). The authors’ results are summarised as follows: They first put forward and motivate the concept of receiver-deniable FE, for which they consider two models. In the first model, as previously considered by O'Neill et al. 2011 in the case of identity-based encryption, a receiver gets assistance from the master authority to generate a fake secret key. In the second model, there are ‘normal’ and ‘deniable’ secret keys, and a receiver in possession of a deniable secret key can produce a fake but authentic-looking normal key on its own. In the first model, they show a compiler from any FE scheme for circuits to a FE scheme having receiver deniability. In addition, they show an efficient receiver-deniable FE scheme for Boolean formulae from bilinear maps. In the second (multi-distributional) model, they present a specific FE scheme for circuits having receiver deniability. To the authors’ knowledge, a scheme in the multi-distributional model was not previously known even for the special case of identity-based encryption. Finally, they construct the first sender (non-multi-distributional) deniable FE scheme. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text