Abstract
Public key encryption with keyword search plays very important role in the outsourced data management. In most of public key encryption schemes with keyword search, the server can unlimitedly execute keyword search ability after obtaining a trapdoor information of a keyword. To restrict the ability of the server’s unlimited search, we propose a novel public key encryption with revocable keyword search by combining hash chain and anonymous multi-receiver encryption scheme in this paper. The scheme can not only achieve security property of the indistinguishability of ciphertexts against an adaptive chosen keywords attack, but also resist off-line keyword guess attack. By comparison with Yu et al.’s scheme, our scheme is more efficient in terms of computational cost and communication overhead for the whole system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Song, D., Wagner, D., Perrig, A.: Practical techniques for searching on encrypted data, In: Processing of the IEEE Symposium on Research in Security and Privacy. Berkeley, California, USA (2000), 44–55 (2000)
Boneh, D., Crescenzo, G.D., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: EUROCRYPT 2004, LNCS, vol. 3027, Springer: Interlaken, Switzerland, May 2–6 (2004), pp. 506–522
Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. In: Computational Science and Its Applications-ICCSA 2008. Lecture Notes in Computer Science, vol. 5072, pp. 1249–1259 (2008)
Byun, J.W., Rhee, H.S., Park, H.A., Lee, D.H.: Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Jonker, W., Petkovic, M. (eds.) Secure Data Management, LNCS, vol. 4165, pp. 75–83. Springer, Berlin (2006)
Fan, C.I., Huang, L.Y., Ho, P.H.: Anonymous multireceiver ID-based encryption. IEEE Trans. Comput. 59(9), 1239–1249 (2012)
Zhang, B., Zhang, F.G.: An efficient public key encryption with conjunctive-subset keywords search. J. Netw. Comput. Appl. 34(1), 262–267 (2011)
Hu, C., Liu, P.: An enhanced searchable public key encryption scheme with a designated tester and its extensions. J. Comput. 7(3), 716C723 (2012)
Mittelbach, F., Goossens, M.: The LaTeX Companion, 2nd ed. Addison-Wesley, Boston (2004)
Tang, Q., Chen, L.: Public-key encryption with registered keyword search. In: Martinelli, F., Preneel, B. (eds.) EuroPKI, vol. 6391. Lecture Notes in Computer Science, pp. 163–178. Springer, Berlin (2009)
Wang, B.J., Chen, T.H., Jeng, F.G.: Security improvement against malicious servers attack for a dPEKS scheme. Int. J. Inf. Educ. Technol. 1(4), 350–353 (2011)
Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. In: CRYPTO’05 (2005) 350–391
Yu, Y., Ni, J., Yang, H., Mu, Y., Susilo, W.: Efficient public key encryption with revocable keyword search. Secur. Commun. Netw. doi:10.1002/sec.790
Tseng, Y.-M., Huang, Y.-H., Chang, H.-J. Privacy-preserving multireceiver ID-based encryption with provable security. Int. J. Commun. Systems. doi:10.1002/dac.2395
Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Proc. Adv. CryptologyłCrypto, ser. LNCS, vol. 3152. New York: Springer, 2004, pp. 41–45
Acknowledgments
This work was supported by Beijing Municipal Natural Science Foundation (Nos. 4162020, 4132056) and The importation and development of High-Caliber Talents project of Beijing municipal Institutions (CIT&TCD201304004).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, J., Mao, J. Efficient public key encryption with revocable keyword search in cloud computing. Cluster Comput 19, 1211–1217 (2016). https://doi.org/10.1007/s10586-016-0584-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-016-0584-7