Advertisement

Space-Efficient and Secure Substring Searchable Symmetric Encryption Using an Improved DAWG

  • Hiroaki YamamotoEmail author
  • Yoshihiro Wachi
  • Hiroshi Fujiwara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11821)

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.

Notes

Acknowledgments

This work was supported by JSPS KAKENHI Grant Number JP17K00183.

References

  1. 1.
    Blumer, A., Blumer, J., Haussler, D.: The smallest automaton recognizing the subwords of a text. Theoret. Comput. Sci. 40, 31–55 (1985)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Blumer, A., Blumer, J., Haussler, D., Mcconnell, R.: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 578–595 (1987)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval (Section 8). ACM Press, Addison-Wesley, New York (1999)Google Scholar
  4. 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)Google Scholar
  5. 5.
    Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for Boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-40041-4_20CrossRefGoogle Scholar
  6. 6.
    Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895–934 (2011)CrossRefGoogle Scholar
  7. 7.
    Chase, M., Shen, E.: Substring-searchable symmetric encryption. In: Proceedings on Privacy Enhancing Technologies 2015, vol. 2015, no. 2, pp. 263–281 (2015)CrossRefGoogle Scholar
  8. 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)Google Scholar
  9. 9.
    Faber, S., Jarecki, S., Krawczyk, H., Nguyen, Q., Rosu, M., Steiner, M.: Rich queries on encrypted data: beyond exact matches. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9327, pp. 123–145. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-24177-7_7CrossRefGoogle Scholar
  10. 10.
    Goh, E.-J.: Secure Indexes. Stanford University Technical Report. In: IACR ePrint Cryptography Archive (2003). See http://eprint.iacr.org/2003/216
  11. 11.
    Hacüigumüs, H., Hore, B., Iyer, B., Mehrotra, S.: Search on encrypted data. Adv. Inf. Secur. 33, 383–425 (2007)CrossRefGoogle Scholar
  12. 12.
    Hahn, F., Kerschbaum, F.: Searchable encryption with secure and efficient updates. In: Proceedings of ACM CCS 2014, pp. 310–320 (2014)Google Scholar
  13. 13.
    Hahn, F., Loza, N., Kerschbaum, F.: Practical and secure substring search. In: Proceedings of SIGMOD/PODS 2018, pp. 163–176 (2018)Google Scholar
  14. 14.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory Language and Computation. Addison Wesley, Reading (1979)zbMATHGoogle Scholar
  15. 15.
    Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edn. CRC Press, Boca Raton (2015)Google Scholar
  16. 16.
    Kurosawa, K., Ohtaki, Y.: UC-secure searchable symmetric encryption. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 285–298. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-32946-3_21CrossRefGoogle Scholar
  17. 17.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of ACM CCS 2012, pp. 965–976 (2012) Google Scholar
  18. 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)Google Scholar
  19. 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)Google Scholar
  20. 20.
    Miyoshi, R., Yamamoto, H., Fujiwara, H., Miyazaki, T.: Practical and secure searchable symmetric encryption with a small index. In: Lipmaa, H., Mitrokotsa, A., Matulevičius, R. (eds.) NordSec 2017. LNCS, vol. 10674, pp. 53–69. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-70290-2_4CrossRefGoogle Scholar
  21. 21.
    Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: CryptDB: processing queries on an encrypted database. Commun. ACM 55(9), 103–111 (2012)CrossRefGoogle Scholar
  22. 22.
    Suga, T., Nishide, T., Sakurai, K.: Secure keyword search using bloom filter with specified character positions. In: Takagi, T., Wang, G., Qin, Z., Jiang, S., Yu, Y. (eds.) ProvSec 2012. LNCS, vol. 7496, pp. 235–252. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-33272-2_15CrossRefGoogle Scholar
  23. 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)Google Scholar
  24. 24.
    Strizhov, M., Osman, Z., Ray, I.: Substring position search over encrypted cloud data supporting efficient multi-user setup. Future Internet 8(28), 2016 (2016)Google Scholar
  25. 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)Google Scholar
  26. 26.
    Yamamoto, H.: Secure automata-based substring search scheme on encrypted data. In: Ogawa, K., Yoshioka, K. (eds.) IWSEC 2016. LNCS, vol. 9836, pp. 111–131. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-44524-3_7CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Hiroaki Yamamoto
    • 1
    Email author
  • Yoshihiro Wachi
    • 2
  • Hiroshi Fujiwara
    • 1
  1. 1.Department of Electrical and Computer EngineeringShinshu UniversityNagano-shiJapan
  2. 2.NTT COMWARE CORPORATIONMinato-kuJapan

Personalised recommendations