Paper 2016/553
Storage Efficient Substring Searchable Symmetric Encryption
Iraklis Leontiadis and Ming Li
Abstract
We address the problem of substring searchable encryption. A single user produces a big stream of data and later
on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures
to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring
searchable encryption in order to reduce the storage cost of auxiliary data structures. Our solution entails suffix array which allows optimal storage cost
Metadata
- Available format(s)
- -- withdrawn --
- Publication info
- Preprint. MINOR revision.
- Keywords
- substring searchable encryptionsuffix array
- Contact author(s)
- leontiad @ email arizona edu
- History
- 2016-07-11: withdrawn
- 2016-06-02: received
- See all versions
- Short URL
- https://ia.cr/2016/553
- License
-
CC BY