经验教训:使用端到端同态加密构建保护隐私的实体解析自适应PPJoin

Tanmay Ghai, Yixiang Yao, Srivatsan Ravi
{"title":"经验教训:使用端到端同态加密构建保护隐私的实体解析自适应PPJoin","authors":"Tanmay Ghai, Yixiang Yao, Srivatsan Ravi","doi":"10.1109/EuroSPW59978.2023.00018","DOIUrl":null,"url":null,"abstract":"Entity resolution is the task of disambiguating records that refer to the same entity in the real world. In this work, we explore adapting one of the most efficient and accurate Jaccard-based entity resolution algorithms - PPJoin, to the private domain via end-to-end homomorphic encryption. Towards this, we present our precise adaptation: HE-PPJoin that details certain subtle data structure modifications and algorithmic additions needed for correctness and privacy. We implement HE-PPJoin by extending the PALISADE (now merged with OpenFHE) open-source, homomorphic encryption library and perform experiments to analyze its accuracy and incurred overhead. Furthermore, we directly compare HE-PPJoin against P4Join, an existing privacy-preserving variant of PPJoin, which uses hashing for raw content obfuscation (encryption), by demonstrating a rigorous analysis of the efficiency, accuracy, and privacy properties achieved by our adaptation as well as a characterization of those same attributes in P4Join. In building and designing HE-PPJoin, we faced numerous challenges that required making tradeoffs and analyzing possible alternatives. We have thus summarized and detailed all the lessons we have learned, presented throughout the paper, intended as motivating building blocks for future work in this direction.","PeriodicalId":220415,"journal":{"name":"2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lessons Learned: Building a Privacy-Preserving Entity Resolution Adaptation of PPJoin using End-to-End Homomorphic Encryption\",\"authors\":\"Tanmay Ghai, Yixiang Yao, Srivatsan Ravi\",\"doi\":\"10.1109/EuroSPW59978.2023.00018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Entity resolution is the task of disambiguating records that refer to the same entity in the real world. In this work, we explore adapting one of the most efficient and accurate Jaccard-based entity resolution algorithms - PPJoin, to the private domain via end-to-end homomorphic encryption. Towards this, we present our precise adaptation: HE-PPJoin that details certain subtle data structure modifications and algorithmic additions needed for correctness and privacy. We implement HE-PPJoin by extending the PALISADE (now merged with OpenFHE) open-source, homomorphic encryption library and perform experiments to analyze its accuracy and incurred overhead. Furthermore, we directly compare HE-PPJoin against P4Join, an existing privacy-preserving variant of PPJoin, which uses hashing for raw content obfuscation (encryption), by demonstrating a rigorous analysis of the efficiency, accuracy, and privacy properties achieved by our adaptation as well as a characterization of those same attributes in P4Join. In building and designing HE-PPJoin, we faced numerous challenges that required making tradeoffs and analyzing possible alternatives. We have thus summarized and detailed all the lessons we have learned, presented throughout the paper, intended as motivating building blocks for future work in this direction.\",\"PeriodicalId\":220415,\"journal\":{\"name\":\"2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EuroSPW59978.2023.00018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EuroSPW59978.2023.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

实体解析是消除在现实世界中引用同一实体的记录的歧义的任务。在这项工作中,我们探索了通过端到端同态加密将最有效和最准确的基于jaccard的实体解析算法之一PPJoin应用于私有领域。为此,我们提出了精确的调整:HE-PPJoin,详细说明了正确性和隐私所需的某些微妙的数据结构修改和算法添加。我们通过扩展PALISADE(现已与OpenFHE合并)开源、同态加密库来实现HE-PPJoin,并进行实验来分析其准确性和产生的开销。此外,我们将HE-PPJoin与P4Join进行直接比较,P4Join是PPJoin的一种现有的隐私保护变体,它使用散列进行原始内容混淆(加密),通过演示对我们的适应所实现的效率、准确性和隐私属性的严格分析,以及P4Join中这些相同属性的特征。在构建和设计HE-PPJoin时,我们面临着许多挑战,需要做出权衡和分析可能的替代方案。因此,我们总结并详细介绍了我们所学到的所有经验教训,并在整篇论文中提出,旨在为今后在这个方向上的工作提供激励。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lessons Learned: Building a Privacy-Preserving Entity Resolution Adaptation of PPJoin using End-to-End Homomorphic Encryption
Entity resolution is the task of disambiguating records that refer to the same entity in the real world. In this work, we explore adapting one of the most efficient and accurate Jaccard-based entity resolution algorithms - PPJoin, to the private domain via end-to-end homomorphic encryption. Towards this, we present our precise adaptation: HE-PPJoin that details certain subtle data structure modifications and algorithmic additions needed for correctness and privacy. We implement HE-PPJoin by extending the PALISADE (now merged with OpenFHE) open-source, homomorphic encryption library and perform experiments to analyze its accuracy and incurred overhead. Furthermore, we directly compare HE-PPJoin against P4Join, an existing privacy-preserving variant of PPJoin, which uses hashing for raw content obfuscation (encryption), by demonstrating a rigorous analysis of the efficiency, accuracy, and privacy properties achieved by our adaptation as well as a characterization of those same attributes in P4Join. In building and designing HE-PPJoin, we faced numerous challenges that required making tradeoffs and analyzing possible alternatives. We have thus summarized and detailed all the lessons we have learned, presented throughout the paper, intended as motivating building blocks for future work in this direction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信