Using secret sharing for searching in encrypted data

23Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the server. In this paper we present a method, inspired by secure multi-party computation, to search efficiently in encrypted data. XML elements are translated to polynomials. A polynomial is split into two parts: a random polynomial for the client and the difference between the original polynomial and the client polynomial for the server. Since the client polynomials are generated by a random sequence generator only the seed has to be stored on the client. In a combined effort of both the server and the client a query can be evaluated without traversing the whole tree and without the server learning anything about the data or the query. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Brinkman, R., Doumen, J., & Jonker, W. (2004). Using secret sharing for searching in encrypted data. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3178, 18–27. https://doi.org/10.1007/978-3-540-30073-1_2

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