Open AccessNew certificateless public key encryption scheme without pairing
Author(s) -
Yan Xiaopeng,
Gong Peng,
Bai Zhiquan,
Wang Jiantao,
Li Ping
Publication year - 2013
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2012.0257
Subject(s) - random oracle , scheme (mathematics) , pairing , public key cryptography , encryption , computer science , oracle , key (lock) , theoretical computer science , mathematics , computer security , superconductivity , quantum mechanics , mathematical analysis , physics , software engineering
To satisfy the requirement of practical applications, many certificateless encryption schemes (CLE) without pairing have been proposed. Recently, Lai et al . proposed a CLE scheme without pairing and demonstrated that their scheme is provably secure in the random oracle model. The analysis shows that their scheme has better performance than the related schemes. However, Lai et al . ’s scheme is not a standard CLE scheme since the user's public key is used when generating his partial private key. In this study, the authors propose a new CLE scheme. Compared with Lai et al .’s scheme, the authors' scheme is a standard CLE scheme at the cost of increasing the computational cost slightly. Besides, their scheme has better performance than the related schemes except Lai et al .’s scheme. They also show their scheme is provably secure in the random oracle model.