توضیحات
ABSTRACT
With the continuous development of cloud computing, more and more sensitive data needs to be centrally stored in the cloud storage. For protecting the privacy of data, sensitive data must be encrypted before being outsourced to the server. The traditional PEKS (Public Encryption Keyword Search) enables users to search data by using keywords in the condition of encryption, however, it not only needs the security channel but also tolerates the huge pairing-computation. Although the pairing-free public key encryption with keyword search has been proposed, it can not support fuzzy keyword search and this drawback greatly reduces the usability of the system. In this paper, the proposed scheme features three good aspects: First, the keywords and data have been encrypted under the server’s public key and thus the secure channel of the keywords transmission has been eliminated inthe sense that the outside attackers cannot obtain any information related to the keywords without the knowledge of the server’s private key. Second, our scheme not only supports accurate keyword search encryption but also supports the search when the keywords input have any spelling mistakes or format inconsistencies, which significantly improved the availability of the system. Finally, the proposed scheme is constructed on the El Gamal encryption instead of the bilinear-pairing encryption, which greatly improve the computational efficiency.
INTRODUCTION
With the development of cloud computing, more and more confidential documents will be stored in the cloud environment. But Clients also worry about the trust rank of the server, so the data stored in the cloud server will be encrypted. Clients can download the all data and decrypt it, then they will search what they want by keywords, however, the process will expend a lot of time and cost. So, it’s more and more important to propose an effective searchable encryption scheme. Boneh et al. propose the keyword search scheme under the condition of public key encryption for the first time in [2]. But a secure channel is established between the server and receiver to transmit data. As all we know, the computing overhead of bilinear pairings is very huge. Thokozani et al. propose a pairing-free PEKS scheme in [14] and it greatly reduces the computational cost. However, this scheme only allows exact keyword search, that is to say, the searching keywords can not tolerate any incorrect spellings and formats. The obvious drawbacks seriously reduces the availability of it.
Year: 2016
Publisher : International Journal of Network Security
By : Yilei Wang , Wenyi Bao , Yang Zhao , Hu Xiong , and Zhiguang Qin
File Information: English Language/ 6 Page / size: 264 KB
Download: click
سال : 2016
ناشر : International Journal of Network Security
کاری از : Yilei Wang , Wenyi Bao , Yang Zhao , Hu Xiong , and Zhiguang Qin
اطلاعات فایل : زبان انگلیسی / 6 صفحه / حجم : KB 264
لینک دانلود : روی همین لینک کلیک کنید
نقد و بررسیها
هنوز بررسیای ثبت نشده است.