File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Lightweight privacy-preserving peer-to-peer data integration

TitleLightweight privacy-preserving peer-to-peer data integration
Authors
KeywordsAttractive solutions
Commutative encryption
Cryptographic techniques
Efficient protocols
Experimental studies
Heterogeneous information
Lightweight protocols
Peer Data Management Systems
Issue Date2013
PublisherVery 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?
AbstractPeer 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 Identifierhttp://hdl.handle.net/10722/190301
ISSN

 

DC FieldValueLanguage
dc.contributor.authorZhang, Yen_US
dc.contributor.authorWong, WKen_US
dc.contributor.authorYiu, SMen_US
dc.contributor.authorMamoulis, Nen_US
dc.contributor.authorCheung, DWLen_US
dc.date.accessioned2013-09-17T15:18:20Z-
dc.date.available2013-09-17T15:18:20Z-
dc.date.issued2013en_US
dc.identifier.citationThe 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-168en_US
dc.identifier.issn2150-8097-
dc.identifier.urihttp://hdl.handle.net/10722/190301-
dc.description.abstractPeer 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.languageengen_US
dc.publisherVery Large Data Base (VLDB) Endowment Inc.. The Journal's web site is located at http://vldb.org/pvldb/index.html-
dc.relation.ispartofProceedings of the VLDB Endowmenten_US
dc.subjectAttractive solutions-
dc.subjectCommutative encryption-
dc.subjectCryptographic techniques-
dc.subjectEfficient protocols-
dc.subjectExperimental studies-
dc.subjectHeterogeneous information-
dc.subjectLightweight protocols-
dc.subjectPeer Data Management Systems-
dc.titleLightweight privacy-preserving peer-to-peer data integrationen_US
dc.typeConference_Paperen_US
dc.identifier.emailZhang, Y: yezhang4@hku.hken_US
dc.identifier.emailWong, WK: wkwong2@cs.hku.hken_US
dc.identifier.emailYiu, SM: smyiu@cs.hku.hken_US
dc.identifier.emailMamoulis, N: nikos@cs.hku.hken_US
dc.identifier.emailCheung, DWL: dcheung@cs.hku.hken_US
dc.identifier.authorityYiu, SM=rp00207en_US
dc.identifier.authorityMamoulis, N=rp00155en_US
dc.identifier.authorityCheung, DWL=rp00101en_US
dc.description.naturelink_to_OA_fulltext-
dc.identifier.scopuseid_2-s2.0-84875117937-
dc.identifier.hkuros221077en_US
dc.identifier.hkuros222125-
dc.identifier.volume6en_US
dc.identifier.issuehttp://dl.acm.org.eproxy1.lib.hku.hk/citation.cfm?id=2448950&CFID=256346001&CFTOKEN=20227168en_US
dc.identifier.spage157en_US
dc.identifier.epage168en_US
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 131029-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats