974 search results - page 9 / 195 » pairing 2010 |
PAIRING
2010
Springer
13 years 5 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
STACS
2010
Springer
14 years 2 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...
IJNSEC
2010
13 years 2 months ago
2010
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose and analyze two strategies to learn over unordered pairs with kernels, and provide a common theoretical framework to compare them. The strategies are related to methods...
TIT
2010
13 years 2 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...