4212 search results - page 34 / 843 » On Compressible Pairings and Their Computation |
76
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
99
Voted
CISC
2005
Springer
15 years 2 months ago
2005
Springer
We propose an improved implementation of modified Weil pairings. By reduction of operations in the extension field to those in the base field, we can save some operations in the...
89
Voted
STACS
1990
Springer
15 years 4 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...
110
click to vote
AINA
2004
IEEE
15 years 4 months ago
2004
IEEE
At the conference Asiacrypt 2001, Rivest, Shamir and Tauman firstly addressed the concept of ring signature. In this paper we propose an identity-based ring signature scheme from ...
123
Voted
IJISEC
2008
15 years 15 days ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...