Verifiable keyword search over encrypted cloud data in smart city. (January 2018)

• Record Type: Journal Article
• Authors: Miao, Yinbin; Ma, Jianfeng; Jiang, Qi; Li, Xiong; Sangaiah, Arun Kumar
• Is Part Of: Computers & electrical engineering. Volume 65(2018)
• Page Start: 90
• Page End: 101
• Publication Date: 2018-01
• Subjects: Smart city -- Cloud computing -- Attribute-based keyword search -- Access privilege control; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2017.06.021
• Languages: English
• ISSNs: 0045-7906

Abstract

Highlights: The proposed verifiable attribute-based keyword search scheme allows users to check the correctness of search results. The access privileges of the same data are considered in proposed scheme. The computational and storage costs in proposed scheme are acceptable for the resources-limited devices in smart city. Graphical abstract: Abstract: In smart city, which integrates the Information and Communication Technologies (ICT) including cloud computing and internet of things, all kinds of data collected by smart devices help to make everything intelligent. Through outsourcing encrypted data to cloud server, data owners can reduce the high storage and computational burden on resources-constrained smart devices. To further avoid the semi-honest-but-curious cloud server returning a fraction of false search results, this paper proposes a verifiable attribute-based keyword search scheme, thereby allowing users to check the correctness of the search results and achieving the fine-grained access control. Besides, our scheme considers the access privileges of the same data according to attribute-based priority tree. The formal security analysis proves that our scheme is secure against the chosen-keyword attacks in the generic bilinear group model, and the experimental simulations using a real-world dataset demonstrate its efficiency and feasibility in practice.