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

Key Generation using Ternary Tree based Group Key Generation for Data Encryption and Classification

by Nikita Gupta, Amit Saxena
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 159 - Number 3
Year of Publication: 2017
Authors: Nikita Gupta, Amit Saxena
10.5120/ijca2017912883

Nikita Gupta, Amit Saxena . Key Generation using Ternary Tree based Group Key Generation for Data Encryption and Classification. International Journal of Computer Applications. 159, 3 ( Feb 2017), 6-11. DOI=10.5120/ijca2017912883

@article{ 10.5120/ijca2017912883,
author = { Nikita Gupta, Amit Saxena },
title = { Key Generation using Ternary Tree based Group Key Generation for Data Encryption and Classification },
journal = { International Journal of Computer Applications },
issue_date = { Feb 2017 },
volume = { 159 },
number = { 3 },
month = { Feb },
year = { 2017 },
issn = { 0975-8887 },
pages = { 6-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume159/number3/26979-2017912883/ },
doi = { 10.5120/ijca2017912883 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:04:43.575982+05:30
%A Nikita Gupta
%A Amit Saxena
%T Key Generation using Ternary Tree based Group Key Generation for Data Encryption and Classification
%J International Journal of Computer Applications
%@ 0975-8887
%V 159
%N 3
%P 6-11
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Here in this paper a new and efficient technique for the Cohort of Keys using Tree based Algorithm is proposed for the Sharing of Data in Secure manner. The Key Group Procedure is implemented for the Sharing of Data where Data Owner who needs to send Data is first Encrypted Information using Tree grounded Key Group and then when Data is received at the other end it is decrypted and Classify as Normal or Abnormal Packet. The Planned Practise realized provides Privacy from various attacks as well as provides less computational and Communication Cost.

References
  1. M. Armbrust et al., “Above the Clouds: A Berkeley View of Cloud Computing,” Univ. California, Berkeley, Tech. Rep. UCBEECS-2009-28, Feb. 2009.
  2. Amazon.com, ―Amazon s3 Availability Event: July 20, 2008,‖ July 2008; http://status.aws.amazon.com/s3-20080720.html
  3. M. Arrington, ―Gmail Disaster: Reports of Mass Email Deletions,” Dec. 2006;
  4. T. Ristenpart et al., “Hey, You, Get Off of My Cloud: Exploring Information Leakage in Third-Party Compute Clouds,” Proc. 16th ACM Conf. Computer and Communications Security, ACM Press, 2009, pp. 199–212.
  5. Maithili Narasimha and Gene Tsudik. DSAC: integrity for outsourced databases with signature aggregation and chaining. Technical report, 2005.
  6. Joseph, Randy Katz, Above the Clouds: A Berkeley View of Cloud Computing, University of California Electrical Engineering & Computer Science, February 10th, 2009.
  7. Patel, Chandrakant D., Shah, Amip J., “Cost Model for Planning, Development, and Operation of a Data Center,” Internet Systems and Storage Laboratory, HP Laboratories, Palo Alto, June 9, 2005.
  8. Alfin Abraham, “An Abuse-Free Optimistic Contract Signing Protocol with Multiple TTPs”, IJCA Special Issue on “Computational Science – New Dimensions & Perspectives” NCCSE, 2011.
  9. 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.
  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. 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.
  12. 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.
  13. 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.
  14. 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.
  15. Lifeng Lai, Siu-Wai Ho,” Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models”, IEEE Transactions on Information Theory, 2015.
  16. K. Kalaivani, K. Renugadevi, Nithya,” Pairwise Independent Network using Key Generation Algorithm”, IOSR Journal of Computer Engineering, 2016.
  17. Sirin Nitinawarat, Chunxuan Ye, Alexander Barg,” Secrete Key Generation for a Pairwise Independent Network Model”, IEEE Transactions on Information Theory, 2010.
  18. Peng Xu, Zhinguo Ding, Xuchu Dai,” The private Key Capacity of a Cooperative Pairwise-Independent Network”, 2015.
Index Terms

Computer Science
Information Sciences

Keywords

Tree based Key Generation AES User Revocation Entropy Network Security Group Key Establishment.

Powered by PhDFocusTM