File Download
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-84875117937
- WOS: WOS:000219757700002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Lightweight privacy-preserving peer-to-peer data integration
Title | Lightweight privacy-preserving peer-to-peer data integration |
---|---|
Authors | |
Keywords | Attractive solutions Commutative encryption Cryptographic techniques Efficient protocols Experimental studies Heterogeneous information Lightweight protocols Peer Data Management Systems |
Issue Date | 2013 |
Publisher | Very Large Data Base (VLDB) Endowment Inc.. The Journal's web site is located at http://vldb.org/pvldb/index.html |
Citation | The 39th International Conference on Very Large Data Bases (VLDB 2013), Riva del Garda, Trento, Italy, 26-30 August 2013. In Proceedings of the VLDB Endowment, 2013, v. 6 n. 3, p. 157-168 How to Cite? |
Abstract | Peer Data Management Systems (PDMS) are an attractive solution for managing distributed heterogeneous information. When a peer (client) requests data from another peer (server) with a different schema, translations of the query and its answer are done by a sequence of intermediate peers (translators). There are two privacy issues in this P2P data integration process: (i) answer privacy: no unauthorized parties (including the translators) should learn the query result; (ii) mapping privacy: the schema and the value mappings used by the translators to perform the translation should not be revealed to other peers. Elmeleegy and Ouzzani proposed the PPP protocol that is the first to support privacy-preserving querying in PDMS. However, PPP suffers from several shortcomings. First, PPP does not satisfy the requirement of answer privacy, because it is based on commutative encryption; we show that this issue can be fixed by adopting another cryptographic technique called oblivious transfer. Second, PPP adopts a weaker notion for mapping privacy, which allows the client peer to observe certain mappings done by translators. In this paper, we develop a lightweight protocol, which satisfies mapping privacy and extend it to a more complex one that facilitates parallel translation by peers. Furthermore, we consider a stronger adversary model where there may be collusions among peers and propose an efficient protocol that guards against collusions. We conduct an experimental study on the performance of the proposed protocols using both real and synthetic data. The results show that the proposed protocols not only achieve a better privacy guarantee than PPP, but they are also more efficient. © 2013 VLDB Endowment. |
Persistent Identifier | http://hdl.handle.net/10722/190301 |
ISSN | 2023 Impact Factor: 2.6 2023 SCImago Journal Rankings: 2.666 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Y | en_US |
dc.contributor.author | Wong, WK | en_US |
dc.contributor.author | Yiu, SM | en_US |
dc.contributor.author | Mamoulis, N | en_US |
dc.contributor.author | Cheung, DWL | en_US |
dc.date.accessioned | 2013-09-17T15:18:20Z | - |
dc.date.available | 2013-09-17T15:18:20Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.citation | The 39th International Conference on Very Large Data Bases (VLDB 2013), Riva del Garda, Trento, Italy, 26-30 August 2013. In Proceedings of the VLDB Endowment, 2013, v. 6 n. 3, p. 157-168 | en_US |
dc.identifier.issn | 2150-8097 | - |
dc.identifier.uri | http://hdl.handle.net/10722/190301 | - |
dc.description.abstract | Peer Data Management Systems (PDMS) are an attractive solution for managing distributed heterogeneous information. When a peer (client) requests data from another peer (server) with a different schema, translations of the query and its answer are done by a sequence of intermediate peers (translators). There are two privacy issues in this P2P data integration process: (i) answer privacy: no unauthorized parties (including the translators) should learn the query result; (ii) mapping privacy: the schema and the value mappings used by the translators to perform the translation should not be revealed to other peers. Elmeleegy and Ouzzani proposed the PPP protocol that is the first to support privacy-preserving querying in PDMS. However, PPP suffers from several shortcomings. First, PPP does not satisfy the requirement of answer privacy, because it is based on commutative encryption; we show that this issue can be fixed by adopting another cryptographic technique called oblivious transfer. Second, PPP adopts a weaker notion for mapping privacy, which allows the client peer to observe certain mappings done by translators. In this paper, we develop a lightweight protocol, which satisfies mapping privacy and extend it to a more complex one that facilitates parallel translation by peers. Furthermore, we consider a stronger adversary model where there may be collusions among peers and propose an efficient protocol that guards against collusions. We conduct an experimental study on the performance of the proposed protocols using both real and synthetic data. The results show that the proposed protocols not only achieve a better privacy guarantee than PPP, but they are also more efficient. © 2013 VLDB Endowment. | - |
dc.language | eng | en_US |
dc.publisher | Very Large Data Base (VLDB) Endowment Inc.. The Journal's web site is located at http://vldb.org/pvldb/index.html | - |
dc.relation.ispartof | Proceedings of the VLDB Endowment | en_US |
dc.subject | Attractive solutions | - |
dc.subject | Commutative encryption | - |
dc.subject | Cryptographic techniques | - |
dc.subject | Efficient protocols | - |
dc.subject | Experimental studies | - |
dc.subject | Heterogeneous information | - |
dc.subject | Lightweight protocols | - |
dc.subject | Peer Data Management Systems | - |
dc.title | Lightweight privacy-preserving peer-to-peer data integration | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Zhang, Y: yezhang4@hku.hk | en_US |
dc.identifier.email | Wong, WK: wkwong2@cs.hku.hk | en_US |
dc.identifier.email | Yiu, SM: smyiu@cs.hku.hk | en_US |
dc.identifier.email | Mamoulis, N: nikos@cs.hku.hk | en_US |
dc.identifier.email | Cheung, DWL: dcheung@cs.hku.hk | en_US |
dc.identifier.authority | Yiu, SM=rp00207 | en_US |
dc.identifier.authority | Mamoulis, N=rp00155 | en_US |
dc.identifier.authority | Cheung, DWL=rp00101 | en_US |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-84875117937 | - |
dc.identifier.hkuros | 221077 | en_US |
dc.identifier.hkuros | 222125 | - |
dc.identifier.volume | 6 | en_US |
dc.identifier.issue | http://dl.acm.org.eproxy1.lib.hku.hk/citation.cfm?id=2448950&CFID=256346001&CFTOKEN=20227168 | en_US |
dc.identifier.spage | 157 | en_US |
dc.identifier.epage | 168 | en_US |
dc.identifier.isi | WOS:000219757700002 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 131029 | - |
dc.identifier.issnl | 2150-8097 | - |