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

Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups

by Atul Chaturvedi, Varun Shukla
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 31 - Number 1
Year of Publication: 2011
Authors: Atul Chaturvedi, Varun Shukla
10.5120/3786-5201

Atul Chaturvedi, Varun Shukla . Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups. International Journal of Computer Applications. 31, 1 ( October 2011), 1-4. DOI=10.5120/3786-5201

@article{ 10.5120/3786-5201,
author = { Atul Chaturvedi, Varun Shukla },
title = { Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups },
journal = { International Journal of Computer Applications },
issue_date = { October 2011 },
volume = { 31 },
number = { 1 },
month = { October },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume31/number1/3786-5201/ },
doi = { 10.5120/3786-5201 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:16:57.771184+05:30
%A Atul Chaturvedi
%A Varun Shukla
%T Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups
%J International Journal of Computer Applications
%@ 0975-8887
%V 31
%N 1
%P 1-4
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Braid groups were first introduced by Emil Artin in 1925. First cryptosystem, using Braid groups as a platform was discovered by Anshel et al in 2001. After the publication of this paper several cryptosystems on Braid groups had been designed. In this paper we have proposed a tripartite authenticated key agreement protocol using conjugacy problem which works in a braid group. We have proved that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.

References
  1. Anshel, M.Anshel, B.Fisher,and D.Goldfeld, New key agreement protocols in braid group cryptography, Proc.of CT-RSA 2001,LNCS, 2020,Springer-Verlag, 1-15.
  2. Anshel, M. Anshel and D. Goldfeld, An algebraic method of public-key cryptography, Math. Research Letters, 6 (1999), 287-291.
  3. E. Artin, Theory of braids, Annals of Math.48 (1947),101-126.
  4. J. Birman, Braids, Links, and Mapping Class Groups, Annals of Math. Studies, Princeton Univ. Press (1975).
  5. Atul Chaturvedi and Sunder Lal, An authenticated key agreement protol using conjugacy problem in braid groups, International Journal of Network security, Vol. 6, No. 2, pp. 181 – 184, Mar. 2008. (http://ijns.nchu.edu.tw/)
  6. M.M. Chowdhury, On the security of new key exchange protocols based on the triple decomposition problem, preprint 2007, http://www.aexiv.org/abs/cs.CR/0611065.
  7. M.M. Chowdhury, An authentication scheme using non – commutative semi groups, ieeexplore.ieee.org,2007.
  8. F. A. Garside, The braid group and other groups, Quart. J. Math. Oxford 20-78(1969) 235-254.
  9. K.H.Ko, D.H.Choi, M.S.Cho, and J.W.Lee, New signature scheme using conjugacy problem, (http://eprint.iacr.org/2002/168).
  10. K.H. KO, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, and C Park, New public-key cryptosystem using braid groups, Advances in Cryptology, Proceeding of Crypto - 2000, Lecture Notes in Computer Science 1880, ed. M Bellore, springs Verlag (2000), 166-183.
  11. A. G. Myasnikov, V. Shpilrain and A. Ushakov, Group – based cryptography, Birkhauser, 2008.
  12. V. Shpilrain and A. Ushakov, A new key exchange protocol based on the decomposition problem, contemp. Math. 418 (2006) , 161 – 167.
  13. V. Shpilrain and A. Ushakov, An authentication scheme based on the twisted conjugacy problem, preprint (2008), http://arxiv.org/pdf/math.GR/0805.2701.
  14. H. Sibert, P. Dehornoy, & M. Girault, Entity authentication schemes using braid word reduction,” in International Workshop on Coding and Cryptography (WCC) 2003, Discrete Applied Mathematics, 154-2, Elsevier, 420 – 436 (2006). (http://eprint.iacr.org/2002/187).
  15. B. C. Wang, Y. P. Hu, Sinature scheme based on the root extraction problem over braid groups, ieeexplore.ieee.org, 2009
  16. S. B. Wilson, and A. Menezes, “ Autenticated Diffie – Hellman key agreement protocols”, Proceedings of the 5th Annual Workshop on Selected aeas in Cryptography (SAC’ 98), LNCS, pp. 339 – 361, 1999.
  17. S. B. Wilson, D. Johnson and A. Menezes, Key agreement protocol and their security analysis”, Proceedings of the 6th IMA International Conference on Cryptography and Coding, Vol. 1355, LNCS, pp. 339 – 361, Springer – Verlag, 1998.
  18. W. Yun, X . Gua – Hua, Z. Xing – Kai , B. Wan. Security analysis and design ofproxy signature schemes over braid groups, http://eprint.iacr.org/2009/458
  19. W. Yun, X . Gua – Hua, Z. Xing – Kai , B. Wan. A strong blind signature scheme over braid groups, http://eprint.iacr.org/2009/622.
  20. W. Yun, G. Xiong, W. Bao, and X. Zhang, A ring signature scheme over braid groups, Journal of Electronics, 27 (4), 522 – 527,2010.
Index Terms

Computer Science
Information Sciences

Keywords

Braid group Conjugacy Search Problem authentication tripartite key agreement

Powered by PhDFocusTM