Conjunctive Wildcard Search over Encrypted Data

C.T. Bösch; Richard Brinkman; Pieter H. Hartel

doi:10.1007/978-3-642-23556-6_8

Conjunctive Wildcard Search over Encrypted Data

C.T. Bösch, Richard Brinkman, Pieter H. Hartel

Databases (Former)

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

49 Citations (Scopus)

37 Downloads (Pure)

Abstract

Searchable encryption allows a party to search over encrypted data without decrypting it. Prior schemes in the symmetric setting deal only with exact or similar keyword matches. We describe a scheme for the problem of wildcard searches over encrypted data to make search queries more flexible, provide a security proof for our scheme and com- pare the computational, communication and space complexity with existing schemes. We develop an efficient scheme, using pseudorandom functions and Bloom filters, that supports wildcard searches over encrypted data. The scheme also supports conjunctive wildcard searches, efficient and secure updates and is more efficient than previous solutions. Besides, our construction is independent of the encryption method of the remote data and is practical to use in real world applications.

Original language	Undefined
Title of host publication	8th VLDB Workshop on Secure Data Management, SDM 2011
Editors	M. Petkovic, Willem Jonker, W. Jonker
Place of Publication	Berlin
Publisher	Springer
Pages	114-127
Number of pages	14
ISBN (Print)	978-3-642-23555-9
DOIs	https://doi.org/10.1007/978-3-642-23556-6_8
Publication status	Published - Sept 2011
Event	8th VLDB Workshop on Secure Data Management, SDM 2011 - Seattle, United States Duration: 2 Sept 2011 → 2 Sept 2011 Conference number: 8

Publication series

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

Workshop

Workshop	8th VLDB Workshop on Secure Data Management, SDM 2011
Abbreviated title	SDM
Country/Territory	United States
City	Seattle
Period	2/09/11 → 2/09/11

Keywords

METIS-278760
IR-77961
Bloom filter
SCS-Cybersecurity
Wildcard
EWI-20436
Searchable Encryption

Access to Document

10.1007/978-3-642-23556-6_8

http://eprints.eemcs.utwente.nl/secure2/20436/01/CWSSE.pdf

Cite this

@inproceedings{6390ba11c463443f9cb4bdfc10e82229,

title = "Conjunctive Wildcard Search over Encrypted Data",

abstract = "Searchable encryption allows a party to search over encrypted data without decrypting it. Prior schemes in the symmetric setting deal only with exact or similar keyword matches. We describe a scheme for the problem of wildcard searches over encrypted data to make search queries more flexible, provide a security proof for our scheme and com- pare the computational, communication and space complexity with existing schemes. We develop an efficient scheme, using pseudorandom functions and Bloom filters, that supports wildcard searches over encrypted data. The scheme also supports conjunctive wildcard searches, efficient and secure updates and is more efficient than previous solutions. Besides, our construction is independent of the encryption method of the remote data and is practical to use in real world applications.",

keywords = "METIS-278760, IR-77961, Bloom filter, SCS-Cybersecurity, Wildcard, EWI-20436, Searchable Encryption",

author = "C.T. B{\"o}sch and Richard Brinkman and Hartel, {Pieter H.}",

note = "10.1007/978-3-642-23556-6_8 ; 8th VLDB Workshop on Secure Data Management, SDM 2011 ; Conference date: 02-09-2011 Through 02-09-2011",

year = "2011",

month = sep,

doi = "10.1007/978-3-642-23556-6_8",

language = "Undefined",

isbn = "978-3-642-23555-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "114--127",

editor = "M. Petkovic and Willem Jonker and W. Jonker",

booktitle = "8th VLDB Workshop on Secure Data Management, SDM 2011",

address = "Germany",

}

Bösch, CT, Brinkman, R & Hartel, PH 2011, Conjunctive Wildcard Search over Encrypted Data. in M Petkovic, W Jonker & W Jonker (eds), 8th VLDB Workshop on Secure Data Management, SDM 2011. Lecture Notes in Computer Science, vol. 6933, Springer, Berlin, pp. 114-127, 8th VLDB Workshop on Secure Data Management, SDM 2011, Seattle, Washington, United States, 2/09/11. https://doi.org/10.1007/978-3-642-23556-6_8

Conjunctive Wildcard Search over Encrypted Data. / Bösch, C.T.; Brinkman, Richard; Hartel, Pieter H.
8th VLDB Workshop on Secure Data Management, SDM 2011. ed. / M. Petkovic; Willem Jonker; W. Jonker. Berlin: Springer, 2011. p. 114-127 (Lecture Notes in Computer Science; Vol. 6933).

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

TY - GEN

T1 - Conjunctive Wildcard Search over Encrypted Data

AU - Bösch, C.T.

AU - Brinkman, Richard

AU - Hartel, Pieter H.

N1 - Conference code: 8

PY - 2011/9

Y1 - 2011/9

N2 - Searchable encryption allows a party to search over encrypted data without decrypting it. Prior schemes in the symmetric setting deal only with exact or similar keyword matches. We describe a scheme for the problem of wildcard searches over encrypted data to make search queries more flexible, provide a security proof for our scheme and com- pare the computational, communication and space complexity with existing schemes. We develop an efficient scheme, using pseudorandom functions and Bloom filters, that supports wildcard searches over encrypted data. The scheme also supports conjunctive wildcard searches, efficient and secure updates and is more efficient than previous solutions. Besides, our construction is independent of the encryption method of the remote data and is practical to use in real world applications.

AB - Searchable encryption allows a party to search over encrypted data without decrypting it. Prior schemes in the symmetric setting deal only with exact or similar keyword matches. We describe a scheme for the problem of wildcard searches over encrypted data to make search queries more flexible, provide a security proof for our scheme and com- pare the computational, communication and space complexity with existing schemes. We develop an efficient scheme, using pseudorandom functions and Bloom filters, that supports wildcard searches over encrypted data. The scheme also supports conjunctive wildcard searches, efficient and secure updates and is more efficient than previous solutions. Besides, our construction is independent of the encryption method of the remote data and is practical to use in real world applications.

KW - METIS-278760

KW - IR-77961

KW - Bloom filter

KW - SCS-Cybersecurity

KW - Wildcard

KW - EWI-20436

KW - Searchable Encryption

U2 - 10.1007/978-3-642-23556-6_8

DO - 10.1007/978-3-642-23556-6_8

M3 - Conference contribution

SN - 978-3-642-23555-9

T3 - Lecture Notes in Computer Science

SP - 114

EP - 127

BT - 8th VLDB Workshop on Secure Data Management, SDM 2011

A2 - Petkovic, M.

A2 - Jonker, Willem

A2 - Jonker, W.

PB - Springer

CY - Berlin

T2 - 8th VLDB Workshop on Secure Data Management, SDM 2011

Y2 - 2 September 2011 through 2 September 2011

ER -