{"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}
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.