Paper 2019/051 Original: eprint.iacr.org/2019/051 ↗
Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy
Abstract
There only exists one deterministic identity-based encryption (DIBE) scheme which is adaptively secure in the auxiliary-input setting, under the learning with errors (LWE) assumption. However, the master public key consists of $\mathcal{O}(\lambda)$ basic matrices. In this paper, we consider to construct adaptively secure DIBE schemes with more compact public parameters from the LWE problem. On the one hand, we gave a generic DIBE construction from lattice-based programmable hash functions with high min-entropy. On the other hand, when instantiating our generic DIBE construction with four LPHFs with high min-entropy, we can get four adaptively secure DIBE schemes with more compact public parameters. In one of our DIBE schemes, the master public key only consists of $\omega(\log \lambda)$ basic matrices.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2019-01-25: last updated
- 2019-01-25: published
- Short URL
- https://ia.cr/2019/051
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/051,
author = {Daode Zhang and Jie Li and Bao Li and Xianhui Lu and Haiyang Xue and Dingding Jia and Yamin Liu},
title = {Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/051},
year = {2019},
url = {https://eprint.iacr.org/2019/051}
}