Efficient Signature Scheme From Self-Pairing on Elliptic Curves

Abstract

A Self-pairing e s (P, P ) is a special subclass of bilinear pairing where both input points in a group are equal. Self-pairings have some interesting applications in cryptographic scheme and protocols. Recently some novel methods for constructing self-pairings on supersingular elliptic curves have been proposed. In this paper we first give the construction of self-pairings on some supersingular elliptic curves. We will show that the proposed self pairings are efficient than the general pairings on the corresponding curves. Secondly, we present a digital signature scheme from self-pairing on elliptic curves. We also show that the signature scheme from self-pairing is more efficient than the previous one.