Abstract
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 |
|---|---|
| Original language | English |
| Pages (from-to) | 538-547 |
| Journal | Discrete Applied Mathematics |
| Volume | 155(4) |
| Publication status | Published - 2007 |