基于错误的环学习加密方案在电子病历隐私管理中的应用

Umar Abdulkadir, V. O. Waziri, J. Alhassan, I. Ismaila
{"title":"基于错误的环学习加密方案在电子病历隐私管理中的应用","authors":"Umar Abdulkadir, V. O. Waziri, J. Alhassan, I. Ismaila","doi":"10.1109/ITED56637.2022.10051260","DOIUrl":null,"url":null,"abstract":"The electronic health (e-health) systems support a range of electronic devices, wireless links, transmission and storage of data. E-health systems allows communication through a gateway (or central point) in the cloud. Health professionals and teams utilize e-health systems to perform virtual consultations to patients, remote treatment or diagnosis. The success story of e-health systems is often met with problems including: insecure channels of communication, eavesdropping of messages across channels by adversary, profound insider attacks on private information on servers, and healthcare services disruptions. Cryptography or encryption algorithms have been considered as capable of overcoming the privacy and security problems of electronic medical records management. However, certain issues persist with cryptographic-based schemes such as slow processing speed, weak security mechanisms, high computational overheads, and weak public-private keys. In this paper, a lattice-based cryptography, Ring Learning With Error (RLWE) encryption is used to propose a privacy scheme for EMR in cloud environment. The choice of RLWE is due to its provable hardness among conventional lattice problem. The outcomes revealed that, the proposed encryption scheme outperformed comparable asymmetric schemes in terms of elapsed time (0.04sec) against ECDSA (1.11sec), ECC (16.62sec), and RSA (37.95sec). Again, the public key size was better for RLWE (32-bits) only after ECDSA (10-bits), against ECC (97-bits), and RSA (191-bits). Similarly, the private key size for ECC (9-bits) was only better than RLWE(10-bits), against ECDSA (58-bits), and RSA (687-bits) respectively. The proposed encryption scheme is time and memory-efficient; and holds promise for EMRs privacy.","PeriodicalId":246041,"journal":{"name":"2022 5th Information Technology for Education and Development (ITED)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ring Learning With Error-Based Encryption Scheme for the Privacy of Electronic Health Records Management\",\"authors\":\"Umar Abdulkadir, V. O. Waziri, J. Alhassan, I. Ismaila\",\"doi\":\"10.1109/ITED56637.2022.10051260\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The electronic health (e-health) systems support a range of electronic devices, wireless links, transmission and storage of data. E-health systems allows communication through a gateway (or central point) in the cloud. Health professionals and teams utilize e-health systems to perform virtual consultations to patients, remote treatment or diagnosis. The success story of e-health systems is often met with problems including: insecure channels of communication, eavesdropping of messages across channels by adversary, profound insider attacks on private information on servers, and healthcare services disruptions. Cryptography or encryption algorithms have been considered as capable of overcoming the privacy and security problems of electronic medical records management. However, certain issues persist with cryptographic-based schemes such as slow processing speed, weak security mechanisms, high computational overheads, and weak public-private keys. In this paper, a lattice-based cryptography, Ring Learning With Error (RLWE) encryption is used to propose a privacy scheme for EMR in cloud environment. The choice of RLWE is due to its provable hardness among conventional lattice problem. The outcomes revealed that, the proposed encryption scheme outperformed comparable asymmetric schemes in terms of elapsed time (0.04sec) against ECDSA (1.11sec), ECC (16.62sec), and RSA (37.95sec). Again, the public key size was better for RLWE (32-bits) only after ECDSA (10-bits), against ECC (97-bits), and RSA (191-bits). Similarly, the private key size for ECC (9-bits) was only better than RLWE(10-bits), against ECDSA (58-bits), and RSA (687-bits) respectively. The proposed encryption scheme is time and memory-efficient; and holds promise for EMRs privacy.\",\"PeriodicalId\":246041,\"journal\":{\"name\":\"2022 5th Information Technology for Education and Development (ITED)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 5th Information Technology for Education and Development (ITED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITED56637.2022.10051260\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th Information Technology for Education and Development (ITED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITED56637.2022.10051260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

电子卫生系统支持一系列电子设备、无线链路、数据传输和存储。电子医疗系统允许通过云中的网关(或中心点)进行通信。卫生专业人员和团队利用电子卫生系统对患者进行虚拟咨询、远程治疗或诊断。电子卫生系统的成功故事经常遇到一些问题,包括:不安全的通信渠道、攻击者跨渠道窃听消息、对服务器上的私人信息进行深刻的内部攻击以及医疗保健服务中断。密码学或加密算法被认为能够克服电子病历管理的隐私和安全问题。然而,基于密码学的方案仍然存在某些问题,例如处理速度慢、安全机制弱、计算开销高和公私密钥弱。本文提出了一种基于格的加密技术——带错误环学习(RLWE)加密技术,提出了一种云环境下EMR的保密方案。选择RLWE是由于它在常规晶格问题中具有可证明的硬度。结果表明,所提出的加密方案在运行时间(0.04秒)方面优于ECDSA(1.11秒)、ECC(16.62秒)和RSA(37.95秒)。同样,只有在ECDSA(10位)之后,RLWE(32位)的公钥大小才比ECC(97位)和RSA(191位)更好。同样,ECC的私钥大小(9位)只比RLWE(10位)好,ECDSA(58位)和RSA(687位)分别好。所提出的加密方案具有时间和内存效率;并保证电子病历的隐私。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ring Learning With Error-Based Encryption Scheme for the Privacy of Electronic Health Records Management
The electronic health (e-health) systems support a range of electronic devices, wireless links, transmission and storage of data. E-health systems allows communication through a gateway (or central point) in the cloud. Health professionals and teams utilize e-health systems to perform virtual consultations to patients, remote treatment or diagnosis. The success story of e-health systems is often met with problems including: insecure channels of communication, eavesdropping of messages across channels by adversary, profound insider attacks on private information on servers, and healthcare services disruptions. Cryptography or encryption algorithms have been considered as capable of overcoming the privacy and security problems of electronic medical records management. However, certain issues persist with cryptographic-based schemes such as slow processing speed, weak security mechanisms, high computational overheads, and weak public-private keys. In this paper, a lattice-based cryptography, Ring Learning With Error (RLWE) encryption is used to propose a privacy scheme for EMR in cloud environment. The choice of RLWE is due to its provable hardness among conventional lattice problem. The outcomes revealed that, the proposed encryption scheme outperformed comparable asymmetric schemes in terms of elapsed time (0.04sec) against ECDSA (1.11sec), ECC (16.62sec), and RSA (37.95sec). Again, the public key size was better for RLWE (32-bits) only after ECDSA (10-bits), against ECC (97-bits), and RSA (191-bits). Similarly, the private key size for ECC (9-bits) was only better than RLWE(10-bits), against ECDSA (58-bits), and RSA (687-bits) respectively. The proposed encryption scheme is time and memory-efficient; and holds promise for EMRs privacy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信