Name
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. 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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30073-1_2 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
random sequence,secure multi party computation,secret sharing | Secret sharing,Polynomial,Remote evaluation,XML,Computer science,Cryptography,Server,Encryption,Database server,Database,Distributed computing | Conference |
Volume | ISSN | Citations |
3178 | 0302-9743 | 20 |
PageRank | References | Authors |
1.13 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Brinkman | 1 | 54 | 3.58 |
| Jeroen Doumen | 2 | 326 | 21.84 |
| Willem Jonker | 3 | 640 | 55.71 |