Cryptanalysis And Design Of Bilinear Pairing-based Public Key Cryptography

In the past few years, bilinear pairing has become a hot mathematical tool incryptography research field, and has been widely used in designing varies of public keycryptosystems. This paper studies on bilinear pairing-based public key cryptography, andachieveds the following results:(1) In Journal of Computers (2011), Kang et al presented apublic key encryption scheme from bilinear pairing, and claimed that their scheme is secureagainst chosen-ciphertext attacks. However, by present a concrete chosen-ciphertext attack,this paper indicates that Kang et al.’s scheme does not secure against chosen-ciphertext attacks.Then this paper propses an improved public key encryption scheme from bilinear pairings, andproves its chosen-ciphertext security in the standard model. This paper also presents a concreteimplementation for the proposed scheme.(2) In Journal of Software (2011), Gu et al.proposed an identity-based signature scheme using bilinear pairings, and claimed that theirscheme is existential unforgeabile under chosen-message attacks. However, by giving concreteattacks, this paper indicates that their signature scheme is not existential unforgeabile underchosen-message attacks.(3) In2009, Luo proposed a certificate-based signcryption schemeusing bilinear pairings, and claimed that their scheme is indistinguishable under adaptivechosen-ciphertext attacks. However, by giving a concrete attack, this paper indicates that theirscheme is not indistinguishable under adaptive chosen-ciphertext attacks.