Using secret sharing for searching in encrypted data


Share/Save/Bookmark

Brinkman, R. and Doumen, J.M. and Jonker, W. (2004) Using secret sharing for searching in encrypted data. In: VLDB 2004 Workshop on Secure data management, SDM 2004, Toronto, Canada (pp. pp. 18-27).

open access
[img]
Preview
PDF
172kB
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.
Item Type:Conference or Workshop Item
Copyright:©2004 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/48636
Official URL:http://dx.doi.org/10.1007/b99822
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 220264