Vol.3 No.2 (April 2013)
Oblivious Fuzzy Keyword Search Based on Blind GDH Signature
As Cloud Computing becomes prevalent, data privacy has been a bottleneck of Cloud Computing. When using Cloud Computing, users need to implement a large amount of data search. So the security of search is a key point of protecting user’s data privacy. This paper mainly concentrates on the searchable encryption scheme. In order to guarantee the security property, a user needs to hide the keywords and the files he/she wants to search. In 2004 Wakaha Ogata and Kaoru Kurosawa proposed a secure searchable encryption scheme, named as oblivious keyword search (OKS), based on Chaum’s blind signature. However we find their scheme connecting only one keyword with the data file that is encrypting the data file with its keyword. And then if a data file contains several keywords, we need to repeat the encryption with every keyword. This is quite inefficient. We solve this problem by constructing a new OKS scheme from blind signature based on GDH assumption and connect data files with all its possible keywords. Furthermore, when users are searching by keywords, they might fail to get the desire data files, owing to mismatching the exact keywords. Aiming to solve this problem, we extend our scheme to an oblivious fuzzy keyword search (OFKS) scheme, allowing a user securely search data files through fuzzy keywords. Compare to the original scheme, our scheme possesses more practicality and has been fuzzy keyword supported.
韩 斐 , 秦 静 (2013) 基于盲GDH签名的无记忆模糊关键词搜索。 计算机科学与应用， 3， 127-133. doi: 10.12677/CSA.2013.32022
Copyright © 2015 Hans Publishers Inc. All rights reserved.