CryptoDB
Non-zero Inner Product Encryption Schemes from Various Assumptions: LWE, DDH and DCR
| Authors: | |
|---|---|
| Download: | |
| Conference: | PKC 2019 |
| Abstract: | In non-zero inner product encryption (NIPE) schemes, ciphertexts and secret keys are associated with vectors and decryption is possible whenever the inner product of these vectors does not equal zero. So far, much effort on constructing bilinear map-based NIPE schemes have been made and this has lead to many efficient schemes. However, the constructions of NIPE schemes without bilinear maps are much less investigated. The only known other NIPE constructions are based on lattices, however, they are all highly inefficient due to the need of converting inner product operations into circuits or branching programs.To remedy our rather poor understanding regarding NIPE schemes without bilinear maps, we provide two methods for constructing NIPE schemes: a direct construction from lattices and a generic construction from schemes for inner products (LinFE). For our first direct construction, it highly departs from the traditional lattice-based constructions and we rely heavily on new tools concerning Gaussian measures over multi-dimensional lattices to prove security. For our second generic construction, using the recent constructions of LinFE schemes as building blocks, we obtain the first NIPE constructions based on the DDH and DCR assumptions. In particular, we obtain the first NIPE schemes without bilinear maps or lattices. |
BibTeX
@inproceedings{pkc-2019-29300,
title={Non-zero Inner Product Encryption Schemes from Various Assumptions: LWE, DDH and DCR},
booktitle={Public-Key Cryptography – PKC 2019},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={11443},
pages={158-188},
doi={10.1007/978-3-030-17259-6_6},
author={Shuichi Katsumata and Shota Yamada},
year=2019
}