Paper 2006/108
Efficient Public Key Encryption with Keyword Search Schemes from Pairings
Chunxiang Gu, Yuefei Zhu, and Yajuan Zhang
Abstract
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key $T_W$ to a server that will enable the server to locate all encrypted messages containing the keyword $W$, but learn nothing else. In this paper, we propose a new PKES scheme based on pairings. There is no pairing operation involved in the encryption procedure. Then, we provide further discussion on removing secure channel from PKES, and present an efficient secure channel free PKES scheme. Our two new schemes can be proved secure in the random oracle model, under the appropriate computational assumptions.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- gcxiang5209 @ yahoo com cn
- History
- 2006-03-22: received
- Short URL
- https://ia.cr/2006/108
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/108, author = {Chunxiang Gu and Yuefei Zhu and Yajuan Zhang}, title = {Efficient Public Key Encryption with Keyword Search Schemes from Pairings}, howpublished = {Cryptology {ePrint} Archive, Paper 2006/108}, year = {2006}, url = {https://eprint.iacr.org/2006/108} }