20 20

Transactions on
Data Privacy
Foundations and Technologies


Articles in Press

Accepted articles here

Latest Issues

Year 2018

Volume 11 Issue 3
Volume 11 Issue 2
Volume 11 Issue 1

Year 2017

Volume 10 Issue 3
Volume 10 Issue 2
Volume 10 Issue 1

Year 2016

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Year 2015

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Year 2014

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Year 2013

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Year 2012

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Year 2011

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Year 2010

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Year 2009

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Year 2008

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1

Volume 9 Issue 2

Secure Multi-keyword Similarity Search Over Encrypted Cloud Data Supporting Efficient Multi-user Setup

Mikhail Strizhov(a),(*), Indrajit Ray(a)

Transactions on Data Privacy 9:2 (2016) 131 - 159

Abstract, PDF

(a) Computer Science Department, Colorado State University, Fort Collins, CO, 80523, USA.

e-mail:strizhov @CS.ColoState.EDU; Indrajit.Ray @ColoState.EDU


Searchable encryption allows one to store encrypted documents on a remote honest-but-curious server, and query that data at the server itself without requiring the documents to be decrypted prior to searching. This not only protects the data from the prying eyes of the server, but can also reduce the communication overhead between the server and the user and local processing at the latter. Previous research in searchable encryption have investigated exact match search on keywords and boolean expression search on keywords. In this work, we first propose a novel secure and efficient multi-keyword similarity searchable encryption (MKSim) that returns the matching data items in a ranked order manner. Unlike many existing schemes, our search complexity is sublinear to the total number of documents that contain the queried set of keywords. Our theoretical analysis demonstrates that the proposed scheme is provably secure against adaptive chosen-keyword attacks, the strongest form of security sought in searchable encryption. Next, we develop a proof-of-concept prototype that we use for experimentation on a large-scale real-world dataset and evaluate the efficiency and scalability of our solution. Finally, we extend the MKSim protocol to the multi-user setting in which the data owner wishes to provide selective access to his encrypted document corpus to more than one user.

* Corresponding author.

Follow us


ISSN: 1888-5063; ISSN (Digital): 2013-1631; D.L.:B-11873-2008; Web Site: http://www.tdp.cat/
Contact: Transactions on Data Privacy; Vicenç Torra; U. of Skövde; PO Box 408; 54128 Skövde; (Sweden); e-mail:tdp@tdp.cat
Note: TDP's web site does not use cookies. TDP does not keep information neither on IP addresses nor browsers. For the privacy policy access here.


Vicenç Torra, Last modified: 01 : 14 August 28 2016.