Articles in Press

Accepted articles here

Latest Issues

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Volume 8 Issue 1

Permission-based Index Clustering for Secure Multi-User Search

Eirini C. Micheli^(a), Giorgos Margaritis^(a), Stergios V. Anastasiadis^(a),(*)

Transactions on Data Privacy 8:1 (2015) 29 - 53

Abstract, PDF

(a) Department of Computer Science and Engineering, University of Ioannina, Ioannina 45110, Greece.

e-mail:femicheli @cs.uoi.gr; gmargari @cs.uoi.gr; stergiosg @cs.uoi.gr

Abstract

Secure keyword search in shared infrastructures prevents stored documents from leaking sensitive information to unauthorized users. A shared index provides confidentiality if it is exclusively used by users authorized to search all the indexed documents. We introduce the Lethe indexing workflow to improve query and update efficiency in secure keyword search. The Lethe workflow clusters together documents with similar sets of authorized users, and creates shared indices for configurable document subsets accessible by the same users. We examine different datasets based on the empirical statistics of a document sharing system and alternative theoretical distributions. We apply Lethe to generate indexing organizations of different tradeoffs between the search and update cost. We show the robustness of our method by obtaining configurations of similar low costs from application of prototype-based and density-based clustering algorithms. With measurements over an open-source distributed search engine, we experimentally confirm the improved search and update performance of the particular indexing configurations that we introduce.

^* Corresponding author.

Follow us

Supports