An approach to Elliptical Curve Cryptography to implement Multilevel Access Control in Defence

Authors

  • M. Aishwarya  Department of Information Science and Engineering, GSSSIETW, Mysuru, Karnataka, India
  • Navya R  Department of Information Science and Engineering, GSSSIETW, Mysuru, Karnataka, India
  • Pooja D  Department of Information Science and Engineering, GSSSIETW, Mysuru, Karnataka, India
  • Poojashree K  Department of Information Science and Engineering, GSSSIETW, Mysuru, Karnataka, India

Keywords:

Defense messaging system, Elliptic Curve cryptography, Global communication, Secure system.

Abstract

Currently, mobile phones are not only used for formal communication but, also for sending and receiving sensitive information. Sending a message is easy, quick and inexpensive. However, protecting the messages from known attacks like man-in-the-middle attack, reply attack and non-repudiation attack is very difficult. Government and Military Organization have also started using messaging for quick and fast actions. The defence messaging system takes a message and forwards it to the intended recipients or parties based on the message criteria for critical action. This system should provide security assistance and should be manageable by Central Administration Authority. The primary goal of this research is to develop a Multilevel Access Control for Defence Messaging System using Elliptical Curve Cryptography. The system developed is secure, multisite and allows for Global communication using the inherent properties of Elliptical Curve Cryptography It provides a greater security with less bit size and it is fast when compared to other schemes. The implementation suggests that it is a secure system which occupies fewer bits and can be used for low power devices.

References

  1. S Akl and P. Taylor. “Cryptographic solution to a problem of access control in a hierarchy”.ACM Transactions on Computer Systems, 1(3)pp :239-248,September 1983.
  2. William stallings,” Cryptography and network security Principles and Practices”, Third Edition,Pearson education.,2001
  3. M Atallah, K. Frikken, and M. Blanton,” Dynamic And Efficient Key Management For AccessHierarchies”, CERIAS Tech Report 2006.
  4. Jason Crampton,” Cryptographically-Enforced Hierarchical Access Control with Multiple Keys”,Journal of Logic and Algebraic Programming April 1, 2009.
  5. K Kumar J.Nafeesa Begum,.V.Sumathy, (2009), “A Novel Approach towards cost EffectiveRegion Based Group Key Agreement Protocol for Ad Hoc Networks” ,Intl. Confernce on Computational Intelligence,Communication Systems and Networks ,2009 CICSYN,09 , July 23-25 2009 published in IEEE Explore.
  6. KKumar, J.Nafeesa Begum ,.V.Sumathy , (2009), “ Efficient Region-Based Group Key Agreement Protocols for Ad Hoc Networks using Elliptic Curve Cryptography”, IEEE International Advance Computing Conference (IACC-2009), Thapar University, Patiala March 6-7 . published in IEEE Explore
  7. R S. Sandhu. “Cryptographic implementation of a tree hierarchy for access control”. Information Processing Letter, 27(2):95.98, Feb. 1988.
  8. X Zou, B. Ramamurthy, and S. Magliveras. “Chinese remainder theorem based hierarchical access control for secure group communications”. Lecture Notes in Computer Science (LNCS), 2229:381.385, Nov. 2001.
  9. X Zou, B. Ramamurthy, and S. S. Magliveras,.” Secure Group Communications over Data Networks”,Springer, New York, NY, USA, ISBN: 0-387-22970-1, Oct. 2004.[
  10. Nafeesa Begum, K. Kumar, V. Sumathy, “Design and implementation of Multi-level access Control in Medical Image Transmission using Symmetric Polynomial based Audio Stegnography”, (IJCSIS) International Journal of Computer science and Information security.

Downloads

Published

2018-05-08

Issue

Section

Research Articles

How to Cite

[1]
M. Aishwarya, Navya R, Pooja D, Poojashree K, " An approach to Elliptical Curve Cryptography to implement Multilevel Access Control in Defence, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 6, pp.37-45, May-June-2018.