Skip to main content

Advertisement

Log in

Fine-grained searchable encryption in multi-user setting

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In order to share resources conveniently, users often store their data on remote cloud servers. However, to ensure the security, data will be encrypted when outsourcing to the cloud. This brings some trouble for data search. Searchable encryption allows users to search over the encrypted data on cloud storage to retrieve the interested data without decryption. However, in most of the existing schemes all the encrypted data are treated in the same way. Every user can search for it. In this paper, a fine-grained searchable encryption scheme with two non-colluding cloud servers is proposed. In this scheme, the files can be retrieved if and only if user’s attributes satisfy the access policy and the required keyword agrees with the file keyword. And users can verify whether the cloud server executes the search all over the ciphertexts. Besides, the removed user cannot search again even if he/she colludes with one of the servers.

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

Access this article

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.

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Bao F, Deng R, Ding X, Yang Y (2008) Private query on encrypted data in multi-user settings. In: Chen L, Mu Y, Susilo W (eds) Information security practice and experience. 4th international conference, ISPEC 2008 Sydney, Australia, April 21–23 2008. Springer, pp 71–85

  • Benabbas S, Gennaro R, Vahlis Y (2011) Verifiable delegation of computation over large datasets. In: Rogaway P (ed) Advances in cryptology–CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August14–18, 2011. Proceedings. Springer, pp 111–131

  • Boneh D, Franklin M (2001) Identity-based encryption from the weil pairing. In: Kilian J (ed) Advances in cryptology-CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara,California, USA, August 19–23, 2001. Springer, pp 213–229

  • Cao N, Wang Cong C, Li M, Ren K, Lou W (2014) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222–233

    Article  Google Scholar 

  • Chai Q, Gong G (2012) Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: Communications (ICC), 2012 IEEE international conference on. IEEE, pp 917–922

  • Chang Y, Mitzenmacher M (2005) Privacy preserving keyword searches onremote encrypted data. In: Ioannidis J, Keromytis A, Yung M (eds) Applied cryptography and network security. 3rd international conference, ACNS 2005, New York, NY, USA, June 7–10, 2005. Springer, pp 442–455

  • Chase M, Chow SSM (2009) Privacy-aware attribute-based encryption with user accountability. Springer, Berlin, pp 121–130

    Google Scholar 

  • Chaudhari P, Das M (2015) Privacy-preserving Attribute Based Searchable Encryption. IACR Cryptol ePrint Arch 2015:899

  • Cheng R, Yan J, Guan C, Zhang F, Ren K (2015) Verifiable searchable symmetric encryption from indistinguishability obfuscation. In: Proceedings of the 10th ACM symposium on information, computer and communications security. ACM, pp 621–626

  • Chu C, Chow S, Tzeng W, Zhou J, Deng R (2014) Key-aggregate cryptosystem for scalable data sharing in cloud storage. Parallel Distrib Syst IEEE Trans 25(2):468–477

    Article  Google Scholar 

  • Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM conference on computer and communications security. ACM, pp 79–88

  • Fiore D, Gennaro R (2012) Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM conference on computer and communications security. ACM, pp 501–512

  • Fu Z, Sun X, Liu Q, Zhou L, Shu J (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun 98(1):190–200

    Article  Google Scholar 

  • Gorbunov S, Vaikuntanathan V, Wee H (2015) Attribute-based encryption for circuits. J ACM (JACM) 62(6):45

    Article  MathSciNet  MATH  Google Scholar 

  • Kamara S, Lauter K (2010) Cryptographic cloud storage. In: Sion R, Curtmola R, Dietrich S, Kiayias A, Miret JM, Sako K, Sebé F (eds) Financial cryptography and data security. FC 2010 Workshops, RLCPS, WECSR, and WLC 2010, Tenerife, Canary Islands, Spain, January 25–28, 2010. Springer, pp 136–149

  • Kapadia A, Tsang PP, Smith SW (2007) Attribute-based publishing with hidden credentials and hidden policies. In: The 14th network and distributed system security symposium, NDSS 2007, San Diego, California, USA, 28th February-2nd March, 2007, pp 179–192

  • Kurosawa K (2014) Garbled searchable symmetric encryption. In: Christin N, Safavi-Naini R (eds) Financial cryptography and datasecurity. 18th international conference, FC 2014, Christ Church, Barbados, March 3–7, 2014. Springer, pp 234–251

  • Lai J, Deng RH, Li Y, Weng J (2014) Fully secure key-policy attribute-based encryption with constant-size ciphertexts and fast decryption. Springer, Berlin, pp 239–248

    Google Scholar 

  • Li J, Ren K, Zhu B, Wan Z (2009) Privacy-aware attribute-based encryption with user accountability, vol 5735. Springer, Berlin, pp 347–362

  • Li J, Chen X, Xhafa F, Barolli L (2015) Secure deduplication storage systems supporting keyword search. J Comput Syst Sci 81(8):1532–1541

    Article  MathSciNet  MATH  Google Scholar 

  • Lin H, Cao Z, Liang X, Shao J (2010) Secure threshold multi-authority attribute based encryption without a central authority. Inform Sci 180(13):2618–2632

    Article  MathSciNet  MATH  Google Scholar 

  • Liu P, Wang J, Ma H, Nie H (2014a) Efficient verifiable public key encryption with keyword search based on kp-abe. In: Broadband and wireless computing, communication and applications (BWCCA), 2014 ninth international conference on. IEEE, pp 584–589

  • Liu W, Liu J, Wu Q, Qin B, Zhou Y (2014b) Practical direct chosen ciphertext secure key-policy attribute-based encryption with public ciphertext test, vol 8713. Springer, Berlin, pp 91–108

  • Nishide T, Yoneyama K, Ohta K (2008) Attribute-based encryption with partially hidden encryptor-specified access structures, vol 5037. Springer, Berlin, pp 111–129

  • Okamoto T, Takashima K, Electric M (2012) Adaptively attributehiding (hierarchical) inner product encryption. In: Pointcheval D, Johansson T (eds) Advances in Cryptology–EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15–19, 2012. Springer, pp 591–608

  • Parno B, Raykova M, Vaikuntanathan V (2012) How to delegate and verify in public: verifiable computation from attribute-based encryption, vol 7194. Springer, Berlin, pp 422–439

  • Rajan R, Coimbatore AVVP (2012) Efficient and privacy preserving multi user keyword search for cloud storage services. Int J Adv Technol Eng Res (IJATER) 2(4):48–51

  • Sahai A, Waters B (2005) Fuzzy identity-based encryption, vol 3494. Springer, Berlin, pp 457–473

  • Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: IEEE symposium on security and privacy, 2000. S&P 2000. Proceedings. IEEE, pp 44–55

  • Wang C, Chow S, Wang Q, Ren K, Lou W (2013a) Privacy-preserving public auditing for secure cloud storage. Comput IEEE Trans 62(2):362–375

  • Wang J, Ma H, Tang Q, Li J, Zhu H, Ma S, Chen X (2013b) Efficient verifiable fuzzy keyword search over encrypted data in cloud computing. Comput Sci Inform Syst 10(2):667–684

  • Xia Z, Wang X, Sun X, Wang Q (2016) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340–352

    Article  Google Scholar 

  • Xu B, Peng Z, Xiao F, Gates A, Yu J (2015) Dynamic deployment of virtual machines in cloud computing using multi-objective optimization. Soft Comput 19(8):2265–2273

  • Yang C, Ye J (2015) Secure and efficient fine-grained data access control scheme in cloud computing. J High Speed Netw 21(4):259–271

    Article  Google Scholar 

  • Yang Y, Bao F, Ding X, Deng R (2009) Multiuser private queries over encrypted databases. Int J Appl Cryptogr 1(4):309–319

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang W, Xiao S, Lin Y, Zhou T, Zhou S (2014) Secure ranked multi-keyword search for multiple data owners in cloud computing. In: Dependable systems and networks (DSN), 2014 international conference on 44th annual IEEE/IFIP. IEEE, pp 276–286

  • Zhang D, Zheng K, Zhang T, Wang X (2015) A novel multicast routing method with minimum transmission for wsn of cloud computing service. Soft Comput 19(7):1817–1827

    Article  Google Scholar 

  • Zhao F, Nishide T, SakuraiK(2012) Multi-user keyword search schemefor secure data sharing with fine-grained access control. In: Kim H (ed) Information security and cryptology-ICISC 2011. 14th international conference, Seoul, Korea, November 30-December 2, 2011. Springer, pp 406–418

  • Zheng Q, Xu S, Ateniese G (2013) Vabks: verifiable attribute-based keyword search over outsourced encrypted data. Cryptology ePrint archive, report 2013/462

  • Zheng Q, Xu S, Ateniese G (2014) VABKS: verifiable attribute-based keyword search over outsourced encrypted data. In: 2014 IEEE conference on computer communications, INFOCOM 2014, Toronto, Canada, April 27–May 2, 2014, pp 522–530

Download references

Acknowledgments

This work is supported by the National High Technology Research and Development Program (863 Program) of China (No. 2015AA016007), National Natural Science Foundation of China (No. 61272455), China 111 Project (No. B08038), Doctoral Fund of Ministry of Education of China (No. 20130203110004), Fundamental Research Funds for the Central Universities (No. BDY151402), Program for New Century Excellent Talents in University (No. NCET-13-0946), China Postdoctoral Science Foundation (No. 2015M582619), the CICAEET fund and the PAPD fund.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Ye.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical standard

All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and/or national research committee and with the 1964 Declaration of Helsinki and its later amendments or comparable ethical standards.

Human and animal rights

This article does not contain any studies with animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ye, J., Wang, J., Zhao, J. et al. Fine-grained searchable encryption in multi-user setting. Soft Comput 21, 6201–6212 (2017). https://doi.org/10.1007/s00500-016-2179-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-016-2179-x

Keywords

Navigation