@Article{cmc.2021.017216, AUTHOR = {Lin Mei, Chungen Xu, Lei Xu, Xiaoling Yu, Cong Zuo}, TITLE = {Verifiable Identity-Based Encryption with Keyword Search for IoT from Lattice}, JOURNAL = {Computers, Materials \& Continua}, VOLUME = {68}, YEAR = {2021}, NUMBER = {2}, PAGES = {2299--2314}, URL = {http://www.techscience.com/cmc/v68n2/42210}, ISSN = {1546-2226}, ABSTRACT = {Internet of Things (IoT), which provides the solution of connecting things and devices, has increasingly developed as vital tools to realize intelligent life. Generally, source-limited IoT sensors outsource their data to the cloud, which arises the concerns that the transmission of IoT data is happening without appropriate consideration of the profound security challenges involved. Though encryption technology can guarantee the confidentiality of private data, it hinders the usability of data. Searchable encryption (SE) has been proposed to achieve secure data sharing and searching. However, most of existing SE schemes are designed under conventional hardness assumptions and may be vulnerable to the adversary with quantum computers. Moreover, the untrusted cloud server may perform an unfaithful search execution. To address these problems, in this paper, we propose the first verifiable identity-based keyword search (VIBKS) scheme from lattice. In particular, a lattice-based delegation algorithm is adopted to help the data user to verify both the correctness and the integrity of the search results. Besides, in order to reduce the communication overhead, we refer to the identity-based mechanism. We conduct rigorous proof to demonstrate that the proposed VIBKS scheme is ciphertext indistinguishable secure against the semi-honest-but-curious adversary. In addition, we give the detailed computation and communication complexity of our VIBKS and conduct a series of experiments to validate its efficiency performance.}, DOI = {10.32604/cmc.2021.017216} }