Feng Chen, Xiaoqian Jiang, Shuang Wang, Lisa M Schilling, Daniella Meeker, Toan Ong, Michael E Matheny, Jason N Doctor, Lucila Ohno-Machado, Jaideep Vaidya
{"title":"完美安全高效的双方电子健康记录链接。","authors":"Feng Chen, Xiaoqian Jiang, Shuang Wang, Lisa M Schilling, Daniella Meeker, Toan Ong, Michael E Matheny, Jason N Doctor, Lucila Ohno-Machado, Jaideep Vaidya","doi":"10.1109/MIC.2018.112102542","DOIUrl":null,"url":null,"abstract":"<p><p>Patient health data are often found spread across various sources. However, precision medicine and personalized care requires access to the complete medical records. The first step towards this is to enable the linkage of health records spread across different sites. Existing record linkage solutions assume that data is centralized with no privacy/security concerns restricting sharing. However, that is often untrue. Therefore, we design and implement a portable method for privacy-preserving record linkage based on garbled circuits to accurately and securely match records. We also develop a novel approximate matching mechanism that significantly improves efficiency.</p>","PeriodicalId":13121,"journal":{"name":"IEEE Internet Computing","volume":"22 2","pages":"32-41"},"PeriodicalIF":3.7000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5983039/pdf/nihms921192.pdf","citationCount":"0","resultStr":"{\"title\":\"Perfectly Secure and Efficient Two-Party Electronic-Health-Record Linkage.\",\"authors\":\"Feng Chen, Xiaoqian Jiang, Shuang Wang, Lisa M Schilling, Daniella Meeker, Toan Ong, Michael E Matheny, Jason N Doctor, Lucila Ohno-Machado, Jaideep Vaidya\",\"doi\":\"10.1109/MIC.2018.112102542\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Patient health data are often found spread across various sources. However, precision medicine and personalized care requires access to the complete medical records. The first step towards this is to enable the linkage of health records spread across different sites. Existing record linkage solutions assume that data is centralized with no privacy/security concerns restricting sharing. However, that is often untrue. Therefore, we design and implement a portable method for privacy-preserving record linkage based on garbled circuits to accurately and securely match records. We also develop a novel approximate matching mechanism that significantly improves efficiency.</p>\",\"PeriodicalId\":13121,\"journal\":{\"name\":\"IEEE Internet Computing\",\"volume\":\"22 2\",\"pages\":\"32-41\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2018-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5983039/pdf/nihms921192.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Internet Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/MIC.2018.112102542\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2018/1/16 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Internet Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/MIC.2018.112102542","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2018/1/16 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Perfectly Secure and Efficient Two-Party Electronic-Health-Record Linkage.
Patient health data are often found spread across various sources. However, precision medicine and personalized care requires access to the complete medical records. The first step towards this is to enable the linkage of health records spread across different sites. Existing record linkage solutions assume that data is centralized with no privacy/security concerns restricting sharing. However, that is often untrue. Therefore, we design and implement a portable method for privacy-preserving record linkage based on garbled circuits to accurately and securely match records. We also develop a novel approximate matching mechanism that significantly improves efficiency.
期刊介绍：
This magazine provides a journal-quality evaluation and review of Internet-based computer applications and enabling technologies. It also provides a source of information as well as a forum for both users and developers. The focus of the magazine is on Internet services using WWW, agents, and similar technologies. This does not include traditional software concerns such as object-oriented or structured programming, or Common Object Request Broker Architecture (CORBA) or Object Linking and Embedding (OLE) standards. The magazine may, however, treat the intersection of these software technologies with the Web or agents. For instance, the linking of ORBs and Web servers or the conversion of KQML messages to object requests are relevant technologies for this magazine. An article strictly about CORBA would not be. This magazine is not focused on intelligent systems. Techniques for encoding knowledge or breakthroughs in neural net technologies are outside its scope, as would be an article on the efficacy of a particular expert system. Internet Computing focuses on technologies and applications that allow practitioners to leverage off services to be found on the Internet.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
