Loading…
A cryptographic method to have a secure communication of health care digital data into the cloud
Cloud computing is a technology that holds great promise and has potential to revolutionize the healthcare sector. Many security and privacy issues are brought up by the cloud’s centralization of data for both patients and healthcare professionals. There is a need for maintaining secrecy in communic...
Saved in:
Published in: | Automatika 2024-01, Vol.65 (1), p.373-386 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Cloud computing is a technology that holds great promise and has potential to revolutionize the healthcare sector. Many security and privacy issues are brought up by the cloud’s centralization of data for both patients and healthcare professionals. There is a need for maintaining secrecy in communication in exchanging medical data between the sender and the receiver, which can be done by cryptography. This article presents a cryptographic algorithm (encryption and decryption) to have a secure communication of digital health care confidential data using DNA cryptography and Huffman coding. The interesting property is the cipher size obtained from our algorithm is equal to the size of the cipher obtained from the character set of given data. Security analysis is provided to show the security of data when stored and transmitted to the cloud. The cryptographic requirements, key space analysis, key and plain text sensitivity, sensitive score analysis, sensitivity and specificity, optimal threshold, randomness analysis, uniqueness of implementation, entropies of binary bits, DNA bases, DNA bases with Huffman code, Huffman encoded binary bits and cloud service provider’s risk are analyzed. The method proposed is compared with other cryptographic methods and results that it is more secure and stronger than other methods. |
---|---|
ISSN: | 0005-1144 1848-3380 |
DOI: | 10.1080/00051144.2023.2301240 |