Distributed shuffling for preserving access confidentiality

16Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The shuffle index has been recently proposed for organizing and accessing data in outsourcing scenarios while protecting the confidentiality of the data as well as of the accesses to them. In this paper, we extend the shuffle index to the use of multiple servers for storing data, introducing a new protection technique (shadow) and enriching the original ones by operating in a distributed scenario. Our distributed shuffle index produces a significant increase in the protection of the system, with no additional costs. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

De Capitani Di Vimercati, S., Foresti, S., Paraboschi, S., Pelosi, G., & Samarati, P. (2013). Distributed shuffling for preserving access confidentiality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8134 LNCS, pp. 628–645). https://doi.org/10.1007/978-3-642-40203-6_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free