By Topic

An Efficient Public Key Encryption with Keyword Scheme Not Using Pairing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hao-Miao Yang ; Sch. of Comput. Sci. & Eng., UEST of China, Chengdu, China ; Chun-Xiang Xu ; Hong-Tian Zhao

The notion of Public Key Encryption with Keyword Search (PEKS), which enables one to search encrypted data in public key setting, was firstly suggested by Boneh et al. in 2004. So far most of presented PEKS schemes were constructed based on bilinear pairing. However, PEKS schemes based on pairing are susceptible to off-line keyword guessing attacks. In ICCSA 2006, Khader proposed a PEKS scheme not using pairing. In this paper, we show that Khader' scheme do not satisfy the consistency which is necessary for a PEKS scheme to fulfill its functionality. Then, we propose a variant of Khader scheme which is not only computationally consistent but also greatly improves efficiency.

Published in:

Instrumentation, Measurement, Computer, Communication and Control, 2011 First International Conference on

Date of Conference:

21-23 Oct. 2011