椭圆曲线上智能医疗的可追踪匿名互认证方案

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Yujia Xie, Dongmei Li, Xiaomei Zhang, Wenjing Lv
{"title":"椭圆曲线上智能医疗的可追踪匿名互认证方案","authors":"Yujia Xie,&nbsp;Dongmei Li,&nbsp;Xiaomei Zhang,&nbsp;Wenjing Lv","doi":"10.1002/cpe.70063","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The rapid development of big data technologies has exacerbated the challenge of maintaining patient privacy in smart healthcare environments. Although previous mutual patient–physician authentication systems achieve basic anonymization, patients' communication addresses are still exposed, and attackers can analyze transaction records to establish correlations between users' addresses and even obtain their real identities. To address this problem, we propose a user anonymization scheme based on the elliptic curve discrete logarithmic problem assumption, which aims to prevent malicious interception and theft of patients' personal data by obfuscating the identity of registered users. By combining identity-based encryption with advanced anonymization techniques and reconstructing signatures of knowledge, traceability is achieved while ensuring that only the intended recipient with the corresponding private key can decrypt the data. The validation shows that our system guarantees unlinkability and anonymity while resisting hijacking attacks and man-in-the-middle attacks, and it is simulated using JPBC 2.0.0 (Jdk version 14.0.1), which shows that the communication overhead needs 808 bytes and that the computation overhead for system initialization, signature, and validation are 102, 167, and 70 ms, respectively.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 9-11","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Traceable and Anonymous Mutual Authentication Scheme for Smart Healthcare on Elliptic Curves\",\"authors\":\"Yujia Xie,&nbsp;Dongmei Li,&nbsp;Xiaomei Zhang,&nbsp;Wenjing Lv\",\"doi\":\"10.1002/cpe.70063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>The rapid development of big data technologies has exacerbated the challenge of maintaining patient privacy in smart healthcare environments. Although previous mutual patient–physician authentication systems achieve basic anonymization, patients' communication addresses are still exposed, and attackers can analyze transaction records to establish correlations between users' addresses and even obtain their real identities. To address this problem, we propose a user anonymization scheme based on the elliptic curve discrete logarithmic problem assumption, which aims to prevent malicious interception and theft of patients' personal data by obfuscating the identity of registered users. By combining identity-based encryption with advanced anonymization techniques and reconstructing signatures of knowledge, traceability is achieved while ensuring that only the intended recipient with the corresponding private key can decrypt the data. The validation shows that our system guarantees unlinkability and anonymity while resisting hijacking attacks and man-in-the-middle attacks, and it is simulated using JPBC 2.0.0 (Jdk version 14.0.1), which shows that the communication overhead needs 808 bytes and that the computation overhead for system initialization, signature, and validation are 102, 167, and 70 ms, respectively.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 9-11\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70063\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70063","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

大数据技术的快速发展加剧了在智能医疗环境中维护患者隐私的挑战。虽然以前的医患互鉴系统实现了基本的匿名化,但患者的通信地址仍然是暴露的,攻击者可以通过分析交易记录来建立用户地址之间的关联,甚至获得用户的真实身份。为了解决这一问题,我们提出了一种基于椭圆曲线离散对数问题假设的用户匿名化方案,该方案旨在通过混淆注册用户的身份来防止恶意拦截和窃取患者的个人数据。通过将基于身份的加密与高级匿名化技术相结合并重构知识签名,实现了可追溯性,同时确保只有具有相应私钥的预期接收者才能解密数据。验证表明,我们的系统在抵御劫持攻击和中间人攻击的同时保证了不可链接性和匿名性,并使用JPBC 2.0.0 (Jdk版本14.0.1)进行了模拟,结果表明,通信开销需要808字节,系统初始化、签名和验证的计算开销分别为102、167和70 ms。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Traceable and Anonymous Mutual Authentication Scheme for Smart Healthcare on Elliptic Curves

The rapid development of big data technologies has exacerbated the challenge of maintaining patient privacy in smart healthcare environments. Although previous mutual patient–physician authentication systems achieve basic anonymization, patients' communication addresses are still exposed, and attackers can analyze transaction records to establish correlations between users' addresses and even obtain their real identities. To address this problem, we propose a user anonymization scheme based on the elliptic curve discrete logarithmic problem assumption, which aims to prevent malicious interception and theft of patients' personal data by obfuscating the identity of registered users. By combining identity-based encryption with advanced anonymization techniques and reconstructing signatures of knowledge, traceability is achieved while ensuring that only the intended recipient with the corresponding private key can decrypt the data. The validation shows that our system guarantees unlinkability and anonymity while resisting hijacking attacks and man-in-the-middle attacks, and it is simulated using JPBC 2.0.0 (Jdk version 14.0.1), which shows that the communication overhead needs 808 bytes and that the computation overhead for system initialization, signature, and validation are 102, 167, and 70 ms, respectively.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信