基于盲GDH签名的无记忆模糊关键词搜索.pdfVIP

Computer Science and Application 计算机科学与应用, 2013, 3, 127-133 doi:10.12677/csa.2013.32022 Published Online April 2013 (/journal/csa.html) Oblivious Fuzzy Keyword Search Based on Blind * GDH Signature Fei Han, Jing Qin# School of Mathematics, Shandong University, Jinan Email: hanf1987@163.com, #qinjing@ Received: Feb. 11th st th , 2013; revised: Mar. 1 , 2013; accepted: Mar. 16 , 2013 Copyright © 2013 Fei Han, Jing Qin. This is an open access article distributed under the Creative Commons Attribution License, which permits unre- stricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract: 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