Skip to main content
SpringerLink
Log in

Public-key encryption with keyword search: a generic construction secure against online and offline keyword guessing attacks

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

In public-key setting, the problem of searching for keywords in encrypted data is handled by the   notion of  public-key encryption with keyword search (PEKS). An important challenge in designing secure PEKS schemes is providing resistance against variants of  an  attack  known as the keyword  guessing  attack (KGA). Basically, by KGA, an adversary is able to determine the searched keyword through using the data communicated in the search process. Security against offline KGA performed by both inside/outside adversaries is well-studied in the literature. However, this is not true about the online version. In this paper, we employ a technique called ciphertext re-randomization to propose a generic construction for designing PEKS schemes which are secure against both online and offline KGAs performed by outsiders. We show that compared to existing literature, our construction is more efficient in terms of computational and communication costs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing, ACM, New York, NY, USA, STOC ’96, pp 99–108

  • Behnia R, Ozmen MO, Yavuz AA (2018) Lattice-based public key searchable encryption from experimental perspectives. IEEE Transactions on Dependable and Secure Computing (in press)

  • Blazy O, Fuchsbauer G, Pointcheval D, Vergnaud D (2011) Signatures on randomizable ciphertexts. In: Proceedings of the 14th international conference on practice and theory in public key cryptography, Italy, Springer Berlin Heidelberg, pp 403–422

    Chapter  Google Scholar 

  • Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: Proceedings of international conference on the theory and applications of cryptographic techniques, Switzerland, Advances in Cryptology—EUROCRYPT 2004, Springer, Berlin Heidelberg, pp 506–522

    Chapter  Google Scholar 

  • Bösch C, Tang Q, Hartel P, Jonker W (2012) Selective document retrieval from encrypted database. In: Proceedings of the 15th international conference, Information Security, Germany, Springer Berlin Heidelberg, pp 224–241

    Google Scholar 

  • Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring—LWE and security for key dependent messages. In: Advances in cryptology—CRYPTO 2011. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 505–524

    Chapter  Google Scholar 

  • Byun JW, Rhee HS, Park HA, Lee DH (2006) Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Proceedings of the third VLDB workshop, secure data management, Korea, Springer Berlin Heidelberg, pp 75–83

    Google Scholar 

  • Chase M, Kohlweiss M, Lysyanskaya A, Meiklejohn S (2013) Verifiable elections that scale for free. In: Proceedings of the 16th international conference on practice and theory in public-key cryptography, Japan, Springer Berlin Heidelberg, pp 479–496

    Chapter  Google Scholar 

  • Chen YC (2015) SPEKS: secure server-designation public key encryption with keyword search against keyword guessing attacks. Comput J 58(4):922–933

    Article  Google Scholar 

  • Curtmola R, Garay J, Kamara S, Ostrovsky R (2011) Searchable symmetric encryption: improved definitions and efficient constructions. J Comput Secur 19(5):895–934

    Article  Google Scholar 

  • Gu C, Zheng Y, Kang F, Xin D (2015) Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Cloud computing and big data. Springer International Publishing, Cham, pp 335–343

    Chapter  Google Scholar 

  • Huang Q, Li H (2017) An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inform Sci 403:1–14

    Article  Google Scholar 

  • Hwang YH, Lee PJ (2007) Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: Proceedings of pairing 2007, LNCS, Springer, vol 4575, pp 2–22

  • Izabachène M, Pointcheval D, Vergnaud D (2010) Mediated traceable anonymous encryption. In: Proceedings of the first international conference on cryptology and information security in Latin America, Mexico, Progress in Cryptology—LATINCRYPT, Springer Berlin Heidelberg, pp 40–60

    Google Scholar 

  • Jeong IR, Kwon JO, Hong D, Lee DH (2009) Constructing PEKS schemes secure against keyword guessing attacks is possible? Comput Commun 32(2):394–396

    Article  Google Scholar 

  • Kiraz MS (2016) A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing. J Ambient Intell Hum Comput 7(5):731–760

    Article  Google Scholar 

  • Kiyomoto S, Fukushima K, Miyake Y (2014) Security issues on IT systems during disasters: a survey. J Ambient Intell Hum Comput 5(2):173–185

    Article  Google Scholar 

  • Li CT, Lee CW, Shen JJ (2015) An extended chaotic maps-based keyword search scheme over encrypted data resist outside and inside keyword guessing attacks in cloud storage services. Nonlinear Dyn 80(3):1601–1611

    Article  Google Scholar 

  • Makkaoui KE, Beni-Hssane A, Ezzati A (2018) Speedy cloud- RSA homomorphic scheme for preserving data confidentiality in cloud computing. Journal of Ambient Intelligence and Humanized Computing. https://doi.org/10.1007/s12652-018-0844-x

    Article  Google Scholar 

  • Mao Y, Fu X, Guo C, Wu G (2018) Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices. Trans Emerg Telecommun Technol. https://doi.org/10.1002/ett.3531 (in press)

  • Naehrig M, Lauter K, Vaikuntanathan V (2011) Can homomorphic encryption be practical? In: 3rd ACM Workshop CCSW, pp 113–124

  • Noroozi M, Eslami Z (2018) Public key authenticated encryption with keyword search: revisited. IET Inform Secur. https://doi.org/10.1049/iet-ifs20185315 (in press)

  • Noroozi M, Eslami Z, Pakniat N (2018a) Comments on a chaos-based public key encryption with keyword search scheme. Nonlinear Dyn 94:1127–1132

    Article  Google Scholar 

  • Noroozi M, Karoubi I, Eslami Z (2018b) Designing a secure designated server identity-based encryption with keyword search scheme: still unsolved. Ann Telecommun 73(11–12):769–776

    Article  Google Scholar 

  • Pakniat N (2016) Public key encryption with keyword search and keyword guessing attack: a survey. In: Proceedings of the 13th international Iranian Society of cryptology conference on information security and cryptology (ISCISC), pp 1–4

  • Park D, Kim K, Lee P (2004) Public key encryption with conjunctive field keyword search. In: Proceedings of WISA 2004, LNCS, Springer, vol 3325, pp 73–86

  • Ren K, Wang C, Wang Q (2012) Security challenges for the public cloud. IEEE Internet Comput 16(1):69–73

    Article  MathSciNet  Google Scholar 

  • Rhee HS, Park JH, Susilo W, Lee DH (2010) Trapdoor security in a searchable public-key encryption scheme with a designated tester. J Syst Softw 83(5):763–771

    Article  Google Scholar 

  • Sen J (2013) Homomorphic encryption: theory and applications. CoRR abs/1305.5886, 1305.5886

  • Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceedings of IEEE symposium on security and privacy, Washington, DC, USA, pp 44–55

  • Tang Q, Chen L (2010) Public-key encryption with registered keyword search. In: Proceedings of the 6th European Conference on public key infrastructures, services and applications. Springer, pp 163–178

  • Wang B, Li M, Wang H (2016) Geometric range search on encrypted spatial data. IEEE Trans Inform Forensics Secur 11(4):704–719

    Google Scholar 

  • Wu T, Tsai T, Tseng Y (2014) Efficient searchable ID-based encryption with a designated server. Ann Telecommun 69(7):391–402

    Article  Google Scholar 

  • Xiong L, Kumari S, Shen J, Wu F, Chen C, Islaml SH (2017) Secure data access and sharing scheme for cloud storage. Wirel Pers Commun 96(4):5295–5314

    Article  Google Scholar 

  • Xu P, Jin H, Wu Q, Wang W (2013) Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack. IEEE Trans Comput 62(11):2266–2277

    Article  MathSciNet  Google Scholar 

  • Yau WC, Phan RCW, Heng SH, Goi BM (2013) Keyword guessing attacks on secure searchable public key encryption schemes with a designated tester. Int J Comput Math 90(12):2581–2587

    Article  Google Scholar 

  • Zhang B, Zhang F (2011) An efficient public key encryption with conjunctive-subset keywords search. J Netw Comput Appl 34(1):262–267

    Article  Google Scholar 

  • Zhang G, Qin J (2015) Lattice-based threshold cryptography and its applications in distributed cloud computing. Int J High Perform Comput Netw 8(2):176–185

    Article  Google Scholar 

  • Zhang M, Wu L, Wang XA, Yang X (2016) Unidirectional IBPRE scheme from lattice for cloud computation. J Ambient Intell Hum Comput 7(5):623–631

    Article  Google Scholar 

  • Zhang R, Xue R, Liu L (2018a) Searchable encryption for healthcare clouds: a survey. IEEE Trans Serv Comput 11(6):978–996

    Article  Google Scholar 

  • Zhang X, Xu C (2018) Trapdoor security lattice-based public-key searchable encryption with a designated cloud server. Wirel Pers Commun 100(3):907–921

    Article  Google Scholar 

  • Zhang X, Xu C, Mu L, Zhao J (2018b) Identity-based encryption with keyword search from lattice assumption. China Commun 15(4):164–178

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Data Science, Shahid Beheshti University G.C., Tehran, Iran

    Mahnaz Noroozi & Ziba Eslami

Authors
  1. Mahnaz Noroozi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ziba Eslami
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ziba Eslami.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Noroozi, M., Eslami, Z. Public-key encryption with keyword search: a generic construction secure against online and offline keyword guessing attacks. J Ambient Intell Human Comput 11, 879–890 (2020). https://doi.org/10.1007/s12652-019-01254-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-019-01254-w

Keywords

Search

Navigation