Privacy-Preserving Multi-keyword Ranked Search with Verifying and Updating Efficiently

碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 103 === Because of the cloud service springing up quickly, more and more in- dividuals and enterprise choose to store the massive and significant data in cloud. The cloud service providers offer the powerful service to help manage data, in this way the users can red...

Full description

Bibliographic Details
Main Authors: Yong-Chang Kang, 康永昌
Other Authors: 周承復
Format: Others
Language:en_US
Published: 2015
Online Access:http://ndltd.ncl.edu.tw/handle/52062440628517257111
Description
Summary:碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 103 === Because of the cloud service springing up quickly, more and more in- dividuals and enterprise choose to store the massive and significant data in cloud. The cloud service providers offer the powerful service to help manage data, in this way the users can reduce the expendicure on storage management and hardware. However, the user will confront the threat on security because we delegate the management to the third-party. Most user will encrypt the data before outsourcing, but this behavior give rise to the problem about the searching under the encrypted data. In recent years, Cao et al. [1] propose the MRSE technique which can provide multi-keyword ranked search. If in the case of updating document, this MRSE need to rebuild the whole searchable index. In the reality, the frequency of the updating documents will lower the MRSE efficiency. In this work, we make efforts in improving the updating efficiency. The cloud stream the index metadata to the user, and the user de- crypt the metadata and get the ranked result. In the threatened environment, our design will not leak any privacy about the document. Moreover, the user even can verify the data integrity to prevent the cloud cheating or storage er- ror accident. In our framework, the user cooperate with the cloud and burden some caculation, but we can still get the verified multi-keyword ranked result in the short time.