EFFICIENT PUBLIC KEY ENCRYPTION WITH KEYWORD SEARCH | ||||
| JES. Journal of Engineering Sciences | ||||
| Article 10, Volume 38, No 3, May and June 2010, Page 749-761 PDF (255.54 K) | ||||
| Document Type: Research Paper | ||||
| DOI: 10.21608/jesaun.2010.124396 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| B. MORGAN; M. HAMADA1; G. ABDEFADEL2 | ||||
| 1Assistance Professor, Communication and Electronics Department, Helwan University | ||||
| 2Professor, Communication and Electronics Department, Helwan University | ||||
| Abstract | ||||
| Public key encryption with key word search (PEKS) enables user Alice to send a secret key to a server that will enable the server to locate all encrypted messages containing the keyword, but learn nothing else. In this paper, we propose a new scheme the Efficient Public Key Encryption with Keyword Search (EPEKS). Firstly we explained the construction of new scheme (EPEKS). (EPEKS) doesn’t base on Identity Based Encryption or pairing which was used in the construction of the (PEKS) that proposed in Boneh’s paper and other papers; it is based on Public Key Cryptosystem. Secondly, we proposed provably secure (EPEKS) scheme that refreshes keywords and processes multiple keywords. Finally, we described the security of the new scheme by using Cryptographic algorithm and Hash function. | ||||
| Keywords | ||||
| Public key encryption; RSA; Encryption email; Hash function; Mail server; Refreshing keywords | ||||
|
Statistics Article View: 74 PDF Download: 247 |
||||
