Abstract
In the cloud environment, where the cloud server cannot always be fully trusted, both data and query privacy should be well protected for secure data outsourcing. Searchable encryption provides a more practical solution to secure data storage while enabling efficient search queries. In this paper, four important problems of public key encryption with keyword search (PEKS), namely, a scheme without secure channels, conjunctive keyword search, (offline) outside and inside keyword guessing attack (full KGA) resistance and proof in the standard model, are considered. We provide an in-depth analysis of the reasons behind (offline) full KGA by considering two types of PEKS schemes as examples. In particular, we introduce the concept of server-aided secure channel free public key encryption with conjunctive keyword search (SA-SCF-PECKS) which can resist (offline) full KGA. Furthermore, we provide a concrete and efficient construction of SA-SCF-PECKS, and prove its security in the standard model. To the best of our knowledge, our proposal is the first PECKS scheme to address these four problems simultaneously. We compare the security and efficiency of our scheme with those of other related PECKS schemes in theoretical and practical ways. In general, compared with other schemes, our SA-SCF-PECKS scheme shows better performance in terms of security and efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gentry C, Boneh D. A Fully Homomorphic Encryption Scheme. Stanford: Stanford University, 2009
Goldreich O. Towards a theory of software protection and simulation by oblivious RAMs. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing. New York: ACM, 1987. 182–194
Naveed M. The fallacy of composition of oblivious RAM and searchable encryption. IACR Cryptol ePrint Archive, 2015, 2015: 668
Boneh D, Di Crescenzo G, Ostrovsky R, et al. Public key encryption with keyword search. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2004. 506–522
Baek J, Safavi-Naini R, Susilo W. Public key encryption with keyword search revisited. In: Proceedings of International Conference on Computational Science and Its Applications. Berlin: Springer, 2008. 1249–1259
Park D J, Kim K, Lee P J. Public key encryption with conjunctive field keyword search. In: Proceedings of International Workshop on Information Security Applications. Berlin: Springer, 2004. 73–86
Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited. J ACM, 2004, 51: 557–594
Rhee H S, Park J H, Susilo W, et al. Improved searchable public key encryption with designated tester. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, Sydney, 2009. 376–379
Golle P, Staddon J, Waters B. Secure conjunctive keyword search over encrypted data. In: Proceedings of International Conference on Applied Cryptography and Network Security. Berlin: Springer, 2004. 31–45
Hwang Y H, Lee P J. Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: Proceedings of International Conference on Pairing-based Cryptography. Berlin: Springer, 2007. 2–22
Chen Y C, Horng G. Timestamped conjunctive keyword-searchable public key encryption. In: Proceedings of the 4th International Conference on Innovative Computing, Information and Control (ICICIC). New York: IEEE, 2009. 729–732
Ryu E K, Takagi T. Efficient conjunctive keyword-searchable encryptio. In: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW’07). New York: IEEE, 2007. 409–414
Zhang B, Zhang F G. An efficient public key encryption with conjunctive-subset keywords search. J Netw Comput Appl, 2011, 34: 262–267
Miao Y B, Ma J F, Liu X M, et al. VCKSM: verifiable conjunctive keyword search over mobile e-health cloud in shared multi-owner settings. Pervasive Mobile Comput, 2017, 40: 205–219
Byun J W, Rhee H S, Park H A, et al. Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Proceedings of Workshop on Secure Data Management. Berlin: Springer, 2006. 75–83
Fang L M, Susilo W, Ge C P, et al. Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Inf Sci, 2013, 238: 221–241
Xu P, ** H, Wu Q H, et al. Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack. IEEE Trans Comput, 2013, 62: 2266–2277
Guo L, Yau W C. Efficient secure-channel free public key encryption with keyword search for EMRs in cloud storage. J Med Syst, 2015, 39: 11
Wang C H, Tu T Y. Keyword search encryption scheme resistant against keyword-guessing attack by the untrusted server. J Shanghai Jiaotong Univ (Sci), 2014, 19: 440–442
Chen R M, Mu Y, Yang G M, et al. Dual-server public-key encryption with keyword search for secure cloud storage. IEEE Trans Inform Forensic Secur, 2015, 11: 789–798
Huang Q, Li H B. An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci, 2017, 403: 1–14
Jiang P, Mu Y, Guo F C, et al. Private keyword-search for database systems against insider attacks. J Comput Sci Technol, 2017, 32: 599–617
Sun L X, Xu C X, Zhang M W, et al. Secure searchable public key encryption against insider keyword guessing attacks from indistinguishability obfuscation. Sci China Inf Sci, 2018, 61: 038106
Hwang M S, Hsu S T, Lee C C. A new public key encryption with conjunctive field keyword search scheme. Inform Tech Control, 2014, 43: 3
Lu Y, Wang G, Li J G. On security of a secure channel free public key encryption with conjunctive field keyword search scheme. Inform Tech Control, 2018, 47: 56–62
Zhao Z Y, Wang J H. Novel multi-user conjunctive keyword search against keyword guessing attacks under simple assumptions. KSII Trans Internet Inform Syst, 2017, 11: 3699–3719
Yang Y, Ma M D. Conjunctive keyword search with designated tester and timing enabled proxy re-encryption function for e-health clouds. IEEE Trans Inform Forensic Secur, 2016, 11: 746–759
Fang L, Susilo W, Ge C, et al. A secure channel free public key encryption with keyword search scheme without random oracle. In: Proceedings of International Conference on Cryptology and Network Security. Berlin: Springer, 2009. 248–258
Chen R M, Mu Y, Yang G M, et al. Server-aided public key encryption with keyword search IEEE Trans Inform Forensic Secur, 2016, 11: 2833–2842
Baek J, Safavi-Naini R, Susilo W. On the integration of public key data encryption and public key encryption with keyword search. In: Proceedings of International Conference on Information Security. Berlin: Springer, 2006. 217–232
Ghadafi E. Efficient round-optimal blind signatures in the standard model. In: Proceedings of International Conference on Financial Cryptography and Data Security. Berlin: Springer, 2017. 455–473
Acknowledgements
This work was supported in part by National Natural Science Foundation of China (Grant Nos. 61632020, 61472416, 61772520, 61802392, 61972094), Key Research Project of Zhejiang Province (Grant No. 2017C01062), and Bei**g Municipal Science and Technology Project (Grant Nos. Z191100007119007, Z191100007119002). The authors thank Yang TAO for facilitating many helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Supplementary File
Rights and permissions
About this article
Cite this article
Zhang, R., Wang, J., Song, Z. et al. An enhanced searchable encryption scheme for secure data outsourcing. Sci. China Inf. Sci. 63, 132102 (2020). https://doi.org/10.1007/s11432-019-1509-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-019-1509-7