{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:22:35Z","timestamp":1759332155322},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/2535569.2448950","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"157-168","source":"Crossref","is-referenced-by-count":5,"title":["Lightweight privacy-preserving peer-to-peer data integration"],"prefix":"10.14778","volume":"6","author":[{"given":"Ye","family":"Zhang","sequence":"first","affiliation":[{"name":"The Pennsylvania State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wai-Kit","family":"Wong","sequence":"additional","affiliation":[{"name":"Hang Seng Management College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Yiu","sequence":"additional","affiliation":[{"name":"The University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"The University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David W.","family":"Cheung","sequence":"additional","affiliation":[{"name":"The University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335438"},{"key":"e_1_2_1_2_1","volume-title":"UCI Machine Learning Repository","author":"Asuncion A.","year":"2007","unstructured":"A. Asuncion and D. Newman . UCI Machine Learning Repository , 2007 . A. Asuncion and D. Newman. UCI Machine Learning Repository, 2007."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","article-title":"The one-more-RSA-inversion problems and the security of chaum's blind signature scheme","volume":"16","author":"Bellare M.","year":"2003","unstructured":"M. Bellare , C. Namprempre , D. Pointcheval , and M. Semanko . The one-more-RSA-inversion problems and the security of chaum's blind signature scheme . Journal of Cryptology , 16 : 185 - 215 , 2003 . M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problems and the security of chaum's blind signature scheme. Journal of Cryptology, 16:185-215, 2003.","journal-title":"Journal of Cryptology"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0159-9"},{"key":"e_1_2_1_5_1","volume-title":"EUROCRYPT","author":"Camenisch J.","year":"2007","unstructured":"J. Camenisch , G. Neven , and A. Shelat . Simulatable adaptive oblivious transfer . In EUROCRYPT , 2007 . 10.1007\/978-3-540-72540-4_33 J. Camenisch, G. Neven, and A. Shelat. Simulatable adaptive oblivious transfer. In EUROCRYPT, 2007. 10.1007\/978-3-540-72540-4_33"},{"key":"e_1_2_1_6_1","volume-title":"FOCS","author":"Chor B.","year":"1995","unstructured":"B. Chor , E. Kushilevitz , O. Goldreich , and M. Sudan . Private information retrieval . In FOCS , 1995 . B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. In FOCS, 1995."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807249"},{"key":"e_1_2_1_8_1","volume-title":"VLDB","author":"Franconi E.","year":"2004","unstructured":"E. Franconi , G. Kuper , A. Lopatenko , and I. Zaihrayeu . Queries and updates in the coDB peer to peer database system . In VLDB , 2004 . E. Franconi, G. Kuper, A. Lopatenko, and I. Zaihrayeu. Queries and updates in the coDB peer to peer database system. In VLDB, 2004."},{"key":"e_1_2_1_9_1","volume-title":"SIGMOD","author":"Ghinita G.","year":"2008","unstructured":"G. Ghinita , P. Kalnis , A. Khoshgozaran , C. Shahabi , and K.-L. Tan . Private queries in location based services: anonymizers are not necessary . In SIGMOD , 2008 . 10.1145\/1376616.1376631 G. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K.-L. Tan. Private queries in location based services: anonymizers are not necessary. In SIGMOD, 2008. 10.1145\/1376616.1376631"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . Foundations of Cryptography , Volume 2 . Cambridge University Press , 2004 . O. Goldreich. Foundations of Cryptography, Volume 2. Cambridge University Press, 2004."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_2_1_12_1","volume-title":"SIGMOD","author":"Kifer D.","year":"2009","unstructured":"D. Kifer . Attacks on privacy and definetti's theorem . In SIGMOD , 2009 . 10.1145\/1559845.1559861 D. Kifer. Attacks on privacy and definetti's theorem. In SIGMOD, 2009. 10.1145\/1559845.1559861"},{"key":"e_1_2_1_13_1","volume-title":"ICDE","author":"Li N.","year":"2007","unstructured":"N. Li , T. Li , and S. Venkatasubramanian . t-closeness: Privacy beyond k-anonymity and l-diversity . In ICDE , 2007 . N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE, 2007."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the AMS Short Course in Cryptography","author":"Lipton R.","year":"1981","unstructured":"R. Lipton . How to cheat at mental poker . In Proceedings of the AMS Short Course in Cryptography , 1981 . R. Lipton. How to cheat at mental poker. In Proceedings of the AMS Short Course in Cryptography, 1981."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_16_1","volume-title":"Handbook of Applied Cryptography","author":"Menezes A. J.","year":"1996","unstructured":"A. J. Menezes , P. C. van Oorschot , and S. A. Vanstone . Handbook of Applied Cryptography . CRC Press , 1996 . A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996."},{"key":"e_1_2_1_17_1","volume-title":"Computational technology for effective health care: Immediate steps and strategic directions","author":"National Institute of Health.","year":"2009","unstructured":"National Institute of Health. Computational technology for effective health care: Immediate steps and strategic directions , 2009 . http:\/\/www.nlm.nih.gov\/pubs\/reports\/comptech_prepub.pdf. National Institute of Health. Computational technology for effective health care: Immediate steps and strategic directions, 2009. http:\/\/www.nlm.nih.gov\/pubs\/reports\/comptech_prepub.pdf."},{"key":"e_1_2_1_18_1","volume-title":"ICDE","author":"Ng W. S.","year":"2003","unstructured":"W. S. Ng , B. C. Ooi , K.-L. Tan , and A. Zhou . PeerDB: A P2P-based system for distributed data sharing . In ICDE , 2003 . W. S. Ng, B. C. Ooi, K.-L. Tan, and A. Zhou. PeerDB: A P2P-based system for distributed data sharing. In ICDE, 2003."},{"key":"e_1_2_1_19_1","volume-title":"VLDB","author":"Papadopoulos S.","year":"2010","unstructured":"S. Papadopoulos , S. Bakiras , and D. Papadias . Nearest neighbor search with strong location privacy . In VLDB , 2010 . S. Papadopoulos, S. Bakiras, and D. Papadias. Nearest neighbor search with strong location privacy. In VLDB, 2010."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055817"},{"key":"e_1_2_1_22_1","volume-title":"VLDB","author":"Rodr\u00edguez-Gianolli P.","year":"2005","unstructured":"P. Rodr\u00edguez-Gianolli , A. Kementsietsidis , M. Garzetti , I. Kiringa , L. Jiang , M. Masud , R. J. Miller , and J. Mylopoulos . Data sharing in the hyperion peer database system . In VLDB , 2005 . P. Rodr\u00edguez-Gianolli, A. Kementsietsidis, M. Garzetti, I. Kiringa, L. Jiang, M. Masud, R. J. Miller, and J. Mylopoulos. Data sharing in the hyperion peer database system. In VLDB, 2005."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_25_1","volume-title":"SIGMOD","author":"Tatarinov I.","year":"2004","unstructured":"I. Tatarinov and A. Halevy . Efficient query reformulation in peer data management systems . In SIGMOD , 2004 . 10.1145\/1007568.1007629 I. Tatarinov and A. Halevy. Efficient query reformulation in peer data management systems. In SIGMOD, 2004. 10.1145\/1007568.1007629"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/945721.945732"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775142"},{"key":"e_1_2_1_29_1","volume-title":"VLDB","author":"Wong R. C.-W.","year":"2007","unstructured":"R. C.-W. Wong , A. W.-C. Fu , K. Wang , and J. Pei . Minimality attack in privacy preserving data publishing . In VLDB , 2007 . R. C.-W. Wong, A. W.-C. Fu, K. Wang, and J. Pei. Minimality attack in privacy preserving data publishing. In VLDB, 2007."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497517"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2535569.2448950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:04:06Z","timestamp":1672225446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2535569.2448950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.14778\/2535569.2448950"],"URL":"https:\/\/doi.org\/10.14778\/2535569.2448950","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}