AUTHENTICATED GROUP KEY TRANSFER PROTOCOL BASED ON SECRET SHARING

Authors

  • Dr. S. Selvakumar SRM Institute of Science and Technology, Kattankulathur, Chennai, India. Author

DOI:

https://doi.org/10.61841/d8e79r76

Keywords:

Social event public expo, session key, puzzle sharing, attestation

Abstract

Key trade shows confidence upon a normally accepted key age place (KGC) to transport session keys and pick session keys to all correspondence components inconspicuously. Normally, KGC encodes session keys under another secret key granted to each substance during enlistment. At the present time, propose an affirmed key trade show reliant on riddle sharing arrangement that KGC can convey bundle key information to all social occasion people right this minute and simply endorsed assembling people can recover the get-together key; yet unapproved customers can't recover the get together key. The mystery of this change is facts provided theoretically secure. We in like manner offer approval to transportation this social event key. Targets and security threats of our forwarded assembling key trade show will be down in brief.

Downloads

Download data is not yet available.

References

1. G.R. Blakley, "Guarding Cryptographic Keys," Proc. Am. Group of Data Handling Soc. (AFIPS '79) Nat'l PC Conf., vol. 48, pp. 313-317, 1979.

2. S. Berkovits, "How to Communicate a Mystery," Proc. Eurocrypt '91 Workshop Advances in Cryptology,

pp. 536-541, 1991.

3. R. Blom, "An Ideal Class of Symmetric Key Age Frameworks," Proc. Eurocrypt '84 Workshop Advances in Cryptology, pp. 335-338, 1984.

4. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, "Perfectly Secure Key Circulation for Dynamic Meetings," Data and Calculation, vol. 146, no. 1, pp. 1-23, Oct. 1998.

5. C. Boyd, "On Key Understanding and Meeting Key Understanding," Proc. Second Australasian Conf. Information Security and Protection (ACISP '97), pp. 294-302, 1997.

6. E. Bresson, O. Chevassut, D. Pointcheval, and J.- J. Quisquater, "Provably Confirmed Gathering Diffie- Hellman Key Trade," Proc. ACM Conf. PC and Comm. Security (CCS '01), pp. 255-264, 2001.

7. E. Bresson, O. Chevassut, and D. Pointcheval, "Provably-Secure Confirmed Gathering Diffie-Hellman Key Trade," ACM Trans. Information and Framework Security, vol. 10, no. 3, pp. 255-264, Aug. 2007.

8. J.M. Bohli, "A Structure for Powerful Gathering Key Understanding," Proc. Int'l Conf. Computational Science and Applications (ICCSA '06), pp. 355-364, 2006.

9. M. Burmester and Y.G. Desmedt, "A Protected and Proficient Gathering Key Appropriation Framework," Proc. Eurocrypt '94 Workshop Advances in Cryptology, pp. 275-286, 1994.

10. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, "Multicast Security: A Scientific classification and Some Productive Developments," Proc. IEEE INFOCOM '99, vol. 2, pp. 708-716, 1999. s

11. J.C. Cheng and C.S. Laih, "Meeting Key Understanding Convention with Non Intuitive Adaptation to internal failure Over Communicate System," Int'l J. Information Security, vol. 8, no. 1, pp. 37-48, 2009.

12. W. Diffie and M.E. Hellman, "New Headings in Cryptography," IEEE Trans. Information Hypothesis, vol. IT-22, no. 6, pp. 644-654, Nov. 1976.

13. M. Eltoweissy, M.H. Heydari, L. Spirits, and I.H. Sudborough, "Combinatorial Enhancement of Gathering Key Administration," J. Framework and Frameworks The executives, vol. 12, no. 1, pp. 33-50, 2004.

14. A. Fiat and M. Naor, "Impart Encryption," Proc. thirteenth Ann. Int'l Cryptology Conf. Advances in Cryptology (Crypto '93), pp. 480-491, 1994.

15. H. Harney, C. Muckenhirn, and T. Streams, "Get-together Key Administration Convention (GKMP) Design," RFC 2094, July 1997.

16. K.H. Huang, Y.F. Chung, H.H. Lee, F. Lai, and T.S. Chen, "A Meeting Key Understanding Convention with Flaw Tolerant Capacity," PC Models and Interfaces, vol. 31, pp. 401-405, Jan. 2009.

17. IEEE 802.11i-2004: Correction 6: Medium Access Control (Macintosh) Security Improvements, 2004.

18. I. Ingemarsson, D.T. Tang, and C.K. Wong, "A Meeting Key Appropriation Framework," IEEE Trans. Information Hypothesis, vol. IT-28, no. 5, pp. 714-720, Sept. 1982.

19. J. Katz and M. Yung, "Versatile Conventions for Verified Gathering Key Trade," J. Cryptology, vol. 20,

pp. 85-113, 2007.

20. C. Laih, J. Lee, and L. Harn, "Another Limit Plan and Its Application in Structuring the Gathering Key Conveyance Cryptosystem," Data Preparing Letters, vol. 32, pp. 95-99, 1989.

21. C.H. Li and J. Pieprzyk, "Meeting Key Understanding from Mystery Sharing," Proc. Fourth Australasian Conf. Information Security and Protection (ACISP '99), pp. 64-76, 1999.

22. A. Perrig, D. Song, and J.D. Tygar, "Elk, Another Convention for Proficient Huge Gathering Key Dissemination," Proc. IEEE Symp. Security and Protection, pp. 247-262, 2001.

23. M.O. Rabin, "Digitized Marks and Open Key Capacities As Unmanageable As Factorization," Specialized Report LCS/TR-212, MIT Research center for Software engineering, 1979.

24. R.L. Rivest, A. Shamir, and L. Adleman, "A Technique for Getting Advanced Marks and Open Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.

25. G. Saze, "Period of Key Predistribution Plans Utilizing Mystery Sharing Plans," Discrete Applied Math., vol. 128, pp. 239-249, 2003.

26. A. Shamir, "How to Share a Mystery," Comm. ACM, vol. 22, no. 11, pp. 612-613, 1979.

27. A.T. Sherman and D.A. McGrew, "Key Foundation in Huge Unique Gatherings Utilizing Single direction Capacity Trees," IEEE Trans. Programming Eng., vol. 29, no. 5, pp. 444-458, May 2003.

28. D.G. Steer, L. Strawczynski, W. Diffie, and M.J. Wiener, "A Safe Sound Video chat Framework," Proc. Eighth Ann. Int'l Cryptology Conf. Advances in Cryptology (Crypto '88), pp. 520-528, 1988.

29. M. Steiner, G. Tsudik, and M. Waidner, "Diffie-Hellman Key Conveyance Reached out to Gathering Correspondence," Proc. Third ACM Conf. PC and Comm. Security (CCS '96), pp. 31-37, 1996.

30. D.R. Stinson, Cryptography Hypothesis and Practice, second ed., CRC Press, 2002.

31. W.G. Tzeng, "A Safe Shortcoming Tolerant Meeting Key Understanding Convention," IEEE Trans. PCs, vol. 51, no. 4, pp. 373-379, Apr. 2002.

Downloads

Published

30.06.2020

Issue

Vol. 24 No. 6 (2020): 24 (6) 2020

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

You are free to:

  1. Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
  2. Adapt — remix, transform, and build upon the material for any purpose, even commercially.
  3. The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

  1. Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  2. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:

You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .

No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

How to Cite

Selvakumar, D. S. (2020). AUTHENTICATED GROUP KEY TRANSFER PROTOCOL BASED ON SECRET SHARING. International Journal of Psychosocial Rehabilitation, 24(6), 6665-6673. https://doi.org/10.61841/d8e79r76