48 search results - page 8 / 10 » Computing bilinear pairings on elliptic curves with automorp... |
135
Voted
PAIRING
2010
Springer
14 years 7 months ago
2010
Springer
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
ANTS
1998
Springer
15 years 1 months ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
108
click to vote
COMCOM
2011
14 years 4 months ago
2011
Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between ...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
60
Voted
FC
2005
Springer
15 years 2 months ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...