Abstract
In a secure query scheme over the encrypted cloud data, an authorized cloud user can obtain data files of interest by submitting encrypted query keywords to the cloud server, which performs a certain secure search algorithm and returns back the corresponding data file set. In practice, the returned query results may be incorrect or incomplete due to possible data corruption, software bugs, or intermediate attackers who maliciously tamper with results; moreover, the cloud server may also intentionally omit some qualified results to save computational resources and communication overhead. Thus, a well-functioning secure query system should provide the query results verification mechanism that allows the data user to verify results. In this paper, we design three varigrained and secure query results verification constructions leveraging the Bloom filter and cryptographic hash functions, for a query result set R, by which the data user can verify: (1) the correctness of each data file in R, (2) how many qualified data files are not returned by the cloud, and (3) which qualified data files are not returned by the cloud, respectively. Furthermore, our proposed verification mechanism can be very easily integrated into all secure query schemes for cloud computing. Performance evaluation shows that the proposed schemes are practical and efficient.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-part computation. In: Proceedings of the 28th ACM Symposium on Theory of Computing (STOC), pp. 639–648. ACM (1996)
Mather, T., Kumaraswamy, S., Latif, S.: Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance. OReilly Media, Sebastopol (2009)
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide area web cache sharing protocol. SIGCOMM Comput. Commun. Rev. 28(4), 254–265 (1998)
Krawczyk, H., Bellare, M., Canetti, R.: HMAC: keyed-hashing for message authentication. RFC 2104 (1997)
Li, J.: Fuzzy keyword search over encrypted data in cloud computing. In: Proceedings of INFOCOM Mini-Conference (2010)
Wang, C., Cao, N., Li, J., Ren, K., Lou, W.: Secure ranked keyword search over encrypted cloud data. In: ICDCS, pp. 253–262 (2010)
Li, M., Yu, S., Cao, N., Lou, W.: Authorized private keyword search over encrypted data in cloud computing. In: Proceedings of the International Conference on Distributed Computing Systems, ICDCS11, pp. 383–392 (2011)
Bellare, M., Rogaway, P.: Introduction to Modern Cryptography. Lecture Notes (2001)
Cao, N., Wang, C., Li, M., Ren, K., Lou, W.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. In: INFOCOM, pp. 829–837 (2011)
Lu, Y.: Privacy-preserving logarithmic-time search on ecnypted data in cloud. In: NDSS (2012)
Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, T., Li, H.: Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. In: ASIACCS (2013)
Wang, B., Yu, S., Lou, W., Hou, Y.T.: Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: Proceedings of IEEE INFOCOM, pp. 2112–2120 (2014)
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)
Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. Cryptology ePrint Archive, Report 2011/587. Springer, Berlin (2011). http://eprint.iacr.org/
Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of ACM CCS, pp. 501–512 (2012)
Wang, C., Cao, N., Ren, K., Lou, W.: Enabling secure and efficient ranked keyword search over outsourced cloud data. IEEE Trans. Parallel Distrib. Syst. 23(8), 1467–1479 (2012)
Zheng, Q.J., Xu, S.H., Ateniese, G.: VABKS: verifiable attribute-based keyword search over outsourced encrypted data. In: Proceedings of IEEE INFOCOM, pp. 522–530 (2014)
Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, T., Li, H.: Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. IEEE Trans. Parallel Distrib. Syst. 25(11), 522–530 (2014)
RFC: Request for Comments Database. http://www.ietf.org/rfc.html
Acknowledgments
The research is supported by the National Natural Science Foundation of China under Grant Nos. 61272546, 61472131, 61402161, 61572181, and 61300218.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Yin, H. et al. (2015). A Secure and Fine-Grained Query Results Verification Scheme for Private Search Over Encrypted Cloud Data. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9530. Springer, Cham. https://doi.org/10.1007/978-3-319-27137-8_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-27137-8_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27136-1
Online ISBN: 978-3-319-27137-8
eBook Packages: Computer ScienceComputer Science (R0)