Skip to main content
SpringerLink
Log in

Secure key sharing scheme using Hamiltonian path

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

Cryptography plays a crucial role in safeguarding data from unauthorized access and unnoticed alterations during transmission. It relies on cryptographic algorithms and keys as fundamental components of secure systems. Across diverse security domains, cryptography is employed to shield sensitive information, from confidential IT data to financial and healthcare records. The foundation of data security in cryptography lies in the sharing of cryptographic keys between parties. This paper explores a key sharing approach involving a trusted third party, as well as the utilization of graph-based properties to establish secure key exchange. By leveraging cryptographic techniques, users can ensure the integrity and confidentiality of their data, immune to malicious breaches. Notably, the method’s effectiveness relies on the graph properties of the Hamiltonian path sequence, establishing robust security into the algorithm. The encryption and decryption procedures within this system exhibit a time complexity of O(n), which scales with data size. It’s important to recognize that the complexity of discovering the Hamiltonian path is further compounded by an increase in data volume.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Data availability

Data available on request from the authors.

Code availability

Code available on request from the authors.

References

  1. Stallings W (2006) Cryptography and network security, 4/E. Pearson Education India, Noida

    Google Scholar 

  2. Ayushi A, Deshmukh M (2021) 3-D plane based extended Shamir’s secret sharing. Int J Inf Technol 13:609–612

    Google Scholar 

  3. Pande D et al (2023) Single secret sharing scheme using Chinese remainder theorem, modified Shamir’s scheme and XOR operation. Wirel Pers Commun 130(2):957–985

    Article  Google Scholar 

  4. Rawat AS, Deshmukh M, Singh M (2023) A novel multi secret image sharing scheme for different dimension secrets. Multimed Tools Appl 82:35183–35219

    Article  Google Scholar 

  5. Rawat AS, Deshmukh M, Singh M (2023) Natural share-based lightweight (n, n) single secret image sharing scheme using LSB stuffing for medical images. J Supercomput 1–30

  6. Rawat AS, Deshmukh M, Singh M (2023) QR shares based secret sharing scheme using DWT, random permutation and arithmetic modulo operation for QR secret. In: 10th international conference on signal processing and integrated networks (SPIN), pp 772–777

  7. Rawat AS, Deshmukh M, Singh M (2023) Meaningful shares based single secret sharing scheme using Chinese remainder theorem and XOR operation. In: 10th international conference on signal processing and integrated networks (SPIN), pp 597–602

  8. Amudha P, Charles Sagayaraj AC, Shantha Sheela AC (2018) An application of graph theory in cryptography. Int J Pure Appl Math 119.13:375–383

    Google Scholar 

  9. Sharma P, Purushothama BR (2022) Securing polynomial based group key management scheme against strong active adversary model. Int J Inf Technol 14(5):2329–2334

    Google Scholar 

  10. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126

    Article  MathSciNet  MATH  Google Scholar 

  11. Abdeldaym RS, Abd Elkader HM, Hussein R (2019) Modified RSA algorithm using two public key and Chinese remainder theorem. IJ Electron Inf Eng 10(1):51–64

    Google Scholar 

  12. Rawat AS, Deshmukh M (2021) Computation and communication efficient Chinese remainder theorem based multi-party key generation using modified RSA. In: Security and privacy. Springer, Singapore, pp. 25–32

  13. Çavuşoğlu Ü et al (2018) A novel hybrid encryption algorithm based on chaos and S-AES algorithm. Nonlinear Dyn 92:1745–1759

    Article  Google Scholar 

  14. Zodpe H, Sapkal A (2020) An efficient AES implementation using FPGA with enhanced security features. J King Saud Univ Eng Sci 32(2):115–122

    Google Scholar 

  15. Mohd NAA, Ashawesh AYA (2021) Enhanced AES algorithm based on 14 rounds in securing data and minimizing processing time. J Phys Conf Ser 1793(1):012066

    Article  Google Scholar 

  16. Han S-J, Oh H-S, Park J (1996) The improved data encryption standard (DES) algorithm. In: Proceedings of ISSSTA’95 international symposium on spread spectrum techniques and applications, vol 3, pp 1310–1314

  17. Sivakumar TK et al (2017) Enhanced secure data encryption standard (ES-DES) algorithm using extended substitution box (S-Box). Int J Appl Eng Res 12(21):11365–11373

    Google Scholar 

  18. Diffie W, Hellman ME (2022) New directions in cryptography. In: Democratizing cryptography: the work of Whitfield Diffie and Martin Hellman, vol 22, no 6, pp 365–390

  19. Rawat AS, Deshmukh M (2019) Efficient extended Diffie–Hellman key exchange protocol. In: International conference on computing, power and communication technologies (GUCON). IEEE

  20. Rawat AS, Deshmukh M (2020) Communication efficient merkle-tree based authentication scheme for smart grid. In: IEEE 5th international conference on computing communication and automation (ICCCA), pp 693–698

  21. Koblitz N, Menezes A, Vanstone S (2000) The state of elliptic curve cryptography. Des Codes Cryptogr 19:173–193

    Article  MathSciNet  MATH  Google Scholar 

  22. Mehibel N, Hamadouche M (2017) A new approach of elliptic curve Diffie–Hellman key exchange. In: 5th international conference on electrical engineering-Boumerdes (ICEE-B), pp 1–6

  23. Rawat A, Deshmukh M (2020) Tree and elliptic curve based efficient and secure group key agreement protocol. J Inf Secur Appl 55:102599

    Google Scholar 

  24. Lawal OM et al (2021) An improved hybrid scheme for e-payment security using elliptic curve cryptography. Int J Inf Technol 13:139–153

    Google Scholar 

  25. Deshmukh M, Rawat AS (2023) Lightweight symmetric key encryption for text using XOR operation and permutation matrix. Int J Inf Technol 15(7):1–8

  26. Elia M, Piva M, Schipani D (2015) The Rabin cryptosystem revisited. Appl Algebra Eng Commun Comput 26:251–275

    Article  MathSciNet  MATH  Google Scholar 

  27. Grewal JK (2015) ElGamal: public-key cryptosystem. Math and Computer Science Department, Indiana State University, Terre Haute

    Google Scholar 

  28. Meadows CA (1996) Analyzing the Needham–Schroeder public key protocol: a comparison of two approaches. In: Computer security-ESORICS 96: 4th European symposium on research in computer security Rome, pp 25–27

  29. Bellovin SM, Merritt M (1990) Limitations of the Kerberos authentication system. ACM SIGCOMM Comput Commun Rev 20(5):119–132

    Article  Google Scholar 

  30. Neuman BC, Ts’o T (1994) Kerberos: an authentication service for computer networks. IEEE Commun Mag 32(9):33–38

    Article  Google Scholar 

  31. Abdullah AM (2017) Advanced encryption standard (AES) algorithm to encrypt and decrypt data. Cryptogr Netw Secur 16(1):11

    Google Scholar 

  32. Rawat AS, Deshmukh M (2021) Computation and communication efficient secure group key exchange protocol for low configuration system. Int J Inf Technol 13.3:839–843

    Google Scholar 

  33. Sharma P, Purushothama BR (2023) Cryptanalysis of a secure and efficient Diffie–Hellman based key agreement scheme. Int J Inf Technol 15(2):981–989

    Google Scholar 

Download references

Funding

This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors.

Author information

Authors and Affiliations

  1. National Institute of Technology, Uttarakhand, Srinagar, India

    Maroti Deshmukh & Arjun Singh Rawat

Authors
  1. Maroti Deshmukh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arjun Singh Rawat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maroti Deshmukh.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deshmukh, M., Rawat, A.S. Secure key sharing scheme using Hamiltonian path. Int. j. inf. tecnol. 15, 4141–4147 (2023). https://doi.org/10.1007/s41870-023-01502-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-023-01502-5

Keywords

Search

Navigation