48 search results - page 5 / 10 » Computing bilinear pairings on elliptic curves with automorp... |
CTRSA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
68
Voted
IEICET
2008
14 years 9 months ago
2008
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...
88
Voted
PAIRING
2009
Springer
15 years 4 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
ANTS
2004
Springer
15 years 2 months ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...