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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Pairwise Independent Key Generation Algorithm: A Survey

by Nikita Gupta, Amit Saxena, Nakul Jain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 156 - Number 6
Year of Publication: 2016
Authors: Nikita Gupta, Amit Saxena, Nakul Jain
10.5120/ijca2016912468

Nikita Gupta, Amit Saxena, Nakul Jain . Pairwise Independent Key Generation Algorithm: A Survey. International Journal of Computer Applications. 156, 6 ( Dec 2016), 12-18. DOI=10.5120/ijca2016912468

@article{ 10.5120/ijca2016912468,
author = { Nikita Gupta, Amit Saxena, Nakul Jain },
title = { Pairwise Independent Key Generation Algorithm: A Survey },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2016 },
volume = { 156 },
number = { 6 },
month = { Dec },
year = { 2016 },
issn = { 0975-8887 },
pages = { 12-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume156/number6/26712-2016912468/ },
doi = { 10.5120/ijca2016912468 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:02:42.020590+05:30
%A Nikita Gupta
%A Amit Saxena
%A Nakul Jain
%T Pairwise Independent Key Generation Algorithm: A Survey
%J International Journal of Computer Applications
%@ 0975-8887
%V 156
%N 6
%P 12-18
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Key Generation is a technique to provide a secure and efficient generation of Key Pairs so that the keys can’t be attacked by the external or unauthorized users. Since there are various techniques implemented for the generation of keys such as based on Graphical Methods [1]. Here in this paper a review of all the existing techniques implemented for the generation of Key Pairs is analyzed and discuss their various advantages and limitations, so that on the basis of various issues in the existing Key Pairs Generation Techniques a new and efficient technique is implemented in future.n this paper, we describe the formatting guidelines for IJCA Journal Submission.

References
  1. Lifeng Lai, Siu-Wai Ho,” Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models”, IEEE Transactions on Information Theory, 2015.
  2. Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, and Gene Tsudik. On the performance of group key agreement protocols. ACM Trans. Inf. Syst. Secur., 7(3):457{488, August 2004. pages 47.
  3. Alfred J. Menezes, Scott A. Vanstone, and Paul C. Van Oorschot. Handbook of Applied Cryptography. CRC Press, Inc., 1996. pages 21, 22, 45, 46, 47, 48, 51, 52, 99, 105.
  4. Jose A. Onieva1, Jianying Zhou, and Javier Lopez “Analysis of an Asynchronous Multi Party Contract Signing Protocol”, Progress in Cryptology - INDOCRYPT 2005, Lecture Notes in Computer Science, Volume 3797, pp 311-321, and 2005.
  5. Giuseppe Ateniese, “Efficient Verifiable Encryption (and Fair Exchange) of Digital Signatures”, Proceedings of the 6th ACM conference on Computer and communications security, pp. 138 – 146, ACM 1999.
  6. F. Bao, R. H. Deng, and W. Mao, “Efficient and practical fair exchange protocols with off-line TTP,” in Proc. IEEE Symp. Security and Privacy, pp. 77–85, 1998.
  7. J. M. Park, E. Chong, H. J. Siegel, and I. Ray “Constructing fair exchange protocols for e-commerce via distributed computation of RSA signatures,” in Proceedings PODC’03, pp. 172–181, ACM Press, 2003.
  8. G. Wang, “Generic non-repudiation protocols supporting transparent off-line TTP,” Journal of Computer Security, vol. 14, no. 5, pp. 441–467, Nov. 2006
  9. Vinod Moreshwar Vaze,” Digital Signature on-line, One Time Private Key [OTPK]”, International Journal of Scientific & Engineering Research, ISSN:2229-5518, Volume 3, Issue 3, March -2012.
  10. Guilin Wang. “An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature”, IEEE Transactions On Information Forensics And Security, Vol. 5, No. 1, March 2010.
  11. Alfin Abraham, “An Abuse-Free Optimistic Contract Signing Protocol with Multiple TTPs”, IJCA Special Issue on “Computational Science – New Dimensions & Perspectives” NCCSE, 2011.
  12. Giuseppe Ateniese, “Efficient Verifiable Encryption (and Fair Exchange) of Digital Signatures”, Proceedings of the 6th ACM conference on Computer and communications security, pp. 138 – 146, ACM 1999.
  13. Emmanuel Bresson, Olivier Chevassut, and David Pointcheval. Provably authenticated group Diffie-Hellman key exchange - The dynamic case. In Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, ASIACRYPT '01, pages 290{309, London, UK, 2001. Springer-Verlag. pages 52, 79, 87
  14. N. Asokan, V. Shoup, and M. Waidner, “Optimistic fair exchange of digital signatures,” IEEE J. Sel. Areas Commun., vol. 18, no. 4, pp. 591–606, Apr.2000.
  15. F. Bao, G. Wang, J. Zhou, and H. Zhu, “Analysis and improvement of Micali’s fair contract signing protocol,” in Proc. ACISP’04, vol. 3108, LNCS, pp. 176–187, Springer-Verlag, 2004.
  16. J. Garay, M. Jakobsson, and P. MacKenzie, “Abuse-free optimistic contract signing,” in Proc. CRYPTO’99, vol. 1666, LNCS, pp. 449 – 466, Springer-Verlag, 1999.
  17. K. Kalaivani, K. Renugadevi, Nithya,” Pairwise Independent Network using Key Generation Algorithm”, IOSR Journal of Computer Engineering, 2016.
  18. Sirin Nitinawarat, Chunxuan Ye, Alexander Barg,” Secrete Key Generation for a Pairwise Independent Network Model”, IEEE Transactions on Information Theory, 2010.
  19. Peng Xu, Zhinguo Ding, Xuchu Dai,” The private Key Capacity of a Cooperative Pairwise-Independent Network”, 2015.
  20. Peng Xu, Zhinguo Ding, Xuchu Dai,” On the Private Key Capacity of the M-Relay Pairwise Independent Network”, IEEE International Symposium on Information Theory, 2015.
  21. Alfin Abraham, Vinodh Ewards, Harlay Maria Mathew “A Survey on Optimistic Fair Digital Signature Exchange Protocols”, International Journal on Computer Science and Engineering (IJCSE), ISSN: 0975-3397, Vol. 3, No. 2, pp. 821 – 825, Feb 2011.
  22. Mihhail Aizatulin, Henning Schnoor, and Thomas Wilke “Computationally Sound Analysis of a Probabilistic Contract Signing Protocol”, Computer Security – ESORICS 2009, Lecture Notes in Computer Science, Volume 5789, pp. 571 - 586, and 2009.
  23. Ying Zhang, Chenyi Zhang, Jun Pang and Sjouke Mauw “Game-Based Verification of Multi-Party Contract Signing Protocols”, Formal Aspects in Security and Trust, Lecture Notes in Computer Science, Volume 5983, pp 186-200, 2010.
  24. W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. IT-22, no. 6, pp. 644-654, Nov. 1976.
  25. Vinod Moreshwar Vaze,” Digital Signature on-line, One Time Private Key [OTPK]”, International Journal of Scientific& Engineering Research Volume 3, Issue 3, March -2012 1 ISSN22295518”.
  26. H. Pagnia, H. Vogt and F. C. Gartner,” Fair Exchange” The Computer Journal, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Network Security Group Key Establishment Contract Signing Protocol Key Pair Generation Center Key Pairwise Independent Networks.

Powered by PhDFocusTM