SCIENCE CHINA Information Sciences, Volume 63 , Issue 3 : 132102(2020) https://doi.org/10.1007/s11432-019-1509-7

## An enhanced searchable encryption scheme for secure data outsourcing

• AcceptedAug 2, 2019
• PublishedFeb 10, 2020
Share
Rating

### 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.

### Acknowledgment

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 Beijing Municipal Science and Technology Project (Grant Nos. Z191100007119007, Z191100007119002). The authors thank Yang TAO for facilitating many helpful discussions.

### Supplement

Appendixes A and B.

### References

[1] Gentry C, Boneh D. A Fully Homomorphic Encryption Scheme. Stanford: Stanford University, 2009. Google Scholar

[2] 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. Google Scholar

[3] Naveed M. The fallacy of composition of oblivious RAM and searchable encryption. IACR Cryptol ePrint Archive, 2015, 2015: 668. Google Scholar

[4] 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. Google Scholar

[5] 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. Google Scholar

[6] 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. Google Scholar

[7] Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited. J ACM, 2004, 51: 557-594 CrossRef Google Scholar

[8] 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. Google Scholar

[9] 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. Google Scholar

[10] 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. Google Scholar

[11] 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. Google Scholar

[12] 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. Google Scholar

[13] Zhang B, Zhang F G. An efficient public key encryption with conjunctive-subset keywords search. J Network Comput Appl, 2011, 34: 262-267 CrossRef Google Scholar

[14] Miao Y B, Ma J F, Liu X M. VCKSM: Verifiable conjunctive keyword search over mobile e-health cloud in shared multi-owner settings. Pervasive Mobile Computing, 2017, 40: 205-219 CrossRef Google Scholar

[15] 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. Google Scholar

[16] Fang L M, Susilo W, Ge C P. Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Inf Sci, 2013, 238: 221-241 CrossRef Google Scholar

[17] Xu P, Jin H, Wu Q H. Public-Key Encryption with Fuzzy Keyword Search: A Provably Secure Scheme under Keyword Guessing Attack. IEEE Trans Comput, 2013, 62: 2266-2277 CrossRef Google Scholar

[18] 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 CrossRef PubMed Google Scholar

[19] 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 CrossRef Google Scholar

[20] Chen R M, Mu Y, Yang G M. Dual-Server Public-Key Encryption with Keyword Search for Secure Cloud Storage. IEEE TransInformForensic Secur, 2015, : 1-1 CrossRef Google Scholar

[21] Huang Q, Li H B. An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci, 2017, 403-404: 1-14 CrossRef Google Scholar

[22] Jiang P, Mu Y, Guo F C. Private Keyword-Search for Database Systems Against Insider Attacks. J Comput Sci Technol, 2017, 32: 599-617 CrossRef Google Scholar

[23] Sun L X, Xu C X, Zhang M W. Secure searchable public key encryption against insider keyword guessing attacks from indistinguishability obfuscation. Sci China Inf Sci, 2018, 61: 038106 CrossRef Google Scholar

[24] Hwang M S, Hsu S T, Lee C C. A New Public Key Encryption with Conjunctive Field Keyword Search Scheme. ITC, 2014, 43 CrossRef Google Scholar

[25] Lu Y, Wang G, Li J G. On Security of a Secure Channel Free Public Key Encryption with Conjunctive Field Keyword Search Scheme. ITC, 2018, 47 CrossRef Google Scholar

[26] Zhao Z Y, Wang J H. Novel Multi-user Conjunctive Keyword Search Against Keyword Guessing Attacks Under Simple Assumptions. KSII TIIS, 2017, 11 CrossRef Google Scholar

[27] Yang Y, Ma M. Conjunctive Keyword Search with Designated Tester and Timing Enabled Proxy Re-encryption Function for E-health Clouds. IEEE TransInformForensic Secur, 2015, : 1-1 CrossRef Google Scholar

[28] 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. Google Scholar

[29] Chen R M, Mu Y, Yang G M. Server-Aided Public Key Encryption With Keyword Search. IEEE TransInformForensic Secur, 2016, 11: 2833-2842 CrossRef Google Scholar

[30] 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. Google Scholar

[31] 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. Google Scholar

• Figure 1

(Color online) Traditional PEKS system model.

• Figure 2

(Color online) Our SA-SCF-PECKS system model.

• Figure 3

(Color online) Running time of (a) PECKS, (b) PKW, (c) Test, (d) Trapdoor (fixed $m=100$), (e) Trapdoor (fixed $t=5$).

• Table 1   Security comparison of various PECKS schemes
 GSW04 [9] PKL05 [6] CH09 [11] ZZ11 [13] HHL14 [24] YM16 [27] MML17 [14] ZW17 [26] Ours Trapdoor unforgeability $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ Ciphertext anonymity $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ Secure channel free $\times$ $\times$ $\times$ $\times$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ Outside KGA $\checkmark$ $\times$ $\times$ $\times$ $\times$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ Inside KGA $\times$ $\times$ $\times$ $\times$ $\times$ $\times$ $\times$ $\times$ $\checkmark$ Standard model $\times$ $\times$ $\times$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$ $\checkmark$
• Table 21

Citations

• #### 0

Altmetric

Copyright 2020 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有