An Efficient Group Key Agreement Protocol for Online Social Network

Authors

  • Sowmya.R  Department of Computer Science and Engineering, Dhanalakshmi College of Engineeering, Chennai, Tamil Nadu, India
  • R.Gowri  Department of Computer Science and Engineering, Dhanalakshmi College of Engineeering, Chennai, Tamil Nadu, India
  • D.Hemavathy  Department of Computer Science and Engineering, Dhanalakshmi College of Engineeering, Chennai, Tamil Nadu, India

Keywords:

Data Sharing, Data Privacy, Diffie Hellman, Lower Bound.

Abstract

The objective of this project is to study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocols, which demonstrate that our constructions are rounding efficient. Finally, we construct an actively secure protocol from a passively secure one.

References

  1. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley, New York, 2006.
  2. D. Boneh, A. Sahai and B. Waters, “Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys”, Proc.25th Int’l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT’06) , vol. 4004, pp. 573-592, 2006.
  3. R. Dutta and R. Barua, “Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting”, IEEE Trans. Information Theory, vol. 54, no. 5, pp. 2007-2025, 2008.
  4. D.Boneh and M.Naor,”Traitor tracing with constant size ciphertext”,Proc. 15th ACM Conf. computer and comm. Security, pp.501-510,2008.
  5. R.Safavi-Naini, S.Jiang, “Non-intractive Conference Key Distribution and Its Application”, Proc. The 2008 ACMA symposium on Information, Computer and Communication Security (ASIACCS’08), pp.271-282, 2008
  6. Q.Wu,Y.Mu,W.Susilo,B.Qin and J. Domingo-Ferrer,” Asymmetric group key agreement”,Proc.28  Int’l Conf. Theory and application of cryptographic techniques (EUROCRYPT’09), vol.5479,pp. 153-170,2009.
  7. R.Safavi-Naini, S.Jiang, “Unconditionally Secure Conference Key Distribution: Security Notions, Bounds and Constructions”, International Journal of Foundations of Computer Science, vol.22, no.6, pp.1369-1393, 2011.
  8. X.Lv,H.Li and B.Wang, “Group Key agreement for secure group communication in dynamic peer systems”, J.Parallel  Distrib. comput., vol.72, no.10,pp.1195-1200,2012.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2016-04-30

Issue

Volume 2, Issue 2, March-April-2016

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

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

How to Cite

[1]
Sowmya.R, R.Gowri, D.Hemavathy, " An Efficient Group Key Agreement Protocol for Online Social Network, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 2, Issue 2, pp.122-125, March-April-2016.