Abstract
Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data contents. It offers a perfect cryptographic solution to encrypted data retrieval in encrypted data storage systems. Certificateless cryptography (CLC) is a novel cryptographic primitive that has many merits. It overcomes the key escrow problem in identity-based cryptosystems and the cumbersome certificate problem in conventional public key cryptosystems. Motivated by the appealing features of CLC, three certificateless encryption with keyword search (CLEKS) schemes were presented in the literature. However, all of them were constructed with the costly bilinear pairing and thus are not suitable for the devices that have limited computing resources and battery power. So, it is interesting and worthwhile to design a CLEKS scheme without using bilinear pairing. In this study, we put forward a pairing-free CLEKS scheme that does not exploit bilinear pairing. We strictly prove that the scheme achieves keyword ciphertext indistinguishability against adaptive chosen-keyword attacks under the complexity assumption of the computational Diffie-Hellman problem in the random oracle model. Efficiency comparison and the simulation show that it enjoys better performance than the previous pairing-based CLEKS schemes. In addition, we briefly introduce three extensions of the proposed CLEKS scheme.
Similar content being viewed by others
References
Abdalla M, Bellare M, Catalano D, et al., 2008. Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J Cryptol, 21(3):350–391. https://doi.org/10.1007/s00145-007-9006-6
Al-Riyami SS, Paterson KG, 2003. Certificateless public key cryptography. Proc 9th Int Conf on the Theory and Application of Cryptology and Information Security, p.452–473. https://doi.org/10.1007/978-3-540-40061-5_29
Baek J, Safavi-Naini R, Susilo W, 2008. Public key encryption with keyword search revisited. Proc 7th Int Conf on Computational Science and Its Applications, p.1249–1259. https://doi.org/10.1007/978-3-540-69839-5_96
Bellare M, Rogaway P, 1993. Random oracles are practical: a paradigm for designing efficient protocols. Proc 1st ACM Conf on Computer and Communications Security, p.62–73. https://doi.org/10.1145/168588.168596
Boneh D, di Crescenzo G, Ostrovsky R, et al., 2004. Public key encryption with keyword search. Proc Int Conf on the Theory and Applications of Cryptographic Techniques, p.506–522. https://doi.org/10.1007/978-3-540-24676-3_30
Byun JW, Lee DH, Lim J, 2006. Efficient conjunctive keyword search on encrypted data storage system. Proc 3rd European PKI Workshop, p.184–196. https://doi.org/10.1007/11774716_15
Canetti R, Goldreich O, Halev S, 2004. The random Oracle methodology, revisited. J ACM, 51(4):557–594. https://doi.org/10.1145/1008731.1008734
Dong QX, Guan Z, Wu L, et al., 2013. Fuzzy keyword search over encrypted data in the public key setting. Proc 14th Int Conf on Web-Age Information Management, p.729–740. https://doi.org/10.1007/978-3-642-38562-9_74
Fang LM, Susilo W, Ge P, et al., 2009. A secure channel free public key encryption with keyword search scheme without random oracle. Proc 8th Int Conf on Cryptology and Network Security, p.248–258. https://doi.org/10.1007/978-3-642-10433-6_16
Fu ZJ, Sun XM, Liu Q, et al., 2015. Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun, E98.B(1):190–200. https://doi.org/10.1587/transcom.E98.B.190
Fu ZJ, Ren K, Shu JG, et al., 2016. Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans Parall Distrib Syst, 27(9): 2546–2559. https://doi.org/10.1109/TPDS.2015.2506573
Golle P, Staddon J, Waters B, 2004. Secure conjunctive keyword search over encrypted data. Proc 2nd Int Conf on Applied Cryptography and Network Security, p.31–45. https://doi.org/10.1007/978-3-540-24852-1_3
Guo LF, Yau WC, 2015. Efficient secure-channel free public key encryption with keyword search for EMRs in cloud storage. J Med Syst, 39(2):1–11. https://doi.org/10.1007/s10916-014-0178-y
Hu CY, Liu PT, 2012. An enhanced searchable public key encryption scheme with a designated tester and its extensions. J Comput, 7(3):706–715.
Hwang YH, Lee PJ, 2007. Public key encryption with conjunctive keyword search and its extension to a multi-user system. Proc 1st Int Conf on Pairing-Based Cryptography, p.2–22. https://doi.org/10.1007/978-3-540-73489-5_2
Islam SH, Obaidat MS, Rajeev V, et al., 2017. Design of a certificateless designated server based searchable public key encryption scheme. Proc 3rd Int Conf on Mathematics and Computing, p.3–15. https://doi.org/10.1007/978-981-10-4642-1_1
Li JG, Lin XN, Zhang YC, et al., 2017a. KSF-OABE: outsourced attribute-based encryption with keyword search function for cloud storage. IEEE Trans Serv Comput, 10(5):715–725. https://doi.org/10.1109/TSC.2016.2542813
Li JG, Shi YR, Zhang YC, 2017b. Searchable ciphertextpolicy attribute-based encryption with revocation in cloud storage. Int J Commun Syst, 30(1):1–13. https://doi.org/10.1002/dac.2942
Liu JN, Lai JZ, Huang XY, 2017. Dual trapdoor identity-based encryption with keyword search. Soft Comput, 21(10): 2599–2607. https://doi.org/10.1007/s00500-015-1960-6
Lu Y, Wang G, Li JG, et al., 2017. Efficient designated server identity-based encryption with conjunctive keyword search. Ann Telecommun, 72(5-6):359–370. https://doi.org/10.1007/s12243-017-0574-7
Lv ZQ, Hong C, Zhang M, et al., 2014. Expressive and secure searchable encryption in the public key setting. Proc 17th Int Conf on Information Security, p.364–376. https://doi.org/10.1007/978-3-319-13257-0_21
MIRACL Ltd., 2012. MIRACL Cryptographic SDK: Multiprecision Integer and Rational Arithmetic Cryptographic Library. https://github.com/miracl/MIRACL
Park DJ, Kim K, Lee PJ, 2004. Public key encryption with conjunctive field keyword search. Proc 5th Int Workshop on Information Security Applications, p.73–86. https://doi.org/10.1007/978-3-540-31815-6_7
Peng YG, Cui JT, Peng CG, et al., 2014. Certificateless public key encryption with keyword search. China Commun, 11(11):100–113. https://doi.org/10.1109/CC.2014.7004528
Rhee HS, Park JH, Susilo W, et al., 2010. Trapdoor security in a searchable public-key encryption scheme with a designated tester. J Syst Softw, 83(5):763–771. https://doi.org/10.1016/j.jss.2009.11.726
Shamir A, 1984. Identity-based cryptosystems and signature schemes. Proc 1st Workshop on the Theory and Application of Cryptographic Techniques, p.47–53. https://doi.org/10.1007/3-540-39568-7_5
Shao ZY, Yang B, 2015. On security against the server in designated tester public key encryption with keyword search. Inform Process Lett, 115(12):957–961. https://doi.org/10.1016/j.ipl.2015.07.006
Shi J, Lai JZ, Li YJ, et al., 2014. Authorized keyword search on encrypted data. Proc 1st European Symp on Research in Computer Security, p.419–435. https://doi.org/10.1007/978-3-319-11203-9_24
Siad A, 2012. Anonymous identity-based encryption with distributed private-key generator and searchable encryption. Proc 5th Int Conf on New Technologies, Mobility and Security, p.1–8. https://doi.org/10.1109/NTMS.2012.6208695
Song DX, Wagner D, Perrig A, 2000. Practical techniques for searches on encrypted data. Proc IEEE Symp on Security and Privacy, p.44–55. https://doi.org/10.1109/SECPRI.2000.848445
Standards for Efficient Cryptography Group, 2000. SEC 2: Recommended Elliptic Curve Domain Parameters, Version 1.0. http://www.secg.org/SEC2-Ver-1.0.pdf
Sun WH, Yu SC, Lou WJ, et al., 2016. Protecting your right: verifiable attribute-based keyword search with finegrained owner-enforced search authorization in the cloud. IEEE Trans Parall Distrib Syst, 27(4):1187–1198. https://doi.org/10.1109/TPDS.2014.2355202
Tian XX, Wang Y, 2008. ID-based encryption with keyword search scheme from bilinear pairings. Proc 4th Int Conf on Wireless Communications, Networking and Mobile Computing, p.1–4. https://doi.org/10.1109/WiCom.2008.2916
Tomida K, Doi H, Mohri M, et al., 2015. Ciphertext divided anonymous HIBE and its transformation to identity-based encryption with keyword search. J Inform Process, 23(5): 562–569. https://doi.org/10.2197/ipsjjip.23.562
Wang XF, Mu Y, Chen RM, et al., 2016. Secure channel free ID-based searchable encryption for peer-to-peer group. J Comput Sci Technol, 31(5):1012–1027. https://doi.org/10.1007/s11390-016-1676-9
Wu TY, Tsai TT, Tseng YM, 2014. Efficient searchable IDbased encryption with a designated server. Ann Telecomm, 69(7-8):391–402. https://doi.org/10.1007/s12243-013-0398-z
Zhang B, Zhang FG, 2011. An efficient public key encryption with conjunctive-subset keywords search. J Netw Comput Appl, 34(1):262–267. https://doi.org/10.1016/j.jnca.2010.07.007
Zheng QJ, Xu SH, Ateniese G, 2014. VABKS: verifiable attribute-based keyword search over outsourced encrypted data. Proc IEEE INFOCOM, p.522–530. https://doi.org/10.1109/INFOCOM.2014.6847976
Zheng QJ, Li XX, Azgin A, 2015. CLKS: certificateless keyword search on encrypted data. Proc 9th Int Conf on Network and System Security, p.239–253. https://doi.org/10.1007/978-3-319-25645-0_1
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Yang LU and Ji-guo LI declare that they have no conflict of interest.
Additional information
Project supported by the National Natural Science Foundation of China (Nos. 61772009 and U1736112), the Fundamental Research Funds for the Central Universities, China (Nos. 2016B10114 and 2017B17014), and the Natural Science Foundation of Jiangsu Province, China (No. BK20181304)
Rights and permissions
About this article
Cite this article
Lu, Y., Li, Jg. Constructing pairing-free certificateless public key encryption with keyword search. Frontiers Inf Technol Electronic Eng 20, 1049–1060 (2019). https://doi.org/10.1631/FITEE.1700534
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/FITEE.1700534
Key words
- Searchable public key encryption
- Certificateless public key encryption with keyword search
- Bilinear pairing
- Computational Diffie-Hellman problem