Multi-user Forward Secure Dynamic Searchable Symmetric Encryption

  • Qiao Wang
  • Yu Guo
  • Hejiao HuangEmail author
  • Xiaohua Jia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11058)


Searchable Symmetric Encryption (SSE) makes it possible to privacy-preserving search over encrypted data stored on an untrusted server. Dynamic SSE schemes add the ability for the user to support secure update of encrypted data records. However, recent attacks show that update information can be exploited to recover the underlying values of ciphertexts. To improve the security, the notion of forward security is proposed, which aims to thwart those attacks by adding new documents without revealing if they match previous search queries. Unfortunately, existing forward secure SSE schemes are mostly for single-user settings, and cannot be easily extended to multi-user settings.

In this paper, we propose a multi-user forward secure dynamic SSE scheme with optimal search complexity. By introducing a semi-trusted proxy server who does not collude with the cloud server, we take a nice method to solve multi-user queries problem in most forward secure SSE schemes. With the help of proxy server who maintains keywords’ state information, our scheme achieves forward security. Our experimental results demonstrate the efficiency of the proposed scheme.


Multi-user Forward security Dynamic searchable symmetric encryption 



This work is financially supported by National Science and Technology Major Project under Grant No. 2016YFB0800804 and No. 2017YFB0803002, National Natural Science Foundation of China under Grant No. 61672195 and No. 61732022.


  1. 1.
    Redis: A key-value store.
  2. 2.
    Bost, R.: Sophos - forward secure searchable encryption. In: Cryptology ePrint Archive, Report 2016/728 (2016)Google Scholar
  3. 3.
    Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Proceedings of ACM CCS (2015)Google Scholar
  4. 4.
    Cash, D., et al.: Dynamic searchable encryption in very large databases: data structures and implementation. In: Proceedings of NDSS (2014)Google Scholar
  5. 5.
    Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). Scholar
  6. 6.
    Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of ACM CCS (2006)Google Scholar
  7. 7.
    Hahn, F., Kerschbaum, F.: Searchable encryption with secure and efficient updates. In: Proceedings of ACM CCS (2014)Google Scholar
  8. 8.
    Islam, M., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: Proceedings of NDSS (2012)Google Scholar
  9. 9.
    Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M., Steiner, M.: Outsourced symmetric private information retrieval. In: Proceedings of ACM CCS (2013)Google Scholar
  10. 10.
    Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258–274. Springer, Heidelberg (2013). Scholar
  11. 11.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of ACM CCS (2012)Google Scholar
  12. 12.
    Kasra Kermanshahi, S., Liu, J.K., Steinfeld, R.: Multi-user cloud-based secure keyword search. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017. LNCS, vol. 10342, pp. 227–247. Springer, Cham (2017). Scholar
  13. 13.
    Lin, W., Yuan, X., Li, B., Wang, C.: Multi-client searchable encryption over distributed key-value stores. In: Proceedings of SMARTCOMP (2017)Google Scholar
  14. 14.
    Naveed, M., Prabhakaran, M., Gunter, C.: Dynamic searchable encryption via blind storage. In: Proceedings of IEEE S&P (2014)Google Scholar
  15. 15.
    Ocansey, S.K., Ametepe, W., Li, X.W., Wang, C.: Dynamic searchable encryption with privacy protection for cloud computing. Int. J. Commun. Syst. 31(1), e3403 (2018)CrossRefGoogle Scholar
  16. 16.
    Pappas, V., et al.: Blind seer: a scalable private DBMS. In: Proceedings of IEEE S&P (2014)Google Scholar
  17. 17.
    Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE S&P (2000)Google Scholar
  18. 18.
    Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable symmetric encryption with small leakage. In: Proceedings of NDSS (2014)Google Scholar
  19. 19.
    Sun, S.-F., Liu, J.K., Sakzad, A., Steinfeld, R., Yuen, T.H.: An efficient non-interactive multi-client searchable encryption with support for boolean queries. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 154–172. Springer, Cham (2016). Scholar
  20. 20.
    Yavuz, A.A., Guajardo, J.: Dynamic searchable symmetric encryption with minimal leakage and efficient updates on commodity hardware. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 241–259. Springer, Cham (2016). Scholar
  21. 21.
    Yuan, X., Yuan, X., Li, B., Wang, C.: Secure multi-client data access with boolean queries in distributed key-value stores. In: Proceedings of CNS (2017)Google Scholar
  22. 22.
    Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: Proceedings of USENIX Security (2016)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceHarbin Institute of Technology Shenzhen Graduate SchoolShenzhenChina
  2. 2.Department of Computer ScienceCity University of Hong KongKowloonHong Kong

Personalised recommendations