Multi-user noisy keyword search over encrypted data

Multi-user searchable symmetric encryption allows a group of authorized parties other than the owner of document collection to perform keyword-based searches on the encrypted document set. Although prior work has yielded some effective and elegant propositions, unfortunately all of them only support exact keyword search. In many cases, however, the documents themselves are not associated with exact keywords. Instead, they are labeled with some type of noisy keywords. In this paper, we first present a general framework for multi-user noisy-keyword-based searchable symmetric encryption in a fault-tolerant manner. Then we propose a construction which combines a single-user noisy-keyword-based searchable symmetric encryption scheme with a private-key dynamic broadcast encryption scheme. Through security analysis, we show that our solution is adaptively secure and is of revocable property. Copyright © 2013 Binary Information Press.