Searching for "On Pairing-Based Cryptosystems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

62 documents found, showing 1 through 10. Next 10 →

Efficient algorithms for pairing-based cryptosystems
by Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn, Michael Scott — 2002
…Efficient Algorithms for Pairing-Based Cryptosystems Paulo S.L.M. Barreto 1 , Hae Y. Kim 1 , Ben…
Cited by 177 (17 self) – Add To MetaCart

Efficient implementation of pairing-based cryptosystems
by Ben Lynn, John Mitchell, Xavier Boyen — 2004 — Journal of Cryptology
…ON THE IMPLEMENTATION OF PAIRING-BASED CRYPTOSYSTEMS A DISSERTATION SUBMITTED TO THE DEPARTMENT…
Cited by 23 (3 self) – Add To MetaCart

Efficient Algorithms for Pairing-Based Cryptosystems
by Pairing-based Cryptosystems, Marcus Stogbauer — 2004
… for Pairing-Based Cryptosystems Marcus Stögbauer 4th January 2004 supervised by: Dr. Tsuyoshi Takagi…
Add To MetaCart

Applications of Multiple Trust Authorities in Pairing Based Cryptosystems
by Liqun Chen Keith, Keith Harrison, David Soldera, Nigel Smart, L. Chen, K. Harrison, D. Soldera, N. P. Smart, Filton Road — 2003 — In Proceedings of Infrastructure Security Conference 2002, LNCS 2437
…Applications of Multiple Trust Authorities in Pairing Based Cryptosystems Liqun Chen, Keith…
Add To MetaCart

Special polynomial families for generating more suitable elliptic curves for pairing-based
by Pu Duan, Shi Cui, Choong Wah Chan — 2005 — The 5th WSEAS International Conference on Electronics, Hardware, Wireless & Optimal Communications
… Constructing non-supersingular elliptic curves for pairing-based cryptosystems have attracted much attention…
Cited by 4 (0 self) – Add To MetaCart

A Note On The Bi-Linear Diffie-Hellman Assumption
by Yacov Yacobi — 2002 — degrees in electrical engineering in 1976 and 1981, respectively, from Tokyo Institute of Technology. From 1997 to 2001, he was a Professor in Tokyo Institute of Technology. He is currently a Professor in the Department of Computer and Information Science
…#e-Hellman (BDH) intractability assumption is required to establish the security of new Weil-pairing based…
Cited by 5 (0 self) – Add To MetaCart

On the Selection of Pairing-Friendly Groups
by Paulo S. L. M. Barreto, Ben Lynn, Michael Scott, Escola Politecnica — 2003
… suitable for pairing-based cryptosystems. The selected parameters are shown to favor implementations…
Cited by 35 (10 self) – Add To MetaCart

Compressed Pairings
by Michael Scott, Paulo S. L. M. Barreto — 2004 — In Advances in cryptology – Crypto’2004
…. pbarreto@(email omitted); Abstract. Pairing-based cryptosystems rely on bilinear non-degenerate maps called…
Cited by 25 (6 self) – Add To MetaCart

Applications of Pairings in GRID Security
by Amitabh Saxena, Ben Soh — 2006
… of pairing based cryptosystems in GRID computing. In particular, we focus on various signature schemes…
Add To MetaCart

Generating more MNT elliptic curves
by Michael Scott, Paulo S. L. M. Barreto — 2004
…, or 6. Such curves are important for the realisation of pairing-based cryptosystems on ordinary (non…
Cited by 7 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB