Verifiable Searchable Encryption with Aggregate Keys for Data Sharing in Outsourcing Storage
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.
KeywordsCloud storage Data sharing Verifiable searchable encryption
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.
- 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
- 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.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
- 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.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.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
- 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.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
- 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