Authors:
Rolf Haynberg
1
;
Jochen Rill
2
;
Dirk Achenbach
2
and
Jörn Müller-Quade
2
Affiliations:
1
1&1 Internet AG, Germany
;
2
Karlsruhe Institute of Technology (KIT), Germany
Keyword(s):
Searchable Encryption, SSE, Exact Pattern Matching, Directed Acyclic Word Graphs.
Related
Ontology
Subjects/Areas/Topics:
Data and Application Security and Privacy
;
Information and Systems Security
;
Information Assurance
;
Information Hiding
;
Personal Data Protection for Information Systems
;
Security and Privacy in IT Outsourcing
;
Security and Privacy in the Cloud
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.