نتایج جستجو برای: random key distribution

تعداد نتایج: 1361267  

Journal: :CIT 2009
R. Aparna B. B. Amberker

Secure Group Communication is very critical for applications like board-meetings, group discussions and teleconferencing. Managing a set of secure group keys and group dynamics are the fundamental building blocks for secure group communication systems. Several group key management techniques have been proposed so far by many researchers. Some schemes are information theoretic and some are compl...

2000

Secure group communication is an increasingly popular research area having received much attention in the last several years. The fundamental challenge revolves around secure and efficient group key management. While centralized methods are often appropriate for key distribution in large groups, many collaborative group settings require distributed key agreement techniques. This work investigat...

2005
Ashok Kumar Das Abhijit Das Surjyakanta Mohapatra Srihari Vavilapalli

In this paper we propose an improved alternative for the path key establishment phase of bootstrapping in a sensor network. Our scheme lets the network adapt to the deployment configuration by secure transmission of predistributed keys. This results in better connectivity than what path key establishment can yield. The communication overhead for our scheme is comparable with that for path key e...

Journal: :CoRR 2010
Anvesh Aileni

Wireless sensor networks consist of sensor nodes with limited computational and communication capabilities. In this paper, the whole network of sensor nodes is divided into clusters based on their physical locations. In addition, efficient ways of key distribution among the nodes within the cluster and among controllers of each cluster are discussed. Also, inter and intra cluster communications...

1995
Kaoru KUROSAWA Koji OKADA Keiichi SAKANO

This paper studies the security of the trusted center in a b-secure t-group key distribution scheme in which the center issues a private information vi 2 V to each user i based on the center secret s 2 S. User i can obtain the common key k 2 K with t ? 1 other users from vi so that any dishonest b users cannot learn any key they should not know. First, we show how to distribute the power of the...

Journal: :TIIS 2009
Aziz Mohaisen Jeong Woon Choi Dowon Hong

In this article, we demonstrate that the asymmetric key-based architecture for securing wireless sensor networks recently introduced by Haque et al. is insecure under impersonation attack, since it does not provide authentication semantics. In addition, we show that, for the scheme to work correctly, the resulting key distribution construction should be symmetric and group-wise.

2000
Kuen-Pin Wu Shanq-Jang Ruan Feipei Lai Chih-Kuang Tseng

Multicasting has been widely utilized for delivering messages from one sender to multiple recipients. Nowadays in some applications such as pay per view or videoconferencing systems, the messages delivered via multicasting should be available to authorized recipients only. Therefore, secure multicasting becomes an important design issue in distributed environment. To achieve secure multicasting...

Journal: :Wireless Personal Communications 2015
Hua Guo Yandong Zheng

Recently, in Journal of Security and Communication Networks (5(12):1363-1374, DOI: 10.1002/ sec.429), Wang et al. proposed a group key distribution scheme with self-healing property for wireless networks in which resource is constrained. They claimed that their key distribution scheme satisfies forward security, backward security and can resist collusion attack. Unfortunately, we found some sec...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید