Common Length Name Representation: An Efficient Privacy-Preserving Scheme

Hanna Farah, Daniel Amyot, K. Emam
{"title":"Common Length Name Representation: An Efficient Privacy-Preserving Scheme","authors":"Hanna Farah, Daniel Amyot, K. Emam","doi":"10.1109/TELERISE.2015.16","DOIUrl":null,"url":null,"abstract":"Privacy-preserving record linkage is a valuable tool in various domains including the healthcare sector. Patient information is usually available in parts at more than one health organization. Given its sensitive nature, and the laws that protect patient privacy, these organizations cannot simply identify their patients to one another in order to complete their medical records. Yet, complete medical records lead to more informed decisions by doctors, therefore resulting in a higher quality of care. There are many methods in the literature that attempt to represent the identity of an individual in a privacy-preserving way to allow privacy-preserving record linkage. However, most of these techniques are subject to frequency attacks. We present a novel scheme for representing the name of an individual in a privacy-preserving manner that guards against frequency attacks, allows for small typing mistakes, and is efficient when linking large datasets.","PeriodicalId":159844,"journal":{"name":"2015 IEEE/ACM 1st International Workshop on TEchnical and LEgal aspects of data pRivacy and SEcurity","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE/ACM 1st International Workshop on TEchnical and LEgal aspects of data pRivacy and SEcurity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELERISE.2015.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Privacy-preserving record linkage is a valuable tool in various domains including the healthcare sector. Patient information is usually available in parts at more than one health organization. Given its sensitive nature, and the laws that protect patient privacy, these organizations cannot simply identify their patients to one another in order to complete their medical records. Yet, complete medical records lead to more informed decisions by doctors, therefore resulting in a higher quality of care. There are many methods in the literature that attempt to represent the identity of an individual in a privacy-preserving way to allow privacy-preserving record linkage. However, most of these techniques are subject to frequency attacks. We present a novel scheme for representing the name of an individual in a privacy-preserving manner that guards against frequency attacks, allows for small typing mistakes, and is efficient when linking large datasets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
公共长度名称表示:一种有效的隐私保护方案
保护隐私的记录链接在包括医疗保健部门在内的各个领域都是一种有价值的工具。患者信息通常可以在多个卫生组织中获得。考虑到它的敏感性,以及保护患者隐私的法律,这些组织不能简单地相互识别他们的患者,以完成他们的医疗记录。然而,完整的医疗记录可以使医生做出更明智的决定,从而提高护理质量。文献中有许多方法试图以保护隐私的方式表示个人的身份,以允许保护隐私的记录链接。然而,这些技术中的大多数都受到频率攻击。我们提出了一种新颖的方案,以一种保护隐私的方式来表示个人的名字,这种方式可以防止频率攻击,允许小的输入错误,并且在链接大型数据集时是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Introducing New Technology into Italian Certified Electronic Mail: A Proposal Common Length Name Representation: An Efficient Privacy-Preserving Scheme Assessment of Access Control Systems Using Mutation Testing A Guide to End-to-End Privacy Accountability Privacy Points as a Method to Support Privacy Impact Assessments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1