Sciweavers

204 search results - page 6 / 41
» Powered Tate Pairing Computation
Sort
View
ACISP
2004
Springer
14 years 1 months ago
Secure Bilinear Diffie-Hellman Bits
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...
Steven D. Galbraith, Herbie J. Hopkins, Igor Shpar...
CIKM
2006
Springer
14 years 1 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
PERCOM
2007
ACM
14 years 9 months ago
Identity-Based Encryption for Sensor Networks
In spite of several years of intense research, the area of security and cryptography in Wireless Sensor Networks (WSNs) still has a number of open problems. On the other hand, the...
Leonardo B. Oliveira, Ricardo Dahab, Julio L&oacut...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 4 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
PKC
2007
Springer
135views Cryptology» more  PKC 2007»
14 years 3 months ago
A Direct Anonymous Attestation Scheme for Embedded Devices
Abstract. Direct anonymous attestation (DAA) is an anonymous authentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. Th...
He Ge, Stephen R. Tate