The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Key Management protocol is one of the most important mechanisms for communication security, whereas its security analysis is critical to evaluate the information security. In this paper, we study a kind of group key management schemes which use key calculation in rekeying. At first, the security vulnerability in Code for Key Calculation (CKC) is analyzed. The codes in the key tree can be exposed to...
IPTV service provider only allows the users authorized by CAS to access to the contents. In CAS, hierarchical key structure is used to manage users efficiently and securely. The amount of message transmission for key update increases as the number of users goes up. In this paper, we propose the IPTV CAS using group key management scheme based on bottom-up hash tree. The proposed scheme can update...
Consider several groups engaged in a single project. Group members of one group happens to communicate with other group members. How might the communication among the members be carried out securely? How to ensure that a group member of one group communicate securely with its own group and with other group members as well?. We predict that secure group key management schemes for simultaneous multiple...
We propose a novel scheme for selective distribution of content, encoded as documents, that preserves the privacy of the users to whom the documents are delivered and is based on an efficient and novel group key management scheme. Our document broadcasting approach is based on access control policies specifying which users can access which documents, or subdocuments. Based on such policies, a broadcast...
To protect digital contents, CAS encrypts the contents with content encryption keys. Hence, it has been a main issue how to manage the content encryption keys efficiently as well as securely. To face this problem, CAS usually uses a hierarchical key structure and distributes the hierarchical keys to subscribers using smart cards. However, since the smart cards can be revoked so that the saved keys...
Communication via self-organization is a practical and most common model for wireless sensor network. Its security, efficiency and cost and corresponding key management are one of the key research topics on WSN security. This paper proposes a group key management scheme for WSN based on an original self-organized structure, grid-loop. The group which we called grid-loop is constructed on distributed...
This paper proposes a scheme to provide Security to Dynamic Multicast VoIP systems efficiently. Security is usually provided by encrypting the media packets sent from a user to other users with the help of a shared key called the Session Encryption Key (SEK). The most time consuming process in a dynamic multicast VoIP environment is the Group Key Management. Whenever there is a change in the group...
In this paper, we propose a new group key management scheme for wireless sensor networks in terms of the unreliable wireless channel and unsafe environment. Our proposed scheme implements node revocation through a broadcast polynomial to counteract the node compromise attack and inherits the idea of loss tolerance in LiSP to provide a reliable communication. The analysis shows that the proposed scheme...
Secure multicast is an effective group communication technology for information sharing and message exchange in emerging grids. As the group scale in grids may be very large and group members can be very unstable (a member can join or quit the group dynamically), it is hard for conventional group key management schemes to satisfy the efficiency of group key distribution very well because of the complexity...
Along with the dramatic development of wireless network technologies and portable devices, wireless group applications are rapidly innovated to provide online services via wireless broadband networks. This development has led to a prime concern for providing clients with a secure and efficient key management system for group services such as multimedia conferencing, stock quoting and so on. In this...
Mobile multicast has two points of view. One is focused on the mobile receiver and the other is focused on the mobile source. Mobile multicast also has two approaches. When a mobile source wants to send multicast traffic, it uses either a designated router in the foreign network or its home agent (HA). These are called remote approach and bi-directional tunneling approach respectively. When a mobile...
A large-scale sensor network often requires a network wide group key for confidentiality of control messages and data reports. The group key should be updated when a certain sensor node is compromised by adversaries in a hostile environment. However, key update messages will consume much energy during hop-by-hop delivery to each sensor nodes. In this paper, we propose a new group key management scheme...
In wireless networks, secure multicast protocols are more difficult to implement efficiently due to the dynamic nature of the multicast group and the scarcity of bandwidth at the receiving and transmitting ends. Mobility is one of the most distinct features to be considered in wireless networks. Moving users onto the key tree causes extra key management resources even though they are still in service...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.