Constant round group key agreement protocols: A comparative study

2011 ◽  
Vol 30 (8) ◽  
pp. 643-678 ◽  
Author(s):  
Eleftheria Makri ◽  
Elisavet Konstantinou
2011 ◽  
Vol 13 (3) ◽  
pp. 429-442 ◽  
Author(s):  
Eleni Klaoudatou ◽  
Elisavet Konstantinou ◽  
Georgios Kambourakis ◽  
Stefanos Gritzalis

Author(s):  
K. Ravikumar ◽  
N. P. Sureshkumar

Group verification and essential deal represents an essential position in security. The important thing deal methods must promise confidentiality and reliability of message. Important Deal Process offers essential progress in safety to guard reliability, consumer namelessness and confidentiality of information. Tradi- tional essential administration options reported within the litera-ture absence each the flexibleness and hardiness required to cope with the powerful character of sudden networks. in this report, we are likely to propose 2 different n-party echt essential deal methods enabling certified nodes to gener-ate their particular treatment keys. the principal method presents a remedy reinforced heap methods befitting net-works with incomplete framework and consists of a large num- ber of nodes. one-to-many multicast circumstances because a positive 3rd party (TTP) (or an assortment thereof) located at, or very near to, the method of getting conversation, may help ongoing function among an ar-bitrary partition for as long since it provides the supply. this is often adequate because most one-to-many controls entirely try to present ongoing protected function among one partition comprising the supply.</p>


2013 ◽  
Vol 380-384 ◽  
pp. 2256-2261
Author(s):  
Gang Yao ◽  
Li Guo

Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.


Sign in / Sign up

Export Citation Format

Share Document