NDLI: Establishment of conference keys in heterogeneous networks

Content Provider	IEEE Xplore Digital Library
Author	Trappe, W. Wang, Y. Liu, K.J.R.
Copyright Year	2002
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Maryland Univ., MD, USA (Trappe, W.; Wang, Y.; Liu, K.J.R.)
Abstract	In order to secure communication amongst members of a conference, a secret shared by all group members must be established. The Diffie-Hellman problem is often the basis for generating keys in two-party communication, and can also be used to establish conference keys. In heterogeneous networks, many conferences have participants of varying computational power and resources. Most conference keying schemes do not address this concern and place the same burden upon less-powerful clients as more-powerful ones. The establishment of conference keys should try to minimize the burden placed on more resource-limited users while ensuring that the entire group can establish the group secret. In this paper, we present a scheme for establishing a conference key using the two-party Diffie-Hellman scheme. The scheme is hierarchical, forming subgroup keys for successively larger subgroups en route to establishing the group key. A full, binary tree called the conference tree governs the order in which subgroup keys are formed. Key establishment schemes that consider users with varying costs or budgets are designed by appropriately choosing the conference tree. The tree that minimizes the total group cost is produced via the Huffman algorithm. A criterion is presented for the existence of a conference tree when users have varying budgets, and a greedy algorithm is presented that minimizes the total length of the conference tree under budget constraints.
Starting Page	2201
Ending Page	2205
File Size	245298
Page Count	5
File Format	PDF
ISBN	0780374002
DOI	10.1109/ICC.2002.997237
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-04-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent networks Cryptography Protection Protocols Educational institutions Bandwidth Cost function Computer networks Binary trees Greedy algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Resource-aware conference key establishment for heterogeneous networks

A pair-wise key establishment scheme without predistributing keys for ad-hoc networks

Establishing Pairwise Keys in Heterogeneous Two-Tiered Wireless Sensor Networks

Distributed algorithms for computation of fair rates in multirate multicast trees

Adapting to route-demand and mobility (ARM) in ad hoc network routing

An online genetic algorithm for dynamic Steiner tree problem

A Developed Restricted Rotation for Binary Trees Transformation

Improvement of Local Greedy Algorithm in GEAR

Adaptive source routing in high-speed networks

Establishment of conference keys in heterogeneous networks

Similar Documents

Resource-aware conference key establishment for heterogeneous networks

A pair-wise key establishment scheme without predistributing keys for ad-hoc networks

Establishing Pairwise Keys in Heterogeneous Two-Tiered Wireless Sensor Networks

Distributed algorithms for computation of fair rates in multirate multicast trees

Adapting to route-demand and mobility (ARM) in ad hoc network routing

An online genetic algorithm for dynamic Steiner tree problem

A Developed Restricted Rotation for Binary Trees Transformation

Improvement of Local Greedy Algorithm in GEAR

Adaptive source routing in high-speed networks

Establishment of conference keys in heterogeneous networks