Name
Abstract | ||
|---|---|---|
Multiparty key agreement has many applications on internet services such as secure teleconferencing. A group of users can hold a conference securely over an open network by running a multiparty key agreement protocol to generate a common secret key. With the common secret key, data transmission over the internet is protected for confidentiality. In 2003, Barua (INDOCRYPT 2003) first proposed a multiparty key agreement protocol by using Weil pairing. The protocol is based on ternary trees and Joux's tripartite key agreement. However, in Barua's protocol the communication round for n entities is [log(3)(n)], which is proportional to the number of participants. In this paper, we propose a new multiparty key agreement protocol from Weil pairing that needs only constant number of rounds. Besides, the message size, the total number of scalar multiplications, and the number of Weil pairing are reduced. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICSMC.2006.384705 | 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS |
Keywords | Field | DocType |
cryptographic protocols,key agreement protocol,data transmission,scalar multiplication,teleconferencing,internet | Teleconference,Cryptographic protocol,Data transmission,Computer science,Computer security,Computer network,Artificial intelligence,Key-agreement protocol,The Internet,Weil pairing,Confidentiality,Machine learning,Message size | Conference |
ISSN | Citations | PageRank |
1062-922X | 3 | 0.37 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chu-hsing Lin | 1 | 386 | 50.62 |
| Hsiu-Hsia Lin | 2 | 34 | 4.44 |
| Jen-Chieh Chang | 3 | 8 | 2.22 |