ACM Home Page
Please provide us with feedback. Feedback
Low-power group key agreement for heterogeneous wireless networks
Full text PdfPdf (199 KB)
Source International Conference On Communications And Mobile Computing archive
Proceedings of the 2006 international conference on Wireless communications and mobile computing table of contents
Vancouver, British Columbia, Canada
SESSION: M2-B: computer and network security symposium table of contents
Pages: 177 - 182  
Year of Publication: 2006
ISBN:1-59593-306-9
Authors
Joseph Chee Ming Teo  Nanyang Technological University, Singapore
Chik How Tan  Gjøvik University College
Jim Mee Ng  Nanyang Technological University, Singapore
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 63,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143549.1143586
What is a DOI?

ABSTRACT

Heterogeneous wireless networks are gaining popularity as users can be connected to these networks without any cables and even when they are mobile. The high power nodes in heterogeneous wireless networks do not have energy constraints but the user nodes, which can be large in numbers, are usually low power energy constrained devices. Therefore, the GKA protocol used to secure group communications in these networks has to take into consideration both the low power nature of the user nodes and the network size. In this paper, we present an energy efficient and scalable GKA protocol, which uses our proposed Contributory Ring-Centralized (ContRi-Central) group model. Besides providing complexity analysis, we also show the computational and communication energy consumption costs analysis of all nodes running our proposed scheme and four other efficient GKA protocols. Both the complexity analysis and energy consumption costs analysis indicate that our proposed scheme is more efficient and suitable for heterogeneous wireless networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Burmester and Y. Desmedt, "A Secure and Efficient Conference Key Distribution System," in Proc. Advances in Cryptography - Eurocrypt '94, Lecture Notes in Computer Science vol. 950, pp. 275--286, 1995.
 
2
D. W. Carman, P. S. Kruss and B. J. Matt, "Constraints and approaches for distributed sensor network security," NAILa bs Technical Report #00-010, September 2000.
 
3
W. Diffie and M. Hellman , "New directions in cryptography," IEEE Transaction on Information Theory, vol. 22, No. 6, pp. 644--654, November 1976.
 
4
 
5
A. Hodjat and I. Verbauwhede, "The energy cost of secrets in ad-hoc networks," in Proc. IEEE CAS Workshop on Wireless Communication and Networking, September 2002.
 
6
I. Ingemarsson, D. T. Tang and C. K. Wong , "A conference key distribution system," IEEE Transactions on Information theory, vol. 28, No. 5, pp. 714--720, September 1982.
 
7
 
8
J. Katz and M. Yung, "Scalable protocols for authenticated group key exchange," In Advances in Cryptography - Crypto'03, Lecture Notes in Computer Science Vol. 2729, pp. 110--125, 2003.
9
 
10
J. Nam, S. Kim, and D. Won, "Secure Group Communications over Combined Wired and Wireless Networks," Proc. of TrustBus 2005, Lecture Notes in Computer Science Vol. 3592, pp.90--99, August 2005.
 
11
J. Nam, S. Cho, S. Kim, and D. Won, "Simple and Efficient Group Key Agreement Based on Factoring," Proc. of ICCSA 2004, Lecture Notes in Computer Science Vol. 3043, pp.645--654, 2004.
12
 
13


Collaborative Colleagues:
Joseph Chee Ming Teo: colleagues
Chik How Tan: colleagues
Jim Mee Ng: colleagues