Advertisement

Verifiable Dynamic Fuzzy Search Over Encrypted Data in Cloud Computing

  • Xiaoyu Zhu
  • Qin Liu
  • Guojun WangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9530)

Abstract

With the increasing popularity of cloud computing, large scale of documents are being outsourced to the cloud. To avoid information leakage, sensitive files usually have to be encrypted before outsourcing. Thus, it is of great importance to enable an encrypted cloud data search service. Considering the huge amount of data users and documents in the cloud, it is necessary to allow typos in the search request, update documents dynamically and return search results in a verifiable way. Existing solutions support only fuzzy keyword search or verifiable dynamic search, not support verifiable dynamic fuzzy search. In this paper, we first present a verifiable dynamic fuzzy search scheme to address this problem, then prove that our proposed scheme is secure. To the best of our knowledge, this is the first work that achieves verifiable dynamic fuzzy search over encrypted cloud data.

Keywords

Cloud computing Privacy-preserving Fuzzy search Verifiable search Dynamic update 

Notes

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China under Grant Numbers 61272151, 61472451 and 61402161, the International Science & Technology Cooperation Program of China under Grant Number 2013DFB10070, the China Hunan Provincial Science & Technology Program under Grant Number 2012GK4106, and the “Mobile Health” Ministry of Education - China Mobile Joint Laboratory (MOE-DST No. [2012]311).

References

  1. 1.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 2000 IEEE Symposium on Security and Privacy (S&P), pp. 44–55. IEEE (2000)Google Scholar
  2. 2.
    Wang, C., Cao, N., Li, J., Ren, K., Lou, W.: Secure ranked keyword search over encrypted cloud data. In: Distributed Computing Systems (ICDCS), pp. 253–262. IEEE (2010)Google Scholar
  3. 3.
    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
  4. 4.
    Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79–88. ACM (2006)Google Scholar
  5. 5.
    Ning, C., Cong, W., Ming, L., Kui, R., Wenjing, L.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 25(1), 222–233 (2011)Google Scholar
  6. 6.
    Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., Lou, W.: Fuzzy keyword search over encrypted data in cloud computing. In: Infocom, pp. 1–5. IEEE (2010)Google Scholar
  7. 7.
    Chuah, M., Hu, W.: Privacy-aware bedtree based solution for fuzzy multi-keyword search over encrypted data. In: Distributed Computing Systems Workshops (ICDCSW), pp. 273–281. IEEE (2011)Google Scholar
  8. 8.
    Liu, C., Zhu, L., Li, L., Tan, Y.: Fuzzy keyword search on encrypted cloud storage data with small index. In: Cloud Computing and Intelligence Systems (CCIS), pp. 269–273. IEEE (2011)Google Scholar
  9. 9.
    Bing, W., Shucheng, Y., Wenjing, L., Hou, Y.T.: Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: INFOCOM, pp. 2112–2120. IEEE (2014)Google Scholar
  10. 10.
    Wang, J., Ma, H., Tang, Q., Li, J., Zhu, H., Ma, S., Chen, X.: Efficient verifiable fuzzy keyword search over encrypted data in cloud computing. Comput. Sci. Inf. Syst. 10(2), 667–684 (2013)CrossRefGoogle Scholar
  11. 11.
    Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y.T., Li, H.: Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. IEEE Trans. Parallel Distrib. Syst. 25(11), 3025–3035 (2014)CrossRefGoogle Scholar
  12. 12.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965–976. ACM (2012)Google Scholar
  13. 13.
    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) CrossRefGoogle Scholar
  14. 14.
    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) CrossRefGoogle Scholar
  15. 15.
    Kurosawa, K., Ohtaki, Y.: How to update documents verifiably in searchable symmetric encryption. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol. 8257, pp. 309–328. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  16. 16.
    Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)CrossRefzbMATHGoogle Scholar
  17. 17.
    Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604–613. ACM (1998)Google Scholar
  18. 18.
    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) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Information Science and EngineeringCentral South UniversityChangshaChina
  2. 2.School of Information Science and EngineeringHunan UniversityChangshaChina

Personalised recommendations