학술논문
Symmetric searchable encryption for exact pattern matching using directed Acyclic Word Graphs
Document Type
Conference
Source
2013 International Conference on Security and Cryptography (SECRYPT) Security and Cryptography (SECRYPT), 2013 International Conference on. :1-8 Jul, 2013
Subject
Language
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.