Public Key Encryption with Keyword Search Based on K-Resilient IBE
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.
KeywordsHash Function Random Oracle Secure Channel Security Notion Cryptology ePrint Archive
Unable to display preview. Download preview PDF.
- 1.Public key encryption with keyword search based on k-resilient ibe (full version)Google Scholar
- 2.Baek, J., Naini, R., Susilo, W.: Public key encryption with keyword search revisited. Cryptology ePrint Archive, Report 2005/191 (2005), http://eprint.iacr.org/
- 4.Boneh, D., Crescenzo, G., Ostrovsky, R., Persiano, G.: Public-key encryption with keyword search. In: Cachin, C. (ed.) Proceedings of Eurocrypt 2004 (2004), citeseer.ist.psu.edu/boneh04public.html
- 6.Boneh, D., Boyen, X.: Short signatures without random oracles. Cryptology ePrint Archive, Report 2004/171 (2004), http://eprint.iacr.org/
- 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.Cha, J., Park, D., Lee, P.: Searchable keyword-based encryption. Cryptology ePrint Archive, Report 2005/367 (2005), http://eprint.iacr.org/
- 9.Hayashi, R., Tanaka, K.: Elgamal and cramer shoup variants with anonymity using different groups extended abstract. C-200 (2004), http://www.is.titech.ac.jp/research/research-report/C/
- 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