Public Key Encryption with Keyword Search Based on K-Resilient IBE

  • Dalia Khader
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)


An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does not want the email to be decrypted by anyone except her including the gateway itself. This is a scenario where public key encryption with keyword search (PEKS) is needed. In this paper we construct a new scheme (KR-PEKS) the K-Resilient Public Key Encryption with Keyword Search. The new scheme is secure under a chosen keyword attack without the random oracle. The ability of constructing a Public Key Encryption with Keyword Search from an Identity Based Encryption was used in the construction of the KR-PEKS. The security of the new scheme was proved by showing that the used IBE has a notion of key privacy. The scheme was then modified in two different ways in order to fulfill each of the following: the first modification was done to enable multiple keyword search and the other was done to remove the need of secure channels.


Hash Function Random Oracle Secure Channel Security Notion Cryptology ePrint Archive 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Public key encryption with keyword search based on k-resilient ibe (full version)Google Scholar
  2. 2.
    Baek, J., Naini, R., Susilo, W.: Public key encryption with keyword search revisited. Cryptology ePrint Archive, Report 2005/191 (2005),
  3. 3.
    Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 566. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Boneh, D., Crescenzo, G., Ostrovsky, R., Persiano, G.: Public-key encryption with keyword search. In: Cachin, C. (ed.) Proceedings of Eurocrypt 2004 (2004),
  5. 5.
    Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM Journal on Computing 32(3), 586–615 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Boneh, D., Boyen, X.: Short signatures without random oracles. Cryptology ePrint Archive, Report 2004/171 (2004),
  7. 7.
    Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)Google Scholar
  8. 8.
    Cha, J., Park, D., Lee, P.: Searchable keyword-based encryption. Cryptology ePrint Archive, Report 2005/367 (2005),
  9. 9.
    Hayashi, R., Tanaka, K.: Elgamal and cramer shoup variants with anonymity using different groups extended abstract. C-200 (2004),
  10. 10.
    Heng, S., Kurosawa, K.: K-resilient identity-based encryption in the standard model. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 67–80. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Park, D., Kim, K., Lee, P.: Public key encryption with conjunctive field keyword search. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 73–86. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Shamir, A.: Identity-based cryptosystems and signature schemes. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 47–53. Springer, Heidelberg (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dalia Khader
    • 1
  1. 1.Department of Computer ScienceUniversity of Bath 

Personalised recommendations