Using secret sharing for searching in encrypted data

Richard Brinkman; Jeroen Doumen; Willem Jonker

doi:10.1007/978-3-540-30073-1_2

Using secret sharing for searching in encrypted data

Richard Brinkman, Jeroen Doumen, Willem Jonker

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

302 Downloads (Pure)

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.

Original language	English
Title of host publication	Secure Data Management
Subtitle of host publication	VLDB 2004 Workshop, SDM 2004, Toronto, Canada, August 30, 2004, Proceedings
Editors	Willem Jonker, Milan Petković
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	18-27
Number of pages	10
ISBN (Electronic)	978-3-540-30073-1
ISBN (Print)	978-3-540-22983-4
DOIs	https://doi.org/10.1007/978-3-540-30073-1_2
Publication status	Published - 30 Aug 2004
Event	1st VLDB Workshop on Secure Data Management, SDM 2004 - Toronto, Canada Duration: 30 Aug 2004 → 30 Aug 2004 Conference number: 1

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer-Verlag
Volume	3178
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Workshop

Workshop	1st VLDB Workshop on Secure Data Management, SDM 2004
Abbreviated title	SDM
Country/Territory	Canada
City	Toronto
Period	30/08/04 → 30/08/04

Keywords

DB-SDM: SECURE DATA MANAGEMENT
SCS-Cybersecurity

Access to Document

10.1007/978-3-540-30073-1_2

ArticleAccepted author version, 195 KB

Cite this

@inproceedings{cfe558a08aa242598481fb0e1f78bf3e,

title = "Using secret sharing for searching in encrypted data",

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.",

keywords = "DB-SDM: SECURE DATA MANAGEMENT, SCS-Cybersecurity",

author = "Richard Brinkman and Jeroen Doumen and Willem Jonker",

year = "2004",

month = aug,

day = "30",

doi = "10.1007/978-3-540-30073-1_2",

language = "English",

isbn = "978-3-540-22983-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "18--27",

editor = "Willem Jonker and Milan Petkovi{\'c}",

booktitle = "Secure Data Management",

address = "Germany",

note = "1st VLDB Workshop on Secure Data Management, SDM 2004, SDM ; Conference date: 30-08-2004 Through 30-08-2004",

}

Brinkman, R, Doumen, J & Jonker, W 2004, Using secret sharing for searching in encrypted data. in W Jonker & M Petković (eds), Secure Data Management: VLDB 2004 Workshop, SDM 2004, Toronto, Canada, August 30, 2004, Proceedings. Lecture Notes in Computer Science, vol. 3178, Springer, Berlin, Heidelberg, pp. 18-27, 1st VLDB Workshop on Secure Data Management, SDM 2004, Toronto, Canada, 30/08/04. https://doi.org/10.1007/978-3-540-30073-1_2

Using secret sharing for searching in encrypted data. / Brinkman, Richard; Doumen, Jeroen; Jonker, Willem.
Secure Data Management: VLDB 2004 Workshop, SDM 2004, Toronto, Canada, August 30, 2004, Proceedings. ed. / Willem Jonker; Milan Petković. Berlin, Heidelberg: Springer, 2004. p. 18-27 (Lecture Notes in Computer Science; Vol. 3178).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Using secret sharing for searching in encrypted data

AU - Brinkman, Richard

AU - Doumen, Jeroen

AU - Jonker, Willem

N1 - Conference code: 1

PY - 2004/8/30

Y1 - 2004/8/30

N2 - 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.

AB - 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.

KW - DB-SDM: SECURE DATA MANAGEMENT

KW - SCS-Cybersecurity

U2 - 10.1007/978-3-540-30073-1_2

DO - 10.1007/978-3-540-30073-1_2

M3 - Conference contribution

SN - 978-3-540-22983-4

T3 - Lecture Notes in Computer Science

SP - 18

EP - 27

BT - Secure Data Management

A2 - Jonker, Willem

A2 - Petković, Milan

PB - Springer

CY - Berlin, Heidelberg

T2 - 1st VLDB Workshop on Secure Data Management, SDM 2004

Y2 - 30 August 2004 through 30 August 2004

ER -

Using secret sharing for searching in encrypted data

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this