Analysis of Key Management Schemes for Secure Group Communication and Their Classification

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 complexity theoretic in nature. Users in the secure group may negotiate with each other to derive a common group key or may compute the group key on their own. Some schemes involve a trusted Key Distribution Center (KDC), which generates and distributes initial pieces of information, whereas in other schemes users themselves select their private information. Storage at each user and communication cost among members of the group vary from scheme to scheme. Here, in this paper we discuss some of the key management schemes proposed earlier based on the considerations mentioned above. We also analyze the schemes with respect to storage, communication and computation costs

Analysis of Key Management Schemes for Secure Group Communication and Their Classification

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 complexity theoretic in nature. Users in the secure group may negotiate with each other to derive a common group key or may compute the group key on their own. Some schemes involve a trusted Key Distribution Center (KDC), which generates and distributes initial pieces of information, whereas in other schemes users themselves select their private information. Storage at each user and communication cost among members of the group vary from scheme to scheme. Here, in this paper we discuss some of the key management schemes proposed earlier based on the considerations mentioned above. We also analyze the schemes with respect to storage, communication and computation costs

RASCP: Providing for a Secure Group Communication Plane Using RFID

Predominantly large distributed networks currently provide support for group oriented protocols and applications Regardless of the type of distributed network there is a need to provide communication privacy and data integrity to the information exchange amongst the group members This paper introduces a protocol named Authentication based Secure Communication Plane adopts the commutative RSA algorithm to maintain data integrity The proposed protocol not only eliminates the overheads resulting from key distribution and key compromise attacks but also provide for information security in the presence of colluded group members Radio Frequency Identification tags is used for group member identification The RACP protocol is compared with the RFID extended Secure Lock group communication protocol and its efficiency in terms of the computational complexity involved is discussed in this pape

Group key establishment protocols: Pairing cryptography and verifiable secret sharing scheme

Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2013Includes bibliographical references (leaves: 97-103)Text in English; Abstract: Turkish and Englishx, 154 leavesThe aim of this study is to establish a common secret key over an open network for a group of user to be used then symmetrical secure communication between them. There are two methods of GKE protocol which are key agreement and key distribution. Key agreement is a mechanism whereby the parties jointly establish a common secret. As to key distribution, it is a mechanism whereby one of the parties creates or obtains a secret value and then securely distributes it to other parties. In this study, both methods is applied and analyzed in two different GKE protocols. Desirable properties of a GKE are security and efficiency. Security is attributed in terms of preventing attacks against passive and active adversary. Efficiency is quantified in terms of computation, communication and round complexity. When constructing a GKE, the challenge is to provide security and efficiency according to attributed and quantified terms. Two main cryptographic tools are selected in order to handle the defined challenge. One of them is bilinear pairing which is based on elliptic curve cryptography and another is verifiable secret sharing which is based on multiparty computation. In this thesis, constructions of these two GKE protocols are studied along with their communication models, security and efficiency analysis. Also, an implementation of four-user group size is developed utilizing PBC, GMP and OpenSSL Libraries for both two protocols

Causal Factors for Web Site Complexity

The World Wide Web has become the medium of choice for the distribution and use of information by individuals, teams, organizations, and communities. Web sites—the collection of web pages that make up the World Wide Web—are the fundamental means by which that information is retrieved and distributed. Understanding the factors that impact the complexity of a web site is a key step toward effective retrieval and distribution of information and its ultimate use in collaborative activity.This paper proposes three major dimensions of factors that impact the complexity of a web site: (1) cognition, (2) content, and (3) form. These three dimensions and their associated factors comprise how individuals perceive a web site, the content that is located at the site, and the manner in which the web site is constructed. A model and associated propositions are presented, and implications of this approach for research and practice are discussed. This multi-dimensional view of web site complexity provides a richer approach to understanding how complexity might be examined and, ultimately, reduced. This paper relates to collaborative work through individuals and their interaction with a web site. This interaction is, in fact, a communication between the individual using a web site and an individual, group, or organization responsible for the design of the web site. Additionally, the individual perspective is a necessary starting point for collaborative use between and among people

Cryptanalysis of a Group Key Transfer Protocol Based on Secret Sharing: Generalization and Countermeasures

Group key distribution protocol is a mechanism in which a group key is generated and distributed by KGC to a set of communicating parties in a group. This group key generally ensures secure communication among communicating parties in an unsecure channel. Harn and Lin protocol is one such. It is based on Shamir\u27s secret sharing scheme. Nam et al. exposed the vulnerability in Harn and Lin protocol through their replay attack and proposed a countermeasure using nonce mechanism. In this paper, we are generalizing the replay attack proposed by Nam et al. and proposing an alternative countermeasure without using nonce mechanism. Novelty of our countermeasure is that KGC is not required to detect replay messages and hence each user doesn\u27t need to compute authentication message as in Nam et al. Proposed countermeasure thereby brings down the computational complexity of the scheme