Privacy preserving schema and data matching

Monica Scannapieco, Ilya Figotin, Elisa Bertino, Ahmed Elmagarmid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

101 Citations (Scopus)

Abstract

In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need is often in contrast with privacy requirements concerning the data stored by the sources. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGMOD International Conference on Management of Data
Pages653-664
Number of pages12
DOIs
Publication statusPublished - 30 Oct 2007
Externally publishedYes
EventSIGMOD 2007: ACM SIGMOD International Conference on Management of Data - Beijing, China
Duration: 12 Jun 200714 Jun 2007

Other

OtherSIGMOD 2007: ACM SIGMOD International Conference on Management of Data
CountryChina
CityBeijing
Period12/6/0714/6/07

Fingerprint

Vector spaces
Industry

Keywords

  • Privacy
  • Record matching

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Scannapieco, M., Figotin, I., Bertino, E., & Elmagarmid, A. (2007). Privacy preserving schema and data matching. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 653-664) https://doi.org/10.1145/1247480.1247553

Privacy preserving schema and data matching. / Scannapieco, Monica; Figotin, Ilya; Bertino, Elisa; Elmagarmid, Ahmed.

Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. p. 653-664.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Scannapieco, M, Figotin, I, Bertino, E & Elmagarmid, A 2007, Privacy preserving schema and data matching. in Proceedings of the ACM SIGMOD International Conference on Management of Data. pp. 653-664, SIGMOD 2007: ACM SIGMOD International Conference on Management of Data, Beijing, China, 12/6/07. https://doi.org/10.1145/1247480.1247553
Scannapieco M, Figotin I, Bertino E, Elmagarmid A. Privacy preserving schema and data matching. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. p. 653-664 https://doi.org/10.1145/1247480.1247553
Scannapieco, Monica ; Figotin, Ilya ; Bertino, Elisa ; Elmagarmid, Ahmed. / Privacy preserving schema and data matching. Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. pp. 653-664
@inproceedings{ea3b10e946e84c1e96caaf051d66e322,
title = "Privacy preserving schema and data matching",
abstract = "In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need is often in contrast with privacy requirements concerning the data stored by the sources. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance.",
keywords = "Privacy, Record matching",
author = "Monica Scannapieco and Ilya Figotin and Elisa Bertino and Ahmed Elmagarmid",
year = "2007",
month = "10",
day = "30",
doi = "10.1145/1247480.1247553",
language = "English",
isbn = "1595936866",
pages = "653--664",
booktitle = "Proceedings of the ACM SIGMOD International Conference on Management of Data",

}

TY - GEN

T1 - Privacy preserving schema and data matching

AU - Scannapieco, Monica

AU - Figotin, Ilya

AU - Bertino, Elisa

AU - Elmagarmid, Ahmed

PY - 2007/10/30

Y1 - 2007/10/30

N2 - In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need is often in contrast with privacy requirements concerning the data stored by the sources. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance.

AB - In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need is often in contrast with privacy requirements concerning the data stored by the sources. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance.

KW - Privacy

KW - Record matching

UR - http://www.scopus.com/inward/record.url?scp=35448932873&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35448932873&partnerID=8YFLogxK

U2 - 10.1145/1247480.1247553

DO - 10.1145/1247480.1247553

M3 - Conference contribution

AN - SCOPUS:35448932873

SN - 1595936866

SN - 9781595936868

SP - 653

EP - 664

BT - Proceedings of the ACM SIGMOD International Conference on Management of Data

ER -