Brinkman, R. and Doumen, J.M. and Jonker, W.
Using secret sharing for searching in encrypted data.
Technical Report TR-CTIT-04-35,
Centre for Telematics and Information Technology University of Twente, Enschede.
Full text available as:
Official URL: http://www.ub.utwente.nl/webdocs/ctit/1/00000106.pdf
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.
|Item Type:||Internal Report (Technical Report)|
|Research Group:||EWI-DB: Databases, EWI-DIES: Distributed and Embedded Security|
|Research Program:||CTIT-ISTRICE: Integrated Security and Privacy in a Networked World|
|Research Project:||Secure Meta Data: Secure Content Management In Ambient Environments|
|Additional Information:||Imported from CTIT|
|Deposited On:||23 August 2006|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item