EEMCS

This is the latest version of this eprint.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 196 Kb

Official URL: http://dx.doi.org/10.1007/978-3-540-30073-1_2

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. 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.

Available Versions of this Item

• Using secret sharing for searching in encrypted data (deposited 12 November 2006)
  [Currently Displayed]

Export this item as:

• BibTeX
• XML

To correct this item please ask your editor

Repository Staff Only: edit this item