Skip to main content

Towards Realizing Authorized Encrypted Search with Designed Access Policy

  • Conference paper
  • First Online:
  • 814 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11933))

Abstract

Searchable encryption enables users to search the encrypted data outsourced in a third party. Recently, to serve a wide scenario of data sharing application, multi-user searchable encryption (MUSE) is proposed to realize the encrypted data search for multiple users. In this paper, we concentrate on addressing the authorized keyword search problem for a team with fixed unauthorized members and propose a novel puncture public key encryption with keyword search (PPEKS) scheme with designed access policy. Compared with the existing schemes, our proposal has the following features: our scheme supports team authorized search rather than single-user authorization; the data owner only needs one encrypted copy for all authorized members which is one copy one user in traditional MUSE schemes. In addition, we also conduct a rigorous security analysis on our scheme and make a functional comparison of our scheme with other MUSE schemes. Finally, we perform comprehensive efficiency evaluations on a laptop.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. 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). https://doi.org/10.1007/978-3-540-79104-1_6

    Chapter  Google Scholar 

  2. 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. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_20

    Chapter  Google Scholar 

  3. Cui, J., Zhou, H., Zhong, H., Xu, Y.: Attribute-based keyword search with efficient revocation in cloud computing. Inf. Sci. 423, 343–352 (2018)

    Article  Google Scholar 

  4. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of CCS 2006, pp. 79–88. ACM (2006)

    Google Scholar 

  5. Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. J. Comput. Secur. 19(3), 367–397 (2011)

    Article  Google Scholar 

  6. Goh, E.: Secure indexes. Cryptology ePrint Archieve, Report 2003/216 (2003). http://eprint.iacr.org/2003/216

  7. Green, M.D., Miers, I.: Forward secure asynchronous messaging from puncturable encryption. In: Proceedings of Symposium on Security and Privacy 2015, pp. 305–320. IEEE Computer Society (2015)

    Google Scholar 

  8. Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of CCS 2012, pp. 965–976. ACM (2012)

    Google Scholar 

  9. Liu, X., Yang, G., Mu, Y., Deng, R.: Multi-user verifiable searchable symmetric encryption for cloud storage. IEEE TDSC (2018)

    Google Scholar 

  10. Liu, Z., Wang, Z., Cheng, X., Jia, C., Yuan, K.: Multi-user searchable encryption with coarser-grained access control in hybrid cloud. In: Fourth International Conference on Emerging Intelligent Data and Web Technologies, pp. 249–255. IEEE Computer Society (2013)

    Google Scholar 

  11. Ostrovsky, R., Sahai, A., Waters, B.: Attribute-based encryption with non-monotonic access structures. In: Proceedings of CCS 2007, pp. 195–203. ACM (2007)

    Google Scholar 

  12. Sharma, D., Jinwala, D.C.: Multiuser searchable encryption with token freshness verification. Secur. Commun. Netw. 2017, 6435138:1–6435138:16 (2017)

    Google Scholar 

  13. Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of SSP 2000, pp. 44–55. IEEE Computer Society (2000)

    Google Scholar 

  14. Sun, W., Yu, S., Lou, W., Hou, Y.T., Li, H.: Protecting your right: Verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans. Parallel Distrib. Syst. 27(4), 1187–1198 (2016)

    Article  Google Scholar 

  15. Tang, Q.: Nothing is for free: Security in searching shared and encrypted data. IEEE Trans. Inf. Forensics Secur. 9(11), 1943–1952 (2014)

    Article  Google Scholar 

  16. Xu, X., Weng, C.Y., Yuan, L.P., Wu, M.E., Tso, R., Sun, H.M.: A shareable keyword search over encrypted data in cloud computing. J. Supercomput. 74(3), 1001–1023 (2018)

    Article  Google Scholar 

  17. Zhang, W., Lin, Y., Xiao, S., Wu, J., Zhou, S.: Privacy preserving ranked multi-keyword search for multiple data owners in cloud computing. IEEE Trans. Comput. 65(5), 1566–1577 (2016)

    Article  MathSciNet  Google Scholar 

  18. Zhao, F., Nishide, T., Sakurai, K.: Multi-user keyword search scheme for secure data sharing with fine-grained access control. In: Kim, H. (ed.) ICISC 2011. LNCS, vol. 7259, pp. 406–418. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31912-9_27

    Chapter  Google Scholar 

Download references

Acknowledgment

This work is partially supported by the Fundamental Research Funds for the Central Universities (No. 30918012204) and Postgraduate Research & Practice Innovation Program of Jiangsu Province (KYCX18_0378).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chungen Xu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mei, L., Xu, C., Xu, L., Liu, Z., Yu, X., Yao, Z. (2019). Towards Realizing Authorized Encrypted Search with Designed Access Policy. In: Liu, F., Xu, J., Xu, S., Yung, M. (eds) Science of Cyber Security. SciSec 2019. Lecture Notes in Computer Science(), vol 11933. Springer, Cham. https://doi.org/10.1007/978-3-030-34637-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34637-9_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34636-2

  • Online ISBN: 978-3-030-34637-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics