A Cryptography-Based Secure Privacy Preservation of the Sensitive Data in Healthcare Domain

Authors

  • S. Joseph Gabriel Research Scholar, Department of Computer Science, Periyar University, Salem
  • P. Sengottuvelan Professor, Department of Computer Science, Periyar University centre for PG and Research Studies, Dharmapuri, Tamilnadu, India

Keywords:

Cryptography, Diffie Hellman key exchange, RSA, Ubiquitous computing

Abstract

With the advent of technical advancements in the field of digitalization there is a lot of data available in the web. But there are also many sensitive data which requires protection from adversaries. Privacy preservation is very crucial to preserve the sensitive data that is stored in the cloud. Cryptographic techniques provide a good mechanism to protect the sensitive data. In this work we discuss about how we use the cryptographic techniques to preserve the privacy of data and we develop a better framework for protecting the sensitive data. In this work we utilized a Diffie Hellman key exchange algorithm for securely communicating between the client and server environment and how this algorithm provides a secure measure is being discussed and it is compared with the RSA algorithm and also a frame work for effective management of the details of the patients and providing proper support to the patients and how there is a tremendous change brought by the ubiquitous computing and how it can be used to enhance the healthcare is also being discussed. There is a comparison of the computation time of the algorithms is being considered and which algorithm is optimal is being suggested.

Downloads

Published

2024-05-29

How to Cite

S. Joseph Gabriel, & P. Sengottuvelan. (2024). A Cryptography-Based Secure Privacy Preservation of the Sensitive Data in Healthcare Domain. Journal of Computational Analysis and Applications (JoCAAA), 33(06), 1103–1108. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1048

Issue

Section

Articles

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.