Skip to main content

Fine-Grained, Multi-key Search Control in Multi-user Searchable Encryption

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10658))

Abstract

Searchable encryption schemes support selective retrieval of encrypted data stored in the cloud storage. However, extending this scheme to support diverse set of users to selectively share and retrieve data from the cloud storage still remains as a challenge; it requires managing the access control policies of the users by a third party, the cloud provider. When multiple users are involved, the system needs to ensure that only controlled information is disclosed to a legitimate user and also a dishonest user colluding with the cloud provider cannot leak any thing beyond the granted privileges. The proposed model is designed to support fine grained search control on selected set of documents by authorized users. The system does not require shared keys or expensive trusted third parties. The search complexity is linear to the number of documents that can be accessed by an authorized user and is also secure against the possible leakage due to collusion attack. The security of the system is proved using rigorous security analysis.

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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. J. Cryptogr. Eng. 3(2), 111–128 (2013)

    Article  Google Scholar 

  2. 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 

  3. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586–615 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bouabana-Tebibel, T., Kaci, A.: Parallel search over encrypted data under attribute based encryption on the cloud computing. Comput. Secur. 54, 77–91 (2015)

    Article  Google Scholar 

  5. Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M.C., Steiner, M.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: Network and Distributed System Security Symposium (NDSS 2014) (2014)

    Google Scholar 

  6. Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_30

    Chapter  Google Scholar 

  7. Cui, B., Liu, Z., Wang, L.: Key-aggregate searchable encryption (KASE) for group data sharing via cloud storage. IEEE Trans. Comput. 65(8), 2374–2385 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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 

  9. Granlund, T., et al.: GNU MP 6.0 Multiple Precision Arithmetic Library. Samurai Media Limited, Thames Ditton (2015)

    Google Scholar 

  10. Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Sion, R., Curtmola, R., Dietrich, S., Kiayias, A., Miret, J.M., Sako, K., Sebé, F. (eds.) FC 2010. LNCS, vol. 6054, pp. 136–149. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14992-4_13

    Chapter  Google Scholar 

  11. Lynn, B.: PBC Library (2006). http://crypto.stanford.edu/pbc

  12. Popa, R.A., Zeldovich, N.: Multi-key searchable encryption. IACR Cryptol. ePrint Arch. 2013, 508 (2013)

    Google Scholar 

  13. 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  MATH  Google Scholar 

  14. Zhu, Y., Huang, Z., Takagi, T.: Secure and controllable k-NN query over encrypted cloud data with key confidentiality. J. Parallel Distrib. Comput. 89, 1–12 (2016)

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank College of Engineering Trivandrum for providing facilities to carry out the work and IHRD for sponsoring the research work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manju S. Nair .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nair, M.S., Rajasree, M.S., Thampi, S.M. (2017). Fine-Grained, Multi-key Search Control in Multi-user Searchable Encryption. In: Wang, G., Atiquzzaman, M., Yan, Z., Choo, KK. (eds) Security, Privacy, and Anonymity in Computation, Communication, and Storage. SpaCCS 2017. Lecture Notes in Computer Science(), vol 10658. Springer, Cham. https://doi.org/10.1007/978-3-319-72395-2_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72395-2_73

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72394-5

  • Online ISBN: 978-3-319-72395-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics