Cited By
View all- Li FMa JMiao YLiu XNing JDeng R(2023)A Survey on Searchable Symmetric EncryptionACM Computing Surveys10.1145/361799156:5(1-42)Online publication date: 27-Nov-2023
Space-Efficient and Secure Substring Searchable Symmetric Encryption Using an Improved DAWG
Pages 130 - 148
Abstract
A searchable symmetric encryption (SSE) scheme is a method which searches encrypted data without decrypting it. In this paper, we address the substring search problem such that for a set D of documents and a pattern p, we find all occurrences of p in D. Here a document and a pattern are defined as strings and are encrypted. A directed acyclic word graph (DAWG), which is a deterministic finite automaton, is known for solving a substring search problem on a plaintext. We improve a DAWG so that all transitions of a DAWG have distinct symbols and present a space-efficient and secure substring SSE scheme using an improved DAWG. The novel feature of an improved DAWG is that we can solve the substring search problem using only the labels of transitions. The proposed substring SSE scheme consists of an index with a simple structure and the size is O(n) for the total size n of documents.
References
[1]
Blumer A, Blumer J, and Haussler D The smallest automaton recognizing the subwords of a text Theoret. Comput. Sci. 1985 40 31-55
[2]
Blumer A, Blumer J, Haussler D, and Mcconnell R Complete inverted files for efficient text retrieval and analysis J. ACM 1987 34 3 578-595
[3]
Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval (Section 8). ACM Press, Addison-Wesley, New York (1999)
[4]
Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of CCS 2017, pp. 1465–1482 (2017)
[5]
Cash D, Jarecki S, Jutla C, Krawczyk H, Roşu M-C, and Steiner M Canetti R and Garay JA Highly-scalable searchable symmetric encryption with support for Boolean queries Advances in Cryptology – CRYPTO 2013 2013 Heidelberg Springer 353-373
[6]
Curtmola R, Garay J, Kamara S, and Ostrovsky R Searchable symmetric encryption: improved definitions and efficient constructions J. Comput. Secur. 2011 19 5 895-934
[7]
Chase Melissa and Shen Emily Substring-Searchable Symmetric Encryption Proceedings on Privacy Enhancing Technologies 2015 2015 2 263-281
[8]
Chamani, J.G., Papadopoulos, D., Papamanthou, C., Jalili, R.: New constructions for forward and backward private symmetric searchable encryption. In: Proceedings of CCS 2018, pp. 1038–1055 (2018)
[9]
Faber S, Jarecki S, Krawczyk H, Nguyen Q, Rosu M, and Steiner M Pernul G, Ryan PYA, and Weippl E Rich queries on encrypted data: beyond exact matches Computer Security – ESORICS 2015 2015 Cham Springer 123-145
[10]
Goh, E.-J.: Secure Indexes. Stanford University Technical Report. In: IACR ePrint Cryptography Archive (2003). See http://eprint.iacr.org/2003/216
[11]
Hacüigumüs H, Hore B, Iyer B, and Mehrotra S Search on encrypted data Adv. Inf. Secur. 2007 33 383-425
[12]
Hahn, F., Kerschbaum, F.: Searchable encryption with secure and efficient updates. In: Proceedings of ACM CCS 2014, pp. 310–320 (2014)
[13]
Hahn, F., Loza, N., Kerschbaum, F.: Practical and secure substring search. In: Proceedings of SIGMOD/PODS 2018, pp. 163–176 (2018)
[14]
Hopcroft JE and Ullman JD Introduction to Automata Theory Language and Computation 1979 Reading Addison Wesley
[15]
Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edn. CRC Press, Boca Raton (2015)
[16]
Kurosawa K and Ohtaki Y Keromytis AD UC-secure searchable symmetric encryption FC 2012 2012 Heidelberg Springer 285-298
[17]
Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of ACM CCS 2012, pp. 965–976 (2012)
[18]
Leontiadis, I., Li, M.: Storage efficient substring searchable symmetric encryption. In: Proceedings of the 6th International Workshop on Security in Cloud Computing (SCC 2018), pp. 3–14 (2018)
[19]
Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., Lou, W.: Fuzzy keyword search over encrypted data in cloud computing. In: Proceedings of INFCOM 2010, pp. 441–445 (2010)
[20]
Miyoshi R, Yamamoto H, Fujiwara H, and Miyazaki T Lipmaa H, Mitrokotsa A, and Matulevičius R Practical and secure searchable symmetric encryption with a small index Secure IT Systems 2017 Cham Springer 53-69
[21]
Popa RA, Redfield CMS, Zeldovich N, and Balakrishnan H CryptDB: processing queries on an encrypted database Commun. ACM 2012 55 9 103-111
[22]
Suga T, Nishide T, and Sakurai K Takagi T, Wang G, Qin Z, Jiang S, and Yu Y Secure keyword search using bloom filter with specified character positions Provable Security 2012 Heidelberg Springer 235-252
[23]
Strizhov, M., Ray, I.: Substring position search over encrypted cloud data using tree-based index. In: Proceedings of IEEE IC2E 2015, pp. 165–174 (2015)
[24]
Strizhov M, Osman Z, and Ray I Substring position search over encrypted cloud data supporting efficient multi-user setup Future Internet 2016 8 28 2016
[25]
Song, D.X., Wagner, D., Perrig, A.: Techniques for searchers on encrypted data. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 44–55 (2000)
[26]
Yamamoto H Ogawa K and Yoshioka K Secure automata-based substring search scheme on encrypted data Advances in Information and Computer Security 2016 Cham Springer 111-131
Index Terms
- Space-Efficient and Secure Substring Searchable Symmetric Encryption Using an Improved DAWG
Index terms have been assigned to the content through auto-classification.
Recommendations
Deniable Searchable Symmetric Encryption
In the recent years, Searchable Symmetric Encryption (SSE) has become one of the hottest topic in cloud-computing area because of its availability and flexibility, and there are a series of SSE schemes were proposed. The adversary considered in these ...
Storage Efficient Substring Searchable Symmetric Encryption
SCC '18: Proceedings of the 6th International Workshop on Security in Cloud ComputingWe 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 ...
Comments
Information & Contributors
Information
Published In
Oct 2019
384 pages
© Springer Nature Switzerland AG 2019.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 October 2019
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Dec 2024
Other Metrics
Citations
Cited By
View all- Li FMa JMiao YLiu XNing JDeng R(2023)A Survey on Searchable Symmetric EncryptionACM Computing Surveys10.1145/361799156:5(1-42)Online publication date: 27-Nov-2023