Analysis on Security Proof of Two Key Agreement Protocols

2011 ◽  
Vol 186 ◽  
pp. 531-535
Author(s):  
Hui Hua Zhou ◽  
Ming Hui Zheng

Recently, Tseng proposed two group key agreement protocols which are claimed to be provably secure against passive attackers and impersonation attacks over authenticated channel. In each of these works, a security proof of the proposed protocol was presented. In this paper, we revisit Tseng’s security proof and show that the reduction in the proof is invalid. As the replacement, we give a new security proof.

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>


Sign in / Sign up

Export Citation Format

Share Document