Sciweavers

32 search results - page 2 / 7
» Secure Delegation of Elliptic-Curve Pairing
Sort
View
DCC
2011
IEEE
13 years 23 days ago
Computing bilinear pairings on elliptic curves with automorphisms
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei...
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
13 years 11 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
JSS
2011
106views more  JSS 2011»
12 years 8 months ago
A family of implementation-friendly BN elliptic curves
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...
IJNSEC
2007
130views more  IJNSEC 2007»
13 years 5 months ago
An Attack on Libert et al.' s ID-based Undeniable Signature Scheme
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. ...
Zichen Li, C. F. Chong, Lucas Chi Kwong Hui, Siu-M...
ICC
2007
IEEE
269views Communications» more  ICC 2007»
14 years 3 days ago
A Routing-Driven Key Management Scheme for Heterogeneous Sensor Networks
–The many-to-one traffic pattern dominates in sensor networks, where a large number of sensor nodes send data to one sink. A sensor node may only communicate with a small portion...
Xiaojiang Du, Yang Xiao, Song Ci, Mohsen Guizani, ...