CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Diffie-Hellman Technique Extended to Efficient and Simpler Group Key Distribution Protocol

by Nistala V.E.S. Murthy, Vankamamidi S. Naresh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 4 - Number 11
Year of Publication: 2010
Authors: Nistala V.E.S. Murthy, Vankamamidi S. Naresh
10.5120/873-1233

Nistala V.E.S. Murthy, Vankamamidi S. Naresh . Diffie-Hellman Technique Extended to Efficient and Simpler Group Key Distribution Protocol. International Journal of Computer Applications. 4, 11 ( August 2010), 1-5. DOI=10.5120/873-1233

@article{ 10.5120/873-1233,
author = { Nistala V.E.S. Murthy, Vankamamidi S. Naresh },
title = { Diffie-Hellman Technique Extended to Efficient and Simpler Group Key Distribution Protocol },
journal = { International Journal of Computer Applications },
issue_date = { August 2010 },
volume = { 4 },
number = { 11 },
month = { August },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume4/number11/873-1233/ },
doi = { 10.5120/873-1233 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:52:47.764633+05:30
%A Nistala V.E.S. Murthy
%A Vankamamidi S. Naresh
%T Diffie-Hellman Technique Extended to Efficient and Simpler Group Key Distribution Protocol
%J International Journal of Computer Applications
%@ 0975-8887
%V 4
%N 11
%P 1-5
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Ever since 2-party Diffie-Hellman exchange was first proposed in 1976, there have been efforts to extend its simplicity and elegance to a group setting. Notable solutions have been proposed by michael Steiner Gene Tsudik Waidner(in 1996) and Recently G.P.Biswas was proposed a contributory group key agreement protocol for generation of multiparty key and compared with other protocol and satisfactory results obtained.

References
  1. Whit Diffie and Martin Hellman. New Directions In Cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
  2. D. G. Steer , L. Strawczynski , W. Diffie , M. Wiener, A secure audio teleconference system, Proceedings on Advances in cryptology, p.520-528, February 1990, Santa Barbara, California, United States
  3. I. Ingemarsson, D. Tang, and C. Wong. A Conference Key Distribution System. IEEE Transactions on Ir,~formation Theory, 28(5):714-720, September 1982.
  4. Hugh Harney, Carl Muckenhirn, and Thomas Rivers. Group Key Management Protocol (GKMP) Architecture. INTERNEToDRAFT, September 1994.
  5. Yi Mu, Yuliang Zheng, and Yan-Xia Lin. Quantum Conference Key Distribution Systems. Technical Report 94- 6, University of Wollongong, NSW, Australia, 1994.
  6. Edward Zuk, Remarks on "The Design of a Conference Key Distribution System", Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.467-468, December 13-16, 1992
  7. Michael K.Just. Methods Of Multi-party Cryptographic Key Establishment. Master's thesis, Ottwa Carb~ton Institute for Computer Science, Caleton University, Ottawa, Ontario, August 1994.
  8. Tzonelih Hwang, Cryptosystem for group oriented cryptography, Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.352-360, February 1991, Aarhus, Denmark
  9. M. Burmester and Y. Desmedt. A Secure And Efficient Conference Key Distribution System. In I.B. Damgard, editor, Advances in Cryptology- EUROCRYPT '94, Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 1994.
  10. C.P. Schnorr. Efficient Signature Generation By Smart Cards. Journal of Cryptology, 4(3):161-174, 1991.
  11. CORPORATE NIST, The digital signature standard, Communications of the ACM, v.35 n.7, p.36-40, July 1992 [doi>10.1145/129902.129904]
  12. Stefan A. Brands, An Efficient Off-line Electronic Cash System Based On The Representation Problem., CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 1993
  13. Bruce Schneier, Applied cryptography (2nd ed.): protocols, algorithms, and source code in C, John Wiley & Sons, Inc., New York, NY, 1995
  14. Michael Steiner , Gene Tsudik , Michael Waidner, Refinement and extension of encrypted key exchange, ACM SIGOPS Operating Systems Review, v.29 n.3, p.22-30, July 1995 [doi>10.1145/206826.206834
  15. T. Matsumoto, Y. Takashima, H. Imai. A Method Of Generating Secret Data Common To All Members Of A Specified Group. IECE Technical Report IT85-3~, September 1985.
  16. Micheal K. Reiter, A Secure Group Membership Protocol, Proceedings of the 1994 IEEE Symposium on Security and Privacy, p.176, May 16-18, 1994
Index Terms

Computer Science
Information Sciences

Keywords

Diffie-Hellman technique DDH problem key distribution key exchange operations secure data transmission

Powered by PhDFocusTM