EEMCS EPrints Service
Brinkman, R. and Doumen, J.M. and Jonker, W. (2004) Using secret sharing for searching in encrypted data. In: Workshop on Secure Data Management in a Connected World (SDM), 30 Aug 2004, Toronto, Canada. pp. 18-27. Lecture Notes in Computer Science 3178. Springer-Verlag. ISSN 0302-9743 ISBN 3-540-22983-3
This is the latest version of this eprint.
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-540-30073-1_2
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
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item