Secure group and multi-layer group communication schemes based on polynomial interpolation

  title={Secure group and multi-layer group communication schemes based on polynomial interpolation},
  author={B. R. Purushothama and B. B. Amberker},
  journal={Secur. Commun. Networks},
Secure group communication model poses the challenge of key management to enforce the access control among the users of the group. Secure group key management schemes should be designed such that there is less rekeying and storage cost involved to manage the group keys. We propose a centralized, scalable, share-based secure group key management scheme employing a new approach on the basis of the polynomial interpolation technique. We prove the security of the scheme. We design a multilayer… 
Analyses of several recently proposed group key management schemes
This paper reviews three schemes recently proposed, including Kayam's scheme for groups with hierarchy, Piao's group key management KM scheme, Purushothama's group KM schemes, and points out the problems in each.
Attacks and Comments on Several Recently Proposed Key Management Schemes
In this paper, we review three problematic key management (KM) schemes recently proposed, including Kayam’s scheme for groups with hierarchy [10], Piao’s group KM scheme [14], Purushothama’s group KM
Indistinguishable against adaptive chosen ciphertext attack secure public key cryptosystem with double trapdoor decryption mechanism
The GenRSA's indistinguishability security against adaptive chosen ciphertext attack under the computational generalized RSA intractability assumption and in the random oracle model is proved.


Key management scheme for multi-layer secure group communication
  • R. Aparna, B. B. Amberker
  • Computer Science
    2009 First International Communication Systems and Networks and Workshops
  • 2009
This paper uses share-based key management scheme and proposes to reduce the storage at higher level users as compared to the scheme proposed by Dexter et al. by reusing a part of the pre-positioned information as common for all the layers in the system.
Multilayer multicast key management with threshold cryptography
This paper describes how the multi- group scheme is adapted to work with secret shares, and compares this scheme with a naïve multi-stream key-management solution by measuring performance across several critical parameters, including tree degree, multi-group size, and number of shares stored at each node.
A key management scheme for secure group communication using binomial key trees
This paper proposes a new scheme to manage the secure group using the binomial key tree approach, and shows that, for a large group, the average encryption cost and rekey message cost are independent of the size of the group for join operation and logarithmic in size ofThe group for leave operation.
Secure group communications using key graphs
It is shown that the group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves, and the average measured processing time per join/leave increases linearly with the logarithm of group size.
Secure group communication using robust contributory key agreement
This work presents the first robust contributory key agreement protocol resilient to any sequence of group changes, and proves that it provides both virtual synchrony and the security properties of Group Diffie-Hellman, in the presence of any sequences of node failures, recoveries, network partitions, and heals.
A survey of key management for secure group communication
The area of group key management is surveyed, proposed solutions are classified according to those characteristics, and an insight given to their features and goals.
Tree-based group key agreement
This work investigates a novel group key agreement approach which blends key trees with Diffie--Hellman key exchange and yields a secure protocol suite called Tree-based Group Diffie-Hellman (TGDH) that is both simple and fault-tolerant.
Perfectly-Secure Key Distribution for Dynamic Conferences
This paper considers the model where interaction is allowed in the common key computation phase, and shows a gap between the models by exhibiting an interactive scheme in which the user's information is only k + t - 1 times the size of the commonKey.
A Secure and Efficient Conference Key Distribution System (Extended Abstract)
The technique for authentication can be extended and used as the basis for an authentication scheme which is ‘proven’ secure against any type of attack, provided the Discrete Logarithm problem is intractable.
Key Agreement in Dynamic Peer Groups
This paper discusses all group key agreement operations and presents a concrete protocol suite, CLIQUES, which offers complete key agreement services and is based on multiparty extensions of the well-known Diffie-Hellman key exchange method.