Efficient Approximate Search using VGRAM over Encrypted Cloud Data

摘要：

　　As Cloud Computing becomes popular,most data owners want to outsource their data into the cloud.For security,the data needs to be encrypted.However,traditional encryption schemes obsolete most applications over encrypted data such as data searching.One solution is searchable encryption which allows a client to search over encrypted data.One hand,many researchers focus on exact searchable encryption schemes.Approximate search,on the other hand,is more practical since it allows minor typos in query words.In this paper,we present a new efficient and secure scheme to support approximate search.The main idea is to reduce the edit distance between two keywords to Hamming distance between their Bloom filters using the technique of VGRAM.To the best of our knowledge,our scheme is the first to utilize the VGRAM technique into searchable encryption.Our experiments show that the new scheme is more efficient than previous approximate searchable schemes especially in term of storage.

关键词： Cloud Computing Searchable Encryption Approximate Search VGRAM

作者: Lidong Han Changhui Hu

作者单位: school of Information and Engineering Hangzhou Normal University Hangzhou,P.R.China School of Mathematical Sciences Dalian University of Technology Dalian,P.R.China

会议类型: 国际会议

会议名称: 2014 2nd International Conference on Advanced Cloud and Big Data (CBD 2014)(2014年先进云计算和大数据国际会议)

会议地点: 安徽黄山

会议语种:英文

页码: 228-234

在线出版日期: 2014-11-20（万方平台首次上网日期，不代表论文的发表时间）