Paper 2003/054

ID based Cryptosystems with Pairing on Elliptic Curve

Ryuichi SAKAI and Masao KASAHARA


The pairings on elliptic curves have been applied for realizing the secure ID based cryptosystems that can be invulnerable to the collusion attacks. The computation of the pairing are necessary for the cryptosystems, though the computation of the pairing requires high cost compared with the computation cost for the power operation over the finite fields or on the elliptic curve when the parameters are securely to be provided. In this paper we propose an efficient method for a class of ID based cryptosystems which have been proposed by the present authors. The proposed method is able to reduce the number of the computations for the pairing for verifying the ID based signature and also for decoding of the ID based public key cryptosystems with the authentication, by a factor of 2. Moreover we propose the ID based public key cryptosystems with signature and the ID based public key cryptosystems having the multiple centers.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Weil pairingTate pairingpublic key cryptographysignatureelliptic curve
Contact author(s)
sakai @ isc osakac ac jp
2003-03-31: received
Short URL
Creative Commons Attribution


      author = {Ryuichi SAKAI and Masao KASAHARA},
      title = {ID based Cryptosystems with Pairing on Elliptic Curve},
      howpublished = {Cryptology ePrint Archive, Paper 2003/054},
      year = {2003},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.