CryptoDB
Verifiable Inner Product Encryption Scheme
| Authors: | |
|---|---|
| Download: | |
| Presentation: | Slides |
| Abstract: | In the standard setting of functional encryption (FE), we assume both the Central Authority (CA) and the encryptors to run their respective algorithms faithfully. Badrinarayanan et al. [ASIACRYPT 2016] proposed the concept of verifiable FE, which essentially guarantees that dishonest encryptors and authorities, even when colluding together, are not able to generate ciphertexts and tokens that give “inconsistent” results. They also provide a compiler turning any perfectly correct FE into a verifiable FE, but do not give efficient constructions. In this paper we improve on this situation by considering Inner-Product Encryption (IPE), which is a special case of functional encryption and a primitive that has attracted wide interest from both practitioners and researchers in the last decade. Specifically, we construct the first efficient verifiable IPE (VIPE) scheme according to the inner-product functionality of Katz, Sahai and Waters [EUROCRYPT 2008]. To instantiate the general construction of Badrinarayanan et al. we need to solve several additional challenges. In particular, we construct the first efficient perfectly correct IPE scheme. Our VIPE satisfies unconditional verifiability, whereas its privacy relies on the DLin assumption. |
Video from PKC 2020
BibTeX
@article{pkc-2020-30283,
title={Verifiable Inner Product Encryption Scheme},
booktitle={Public-Key Cryptography – PKC 2020},
series={Public-Key Cryptography – PKC 2020},
publisher={Springer},
volume={12110},
pages={65-94},
doi={10.1007/978-3-030-45374-9_3},
author={Najmeh Soroush and Vincenzo Iovino and Alfredo Rial and Peter B. Roenne and Peter Y. A. Ryan},
year=2020
}