An Efficient Non-interactive Multi-client Searchable Encryption with Support for Boolean Queries

  • Shi-Feng Sun
  • Joseph K. Liu
  • Amin Sakzad
  • Ron Steinfeld
  • Tsz Hon Yuen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9878)

Abstract

Motivated by the recent searchable symmetric encryption protocol of Cash et al., we propose a new multi-client searchable encryption protocol in this work. By tactfully leveraging the RSA-function, our protocol avoids the per-query interaction between the data owner and the client, thus reducing the communication overhead significantly and eliminating the need of the data owner to provide the online services to clients at all times. Furthermore, our protocol manages to protect the query privacy of clients to some extent, meaning that our protocol hides the exact queries from the data owner. In terms of the leakage to server, it is exactly the same as Cash et al., thus achieving the same security against the adversarial server. In addition, by employing attribute-based encryption technique, our protocol also realizes the fine-grained access control on the stored data. To be compatible with our RSA-based approach, we also present a deterministic and memory-efficient ‘keyword to prime’ hash function, which may be of independent interest.

Keywords

Cloud storage Searchable encryption Non-interaction Multi-client RSA function 

References

  1. 1.
    Asghar, M.R., Russello, G., Crispo, B., Ion, M.: Supporting complex queries and access policies for multi-user encrypted databases. In: CCSW 2013, Berlin, Germany, 4 November, pp. 77–88 (2013)Google Scholar
  2. 2.
    Baek, J., Vu, Q.H., Liu, J.K., Huang, X., Xiang, Y.: A secure cloud computing based framework for big data information management of smart grid. IEEE Trans. Cloud Comput. 3(2), 233–244 (2015)CrossRefGoogle Scholar
  3. 3.
    Bao, F., Deng, R.H., Ding, X., Yang, Y.: Private query on encrypted data in multi-user settings. In: Chen, L., Mu, Y., Susilo, W. (eds.) ISPEC 2008. LNCS, vol. 4991, pp. 71–85. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: IEEE S&P 2007, Oakland, California, USA, 20–23 May 2007, pp. 321–334 (2007)Google Scholar
  5. 5.
    Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS 2014, San Diego, California, USA, 23–26 February 2014Google Scholar
  7. 7.
    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, Part I. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  8. 8.
    Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577–594. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Chu, C., Zhu, W.T., Han, J., Liu, J.K., Xu, J., Zhou, J.: Security concerns in popular cloud storage services. IEEE Pervasive Comput. 12(4), 50–57 (2013)CrossRefGoogle Scholar
  10. 10.
    Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. In: ACM CCS 1999, Singapore, 1–4 November 1999, pp. 46–51 (1999)Google Scholar
  11. 11.
    Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: ACM CCS 2006, Alexandria, VA, USA, 30 October–3 November 2006, pp. 79–88 (2006)Google Scholar
  12. 12.
    Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. In: Atluri, V. (ed.) DAS 2008. LNCS, vol. 5094, pp. 127–143. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signatures without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123–139. Springer, Heidelberg (1999)Google Scholar
  14. 14.
    Goh, E.: Secure indexes. IACR Cryptology ePrint Archive, 2003:216 (2003)Google Scholar
  15. 15.
    Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31–45. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M., Steiner, M.: Outsourced symmetric private information retrieval. In: ACM CCS 2013, pp. 875–888. ACM (2013)Google Scholar
  17. 17.
    Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: FC 2013, Okinawa, Japan, 1–5 April 2013, pp. 258–274 (2013)Google Scholar
  18. 18.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: ACM CCS 2012, Raleigh, NC, USA, 16–18 October 2012, pp. 965–976 (2012)Google Scholar
  19. 19.
    Kurosawa, K., Ohtaki, Y.: UC-secure searchable symmetric encryption. In: FC 2012, Kralendijk, Bonaire, 27 Februray–2 March 2012, pp. 285–298 (2012)Google Scholar
  20. 20.
    Liang, K., Au, M.H., Liu, J.K., Susilo, W., Wong, D.S., Yang, G., Phuong, T.V.X., Xie, Q.: A dfa-based functional proxy re-encryption scheme for secure public cloud data sharing. IEEE Trans. Inf. Forensics Secur. 9(10), 1667–1680 (2014)CrossRefGoogle Scholar
  21. 21.
    Liang, K., Liu, J.K., Wong, D.S., Susilo, W.: An efficient cloud-based revocable identity-based proxy re-encryption scheme for public clouds data sharing. In: Kutyłowski, M., Vaidya, J. (eds.) ICAIS 2014, Part I. LNCS, vol. 8712, pp. 257–272. Springer, Heidelberg (2014)Google Scholar
  22. 22.
    Liang, K., Susilo, W., Liu, J.K.: Privacy-preserving ciphertext multi-sharing control for big data storage. IEEE Trans. Inf. Forensics Secur. 10(8), 1578–1589 (2015)CrossRefGoogle Scholar
  23. 23.
    Liu, J., Huang, X., Liu, J.K.: Secure sharing of personal health records in cloud computing: ciphertext-policy attribute-based signcryption. Future Gener. Comp. Syst. 52, 67–76 (2015)CrossRefGoogle Scholar
  24. 24.
    Liu, J.K., Liang, K., Susilo, W., Liu, J., Xiang, Y.: Two-factor data security protection mechanism for cloud storage system. IEEE Trans. Comput. 65(6), 1992–2004 (2016)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Miller, G.L.: Riemann’s hypothesis and tests for primality. J. Comput. Syst. Sci. 13(3), 300–317 (1976)CrossRefMATHGoogle Scholar
  26. 26.
    Naveed, M., Prabhakaran, M., Gunter, C.A.: Dynamic searchable encryption via blind storage. In: IEEE SP 2014, Berkeley, CA, USA, 18–21 May 2014, pp. 639–654 (2014)Google Scholar
  27. 27.
    Popa, R.A., Zeldovich, N.: Multi-key searchable encryption. IACR Cryptology ePrint Archive 2013:508 (2013)Google Scholar
  28. 28.
    Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theor. 12(1), 128–138 (1980)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    Raykova, M., Vo, B., Bellovin, S.M., Malkin, T.: Secure anonymous database search. In: CCSW 2009, Chicago, IL, USA, 13 November 2009, pp. 115–126 (2009)Google Scholar
  30. 30.
    Van Rompay, C., Molva, R., Önen, M.: Multi-user searchable encryption in the cloud. In: López, J., Mitchell, C.J. (eds.) ISC 2015. LNCS, vol. 9290, pp. 299–316. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  31. 31.
    Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, New York (2008). Also available on the InternetCrossRefMATHGoogle Scholar
  32. 32.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE S&P 2000, Berkeley, California, USA, 14–17 May 2000, pp. 44–55 (2000)Google Scholar
  33. 33.
    Yang, Y., Lu, H., Weng, J.: Multi-user private keyword search for cloud computing. In: CloudCom 2011, Athens, Greece, 29 November–1 December 2011, pp. 264–271 (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Shi-Feng Sun
    • 1
  • Joseph K. Liu
    • 2
  • Amin Sakzad
    • 2
  • Ron Steinfeld
    • 2
  • Tsz Hon Yuen
    • 3
  1. 1.Shanghai Jiao Tong UniversityShanghaiChina
  2. 2.Faculty of Information TechnologyMonash UniversityMelbourneAustralia
  3. 3.HuaweiSingaporeSingapore

Personalised recommendations