loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
An Efficient Keys Agreement for Multi-party?s Communication
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
ASCII Text
x 
 
Zhang Peng, Ye Chengqing, Li Xin, Ma Xuying, "An Efficient Keys Agreement for Multi-party?s Communication," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 267-269, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.78,
author = {Zhang Peng and Ye Chengqing and Li Xin and Ma Xuying},
title = {An Efficient Keys Agreement for Multi-party?s Communication},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {267-269},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.78},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - An Efficient Keys Agreement for Multi-party?s Communication
SN - 0-7695-2405-2
SP267
EP269
A1 - Zhang Peng,
A1 - Ye Chengqing,
A1 - Li Xin,
A1 - Ma Xuying,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Zhang Peng, Zhejiang University Hangzhou, China
Ye Chengqing, Zhejiang University Hangzhou, China
Li Xin, Zhejiang University Hangzhou, China
Ma Xuying, Zhejiang University Hangzhou, China
Group key agreement problem is important in many modern collaborative and distributed applications. In this paper, based on bilinear pairings cryptosystem, an efficient constant-round keys agreement is proposed for multi-party?s communication, which can not only establish a group key for all participators but also establish key for every party that is a group too. Compared with other constant-round contributory key agreement, it is no need for about half of group members to broadcast messages in second round information exchange, so it saves communication cost largely.
Citation:
Zhang Peng, Ye Chengqing, Li Xin, Ma Xuying, "An Efficient Keys Agreement for Multi-party?s Communication," pdcat, pp.267-269, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.