| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9506393 | Applied Mathematics and Computation | 2005 | 6 Pages |
Abstract
We propose an n-round key agreement protocol for any N-participants, where 3nâ1 < N ⩽ 3n, using the tripartite Joux key agreement protocol from pairings in combination with a divide-and-conquer strategy. The security of this protocol is based on the hardness of the bilinear Diffie-Hellman problem and the computational Diffie-Hellman problem.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Iwan Duursma, Hyang-Sook Lee,