Advertisement

Verifiable Searchable Encryption with Aggregate Keys for Data Sharing in Outsourcing Storage

  • Tong Li
  • Zheli Liu
  • Ping Li
  • Chunfu Jia
  • Zoe L. Jiang
  • Jin Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9723)

Abstract

In a secure data sharing system, the keyword search over encrypted files is a basic need of a user with appropriate privileges. Although the traditional searchable encryption technique can provide the privacy protection, two critical issues still should be considered. Firstly, a cloud server may be selfish in order to save its computing resources, and thus returns only a fragment of results to reply a search query. Secondly, since different keys are always used for different document sets, making a search query over massive sets and verifying the search results are both impractical for a user with massive keys. In this paper, we propose a scheme named “verifiable searchable encryption with aggregate keys”. In the scheme, a data owner need only distribute a single aggregate key to other users to selectively share both search and verification privileges over his/her document sets. After obtaining such a key, a user can use it not only for generating a single trapdoor as a keyword search query, but for verifying whether the server just conducts a part of computing for the search request. Then, we define the requirements of the scheme and give a valid construction. Finally, our analysis and performance evaluation demonstrate that the scheme are practical and secure.

Keywords

Cloud storage Data sharing Verifiable searchable encryption 

Notes

Acknowledgement

This work was supported by the National Key Basic Research Program of China (No. 2013CB834204), National Natural Science Foundation of China (Nos. 61272423, 61300241, and 61472091), Natural Science Foundation of Guangdong Province for Distinguished Young Scholars (2014A030306020), and Distinguished Young Scholars Fund of Department of Education(No. Yq2013126), Guangdong Province.

References

  1. 1.
    Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Sion, R., Curtmola, R., Dietrich, S., Kiayias, A., Miret, J.M., Sako, K., Sebé, F. (eds.) RLCPS, WECSR, and WLC 2010. LNCS, vol. 6054, pp. 136–149. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Bellare, M., Boldyreva, A., O’Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535–552. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    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 (2012)Google Scholar
  4. 4.
    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
  5. 5.
    Hwang, Y.-H., Lee, P.J.: Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 2–22. Springer, Heidelberg (2007)CrossRefGoogle 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: 2010 Proceedings IEEE INFOCOM, pp. 1–5 (2010)Google Scholar
  7. 7.
    Chai, Q., Gong, G.: Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: 2012 IEEE International Conference on Communications (ICC), pp. 917–922 (2012)Google Scholar
  8. 8.
    Chu, C.-K., Chow, S.S.M., Tzeng, W.-G., Zhou, J., Deng, R.H.: Key-aggregate cryptosystem for scalable data sharing in cloud storage. IEEE Trans. Parallel Distrib. Syst. 25(2), 468–477 (2014)CrossRefGoogle Scholar
  9. 9.
    Cui, B., Liu, Z., Wang, L.: Key-aggregate searchable encryption for group data sharing via cloud storage. IEEE Trans. Comput. PP(99), 1 (2015)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. In: Atluri, V. (ed.) DAS 2008. LNCS, vol. 5094, pp. 127–143. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Liu, X., Zhang, Y., Wang, B., Yan, J.: Mona: secure multi-owner data sharing for dynamic groups in the cloud. IEEE Trans. Parallel Distrib. Syst. 24(6), 1182–1191 (2013)CrossRefGoogle Scholar
  13. 13.
    Shucheng, Y., Wang, C., Ren, K., Lou, W.: Achieving secure, scalable, and fine-grained data access control in cloud computing. In: 2010 Proceedings IEEE INFOCOM, pp. 1–9 (2010)Google Scholar
  14. 14.
    Zheng, Q., Shouhuai, X., Ateniese, G.: Vabks: Verifiable attribute-based keyword search over outsourced encrypted data. In: 2014 Proceedings IEEE, INFOCOM, pp. 522–530 (2014)Google Scholar
  15. 15.
    Sun, W., Yu, S., Lou, W., Hou, T., Li, H.: Protecting your right: Verifiable attribute-based keyword search with fine-grainedowner-enforced search authorization in the cloud. IEEE Trans. Parallel Distrib. Syst. PP(99), 1 (2014)Google Scholar
  16. 16.
    Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111–131. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  17. 17.
    Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 501–512 (2012)Google Scholar
  18. 18.
    Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 844–855 (2014)Google Scholar
  19. 19.
    Lewko, A., Waters, B.: New proof methods for attribute-based encryption: achieving full security through selective techniques. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 180–198. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  20. 20.
    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
  21. 21.
    Oliveira, L.B., Aranha, D.F., Morais, E., Daguano, F., Lopez, J., Dahab, R.: Tinytate: computing the tate pairing in resource-constrained sensor nodes. In: Sixth IEEE International Symposium on Network Computing and Applications, pp. 318–323 (2007)Google Scholar
  22. 22.
    Li, M., Lou, W., Ren, K.: Data security and privacy in wireless body area networks. IEEE Wirel. Commun. 17(1), 51–58 (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Tong Li
    • 1
  • Zheli Liu
    • 1
  • Ping Li
    • 2
  • Chunfu Jia
    • 1
  • Zoe L. Jiang
    • 3
  • Jin Li
    • 4
  1. 1.College of Computer and Control EngineeringNankai UniversityTianjinChina
  2. 2.School of Mathematics and Computational ScienceSun Yat-sen UniversityGuangzhouChina
  3. 3.Harbin Institute of Technology Shenzhen Graduate SchoolShenzhenChina
  4. 4.School of Computer ScienceGuangzhou UniversityGuangzhouChina

Personalised recommendations