Authenticated Group Key Agreement Protocols for Error Detection and Correction
DOI:
https://doi.org//10.32628/CSEIT195390Keywords:
Cluster Communication, Key Computation, Euler's Totient Operate, Tanner Graph.Abstract
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.
References
- N. Asokan and P. Ginzboorg, “Key agreement in ad-hoc networks,” Computer Communications, vol. 23, no. 17, pp. 1627-1637, Nov. 2000.
- G. Atenies, M. Steiner, and G. Tsudik, “New multi- party authentication services and key agreement pro-tocols,” IEEE Journal on Selected Areas in Commu-nications, vol. 18, no. 4, pp. 628-639, Apr. 2000.
- S. Basagni, K. Herrin, D. Bruschi, and E. Rosti, “Se-cure pebblenets,” in The Proceedings of 2001 ACM International Sympusium on Mobile Ad Hoc Net-working and computing, pp. 156-163, Long Beach, CA, USA, Oct. 2001. ACM Press.
- K. Becker and U. Wille, “Communication complex-ity of group key distribution,” in The Proceedings of the 5th ACM conference on Computer and Commu-nications security, pp. 1-6. ACM Press, 1998.
- D. Boneh and M. Franklin, “The identity-based encryption from the Weil pairing,” in Advances in Cryptology, LNCS 2139, pp. 229-231. Springer- Verlag, 2001.
- M. Burmester and Y. Desmedt, “A secure and ef-ficient conference key distribution systems,” in Ad-vances in Cryptology - EUROCRYPT ’94, LNCS 950, pp. 275-286. Springer-Verlag, 1995.
- K. Malasri and L. Wang, “Addressing security in medical sensor networks,” in HealthNet ’07, 2007, pp. 7–12.
- C. C. Tan, H. Wang, S. Zhong, and Q. Li, “Body sensor network security: an identity-based cryptography approach,” in ACM WiSec ’08:, 2008, pp. 148–153.
- C. Poon, Y.-T. Zhang, and S.-D. Bao, “A novel biometrics method to secure wireless body area sensor networks for telemedicine and m-health,” IEEE Communications Magazine, vol. 44, no. 4, pp. 73–81, April 2006.
- S. L. Keoh, E. Lupu, and M. Sloman, “Securing body sensor networks: Sensor association and key management,” IEEE PerCom ’09, pp. 1–6, 2009.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.