Title :
Key Graphs and Secret Sharing Be Used in Network Multicast Security
Author :
Jin, Shangzhu ; Peng, Jun
Author_Institution :
Sch. of Electron. Inf. Eng., Chongqing Univ. of Scienceand Technol., Chongqing, China
Abstract :
Multicast communication is increasingly used in applications where the volume of network traffic needs to be minimized. Security of the packets delivered from a source to a large group of receivers presents one of the most challenging research problems for the network architecture. A majority of the proposals for scalable secure multicasting makes use of hierarchical key distribution trees. The centralized tree-based key management scheme assigns a unique key to each of the nodes in a member´s path to the root. The group key is used by a central server to encrypt multicast data until a member joins or leaves the group.For multicast applications such as pay-per-view where the content has very high value, the group key may need to change frequently. In this paper, we introduce a new approach based on secret sharing in which the server assigns unique secret shares to the nodes in the distribution tree. Our proposal is a prepositioned shared secret scheme that allows the reconstruction of different keys by communicating different activating shares for the same prepositioned information.
Keywords :
computer network security; multicast communication; telecommunication traffic; trees (mathematics); central server; centralized tree-based key management scheme; group key; hierarchical key distribution trees; key graphs; multicast communication; multicast data encryption; network architecture; network multicast security; network traffic; receivers; secret sharing; Authentication; Computational efficiency; Cryptography; Information security; Intelligent networks; Network servers; Proposals; Telecommunication traffic; Tree data structures; Tree graphs;
Conference_Titel :
Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5272-9
DOI :
10.1109/CNMT.2009.5374682