In this paper we examine the hard problems underlying asymmetric pairings, their precise relationships and how they affect a number of existing protocols. Furthermore, we present a new model for the elliptic curve groups used in asymmetric pairings, which allows both an efficient pairing and an efficiently computable isomorphism.
|Translated title of the contribution||On computable isomorphisms in efficient asymmetric pairing-based systems|
|Journal||Discrete Applied Mathematics|
|Publication status||Published - 2007|