標題: iPEKS: Fast and Secure Cloud Data Retrieval from the Public-key Encryption with Keyword Search
作者: Tseng, Fu-Kuo
Chen, Rong-Jaye
Lin, Bao-Shuh Paul
資訊工程學系
Department of Computer Science
關鍵字: cloud data;public-key encryption with keyword search;interactive search;search efficiency;implementation
公開日期: 2013
摘要: In recent years, considerable concern has arisen over the security of the data stored in the cloud. A number of studies have suggested the use of cryptographic primitives to protect the data. As these tools transform the data into an unintelligible form, secure and efficient retrieval of the encrypted data from the cloud becomes a major challenge. The public-key encryption with keyword search (PEKS) scheme and many of its variants have been proposed to respond to this challenge. However, given a large number of data (or searchable keywords) would be tested sequentially in these PEKS schemes, previous search results should be employed to improve the efficiency of future searches. In this paper, we present an interactive construction named iPEKS where the search time is linear to the total number of distinct searched keywords instead of the total number of the searchable keywords. The more the keywords have been searched previously, the better the efficiency can be improved. We provide theoretical analysis to show the security and privacy. In addition, implementation and performance experiments exhibit a great improvement in efficiency compared with the previous schemes.
URI: http://hdl.handle.net/11536/24077
http://dx.doi.org/10.1109/TrustCom.2013.57
ISBN: 978-0-7695-5022-0
ISSN: 2324-898X
DOI: 10.1109/TrustCom.2013.57
期刊: 2013 12TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2013)
起始頁: 452
結束頁: 458
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000332856700059.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.