Deterministic identity-based encryption from lattice-based programmable hash functions with high min-entropy

Author

Daode ZHANG
Jie LI
Bao LI
Xianhui LU
Haiyang XUE, Singapore Management UniversityFollow
Dingding JIA
Yamin LIU

Publication Type

Journal Article

Version

publishedVersion

Publication Date

1-2020

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 basic matrices. In this paper, we consider to construct adaptively secure DIBE schemes with more compact public parameters from the LWE problem. (i) On the one hand, we gave a generic DIBE construction from lattice-based programmable hash functions with high min-entropy. (ii) 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 ω(log⁡λ) basic matrices.

Discipline

Information Security

Research Areas

Cybersecurity

Areas of Excellence

Digital transformation

Publication

Security and Communication Networks

Volume

2019

First Page

1

Last Page

12

ISSN

1939-0114

Identifier

10.1155/2019/1816393

Publisher

Wiley Open Access

Citation

ZHANG, Daode; LI, Jie; LI, Bao; LU, Xianhui; XUE, Haiyang; JIA, Dingding; and LIU, Yamin. Deterministic identity-based encryption from lattice-based programmable hash functions with high min-entropy. (2020). Security and Communication Networks. 2019, 1-12.
Available at: https://ink.library.smu.edu.sg/sis_research/9185

Copyright Owner and License

Authors

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.

Additional URL

https://doi.org/10.1155/2019/1816393