Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

5771 Using secret sharing for searching in encrypted data
Home Policy Brochure Browse Search User Area Contact Help

Brinkman, R. and Doumen, J.M. and Jonker, W. (2004) Using secret sharing for searching in encrypted data. Technical Report TR-CTIT-04-35, Centre for Telematics and Information Technology University of Twente, Enschede. ISSN 1381-3625

Full text available as:


196 Kb
Open Access

Official URL:


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
ID Code:5771
Deposited On:23 August 2006
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item