Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution

The entity resolution problem requires finding pairs across datasets that belong to different owners but refer to the same entity in the real world. To train and evaluate solutions (either rule-based or machine-learning-based) to the entity resolution problem, generating a ground truth dataset with...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yao, Yixiang, Jin, Weizhao, Ravi, Srivatsan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Yao, Yixiang
Jin, Weizhao
Ravi, Srivatsan
description The entity resolution problem requires finding pairs across datasets that belong to different owners but refer to the same entity in the real world. To train and evaluate solutions (either rule-based or machine-learning-based) to the entity resolution problem, generating a ground truth dataset with entity pairs or clusters is needed. However, such a data annotation process involves humans as domain oracles to review the plaintext data for all candidate record pairs from different parties, which inevitably infringes the privacy of data owners, especially in privacy-sensitive cases like medical records. To the best of our knowledge, there is no prior work on privacy-preserving ground truth dataset generation, especially in the domain of entity resolution. We propose a novel blind annotation protocol based on homomorphic encryption that allows domain oracles to collaboratively label ground truths without sharing data in plaintext with other parties. In addition, we design a domain-specific easy-to-use language that hides the sophisticated underlying homomorphic encryption layer. Rigorous proof of the privacy guarantee is provided and our empirical experiments via an annotation simulator indicate the feasibility of our privacy-preserving protocol (f-measure on average achieves more than 90\% compared with the real ground truths).
doi_str_mv 10.48550/arxiv.2308.03734
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2308_03734</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2308_03734</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-d03ed4b9c08be9323efb16f8cbf244c00bd71d9381e97065a93c81e55f04283a3</originalsourceid><addsrcrecordid>eNotj8tOwzAQRb1hgQofwAr_QIKTcRJnVZWqPKRIVKX7yI8xtRRi5LiB_D1JYXUfujPSIeQuYykXRcEeZPhxY5oDEymDCvg1OTRSYef6D_rt4smfI31HnOOaPs6toZu-91FG53tqfaD74Eapp2QfcMAwLne7Pro40QMOvjsvwxtyZWU34O2_rsjxaXfcviTN2_PrdtMksqx4Yhig4arWTCisIQe0Kiut0MrmnGvGlKkyU4PIsK5YWcga9OyLwjKeC5CwIvd_by9Q7VdwnzJM7QLXXuDgF1M1Ss4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution</title><source>arXiv.org</source><creator>Yao, Yixiang ; Jin, Weizhao ; Ravi, Srivatsan</creator><creatorcontrib>Yao, Yixiang ; Jin, Weizhao ; Ravi, Srivatsan</creatorcontrib><description>The entity resolution problem requires finding pairs across datasets that belong to different owners but refer to the same entity in the real world. To train and evaluate solutions (either rule-based or machine-learning-based) to the entity resolution problem, generating a ground truth dataset with entity pairs or clusters is needed. However, such a data annotation process involves humans as domain oracles to review the plaintext data for all candidate record pairs from different parties, which inevitably infringes the privacy of data owners, especially in privacy-sensitive cases like medical records. To the best of our knowledge, there is no prior work on privacy-preserving ground truth dataset generation, especially in the domain of entity resolution. We propose a novel blind annotation protocol based on homomorphic encryption that allows domain oracles to collaboratively label ground truths without sharing data in plaintext with other parties. In addition, we design a domain-specific easy-to-use language that hides the sophisticated underlying homomorphic encryption layer. Rigorous proof of the privacy guarantee is provided and our empirical experiments via an annotation simulator indicate the feasibility of our privacy-preserving protocol (f-measure on average achieves more than 90\% compared with the real ground truths).</description><identifier>DOI: 10.48550/arxiv.2308.03734</identifier><language>eng</language><subject>Computer Science - Cryptography and Security ; Computer Science - Information Retrieval</subject><creationdate>2023-08</creationdate><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2308.03734$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2308.03734$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yao, Yixiang</creatorcontrib><creatorcontrib>Jin, Weizhao</creatorcontrib><creatorcontrib>Ravi, Srivatsan</creatorcontrib><title>Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution</title><description>The entity resolution problem requires finding pairs across datasets that belong to different owners but refer to the same entity in the real world. To train and evaluate solutions (either rule-based or machine-learning-based) to the entity resolution problem, generating a ground truth dataset with entity pairs or clusters is needed. However, such a data annotation process involves humans as domain oracles to review the plaintext data for all candidate record pairs from different parties, which inevitably infringes the privacy of data owners, especially in privacy-sensitive cases like medical records. To the best of our knowledge, there is no prior work on privacy-preserving ground truth dataset generation, especially in the domain of entity resolution. We propose a novel blind annotation protocol based on homomorphic encryption that allows domain oracles to collaboratively label ground truths without sharing data in plaintext with other parties. In addition, we design a domain-specific easy-to-use language that hides the sophisticated underlying homomorphic encryption layer. Rigorous proof of the privacy guarantee is provided and our empirical experiments via an annotation simulator indicate the feasibility of our privacy-preserving protocol (f-measure on average achieves more than 90\% compared with the real ground truths).</description><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Information Retrieval</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAQRb1hgQofwAr_QIKTcRJnVZWqPKRIVKX7yI8xtRRi5LiB_D1JYXUfujPSIeQuYykXRcEeZPhxY5oDEymDCvg1OTRSYef6D_rt4smfI31HnOOaPs6toZu-91FG53tqfaD74Eapp2QfcMAwLne7Pro40QMOvjsvwxtyZWU34O2_rsjxaXfcviTN2_PrdtMksqx4Yhig4arWTCisIQe0Kiut0MrmnGvGlKkyU4PIsK5YWcga9OyLwjKeC5CwIvd_by9Q7VdwnzJM7QLXXuDgF1M1Ss4</recordid><startdate>20230807</startdate><enddate>20230807</enddate><creator>Yao, Yixiang</creator><creator>Jin, Weizhao</creator><creator>Ravi, Srivatsan</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230807</creationdate><title>Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution</title><author>Yao, Yixiang ; Jin, Weizhao ; Ravi, Srivatsan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-d03ed4b9c08be9323efb16f8cbf244c00bd71d9381e97065a93c81e55f04283a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Information Retrieval</topic><toplevel>online_resources</toplevel><creatorcontrib>Yao, Yixiang</creatorcontrib><creatorcontrib>Jin, Weizhao</creatorcontrib><creatorcontrib>Ravi, Srivatsan</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yao, Yixiang</au><au>Jin, Weizhao</au><au>Ravi, Srivatsan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution</atitle><date>2023-08-07</date><risdate>2023</risdate><abstract>The entity resolution problem requires finding pairs across datasets that belong to different owners but refer to the same entity in the real world. To train and evaluate solutions (either rule-based or machine-learning-based) to the entity resolution problem, generating a ground truth dataset with entity pairs or clusters is needed. However, such a data annotation process involves humans as domain oracles to review the plaintext data for all candidate record pairs from different parties, which inevitably infringes the privacy of data owners, especially in privacy-sensitive cases like medical records. To the best of our knowledge, there is no prior work on privacy-preserving ground truth dataset generation, especially in the domain of entity resolution. We propose a novel blind annotation protocol based on homomorphic encryption that allows domain oracles to collaboratively label ground truths without sharing data in plaintext with other parties. In addition, we design a domain-specific easy-to-use language that hides the sophisticated underlying homomorphic encryption layer. Rigorous proof of the privacy guarantee is provided and our empirical experiments via an annotation simulator indicate the feasibility of our privacy-preserving protocol (f-measure on average achieves more than 90\% compared with the real ground truths).</abstract><doi>10.48550/arxiv.2308.03734</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2308.03734
ispartof
issn
language eng
recordid cdi_arxiv_primary_2308_03734
source arXiv.org
subjects Computer Science - Cryptography and Security
Computer Science - Information Retrieval
title Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T02%3A53%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Labeling%20without%20Seeing?%20Blind%20Annotation%20for%20Privacy-Preserving%20Entity%20Resolution&rft.au=Yao,%20Yixiang&rft.date=2023-08-07&rft_id=info:doi/10.48550/arxiv.2308.03734&rft_dat=%3Carxiv_GOX%3E2308_03734%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true