[Resource Topic] 2019/051: Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy

Welcome to the resource topic for 2019/051

Title:
Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy

Authors: Daode Zhang, Jie Li, Bao Li, Xianhui Lu, Haiyang Xue, Dingding Jia, Yamin Liu

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.

ePrint: https://eprint.iacr.org/2019/051

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .