48 search results - page 6 / 10 » Computing bilinear pairings on elliptic curves with automorp... |
PKC
2010
Springer
15 years 1 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
DCC
2010
IEEE
14 years 9 months ago
2010
IEEE
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
IJNSEC
2007
14 years 9 months ago
2007
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
CANS
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tat...
CARDIS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...