Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs

Rolf Haynberg, Jochen Rill, Dirk Achenbach, Jörn Müller-Quade

2013

Abstract

Searchable Encryption schemes allow searching within encrypted data without prior decryption. Various index-based schemes have been proposed in the past, which are only adequate for certain use cases. There is a lack of schemes with exact pattern matching capabilities. We introduce Symmetric Searchable Encryption for Exact Pattern Matching, a new class of searchable encryption schemes. To this end, we define the XPM-SSE primitive and two privacy notions for the new primitive. Our own construction, SEDAWG, is a XPM-SSE scheme which uses Directed Acyclic Word Graphs. We discuss and prove its properties.

Paper Citation

in Harvard Style

Haynberg R., Rill J., Achenbach D. and Müller-Quade J. (2013). Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 403-410. DOI: 10.5220/0004530004030410

in Bibtex Style

@conference{secrypt13,
author={Rolf Haynberg and Jochen Rill and Dirk Achenbach and Jörn Müller-Quade},
title={Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={403-410},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004530004030410},
isbn={978-989-8565-73-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs
SN - 978-989-8565-73-0
AU - Haynberg R.
AU - Rill J.
AU - Achenbach D.
AU - Müller-Quade J.
PY - 2013
SP - 403
EP - 410
DO - 10.5220/0004530004030410