Skip to main content

Advertisement

Springer Nature Link
Log in

Efficient wildcard search over encrypted data

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

Searchable encryption is an important technique that allows the data owners to store their encrypted data in the cloud. It also maintains the ability to search a keyword over encrypted data. In practice, searchable encryption scheme supporting wildcard search is very important and widely used. In this paper, we propose a new wildcard search technique to use one wildcard to represent any number of characters. Based on Bloom filter with a novel specified characters position technique, we construct a new searchable symmetric scheme to support wildcard search over encrypted data. This scheme is more efficient than prior schemes, and it can be strengthened to be secure against an adaptive attacker (CKA-2 security). Moreover, this scheme can be dynamic to support file addition and deletion. Our wildcard search technique is of independent interest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Armbrust, M., Fox, A., Griffith, R., et al.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  2. Suga, S., Nishide, T., Sakurai, K.: Secure keyword search using Bloom filter with specified character positions. In: Proceedings of ProvSec 2012, LNCS 7496, pp. 235–252 (2012)

  3. Bosch, C., Brinkman, R., Hartel, P., Jonker, W.: Conjunctive wildcard search over encrypted data. In: Proceedings of SDM 2011, pp. 114–117(2011)

  4. Goh, E.-J.: Secure indexes. IACR Cryptology ePrint Archive 2003 report 216 (2003). http://eprint.iacr.org/2003/216

  5. Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM 43(3), 431–473 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Song, D., Wagner, D., Perrig, A.: Practical techniques for searching on encrypted data. In: IEEE Symposium on Security and Privacy (SSP), pp. 44–55 (2000)

  7. Chang, Y., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Proceedings of Applied Cryptography and Network Security (ACNS), pp. 442–455 (2005)

  8. Watanabe, C., Arai, Y.: Privacy-preserving queries for a DAS model using encrypted Bloom filter. In: Proceedings of DASFAA 2009. LNCS 5463, pp. 491–495 (2009)

  9. Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: Improved definitions and efficient constructions. In: Proceedings of ACM Conference on Computer and Communications Security (CCS), pp. 79–88 (2006)

  10. Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of ACM Conference on Computer and Communications Security (CCS), pp. 965–976 (2012)

  11. Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Proceedings of Financial Cryptography and Data Security (FC’13), LNCS 7859, pp. 258–274 (2013)

  12. Stefanov, Emil, Papamanthou, Charalampos, Shi, Elaine: Practical Dynamic Searchable Encryption with Small Leakage. NDSS (2014)

  13. Naveed, M., Prabhakaran, M., Gunter, C.A.: Dynamic Searchable Encryption via Blind Storage. IACR Cryptology ePrint Archive 2014 report 219, (2014). https://eprint.iacr.org/2014/219

  14. Cash, D., Jaeger, J., Jarecki, S., et al.: Dynamic searchable encryption in very large databases: data structures and implementation. NDSS (2014)

  15. Sedghi, S., van Liesdonk, P., Nikova, S., Hartel, P., Jonker, W.: Searching keywords with wildcards on encrypted data. In: Proceedings of SCN 2010, LNCS 6280, pp. 138–153 (2010)

  16. Wang, C., Ren, K., Yu, S.: Achieving usable and privacy-assured similarity search over outsourced cloud data. In: Proceedings of IEEE INFOCOM 2012, pp. 451–459 (2012)

  17. Wang, B., Yu, S., Lou, W., Hou, Y.T.: Privacy-Preserving Multi-Keyword Fuzzy Search over Encrypted Data in the Cloud. In IEEE INFOCOM (2014)

Download references

Acknowledgments

This work was supported by China Postdoctoral Science Foundation (No. 2013M532104), 973 program (No. 2013CB834205) and Natural Science Foundation of Zhejiang Province (No. LZ12F02005). Also, we thank the reviewers for their constructive comments.

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Dalian University of Technology, 116024, Dalian, People’s Republic of China

    Changhui Hu

  2. School of Information Science and Engineering, Hangzhou Normal University, 310036, Hangzhou, People’s Republic of China

    Lidong Han

Authors
  1. Changhui Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lidong Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changhui Hu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hu, C., Han, L. Efficient wildcard search over encrypted data. Int. J. Inf. Secur. 15, 539–547 (2016). https://doi.org/10.1007/s10207-015-0302-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-015-0302-0

Keywords