{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:38:00Z","timestamp":1776839880105,"version":"3.51.2"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2012,5]]},"abstract":"<jats:p>\n            We consider the problem of computing efficient anonymizations of partitioned databases. Given a database that is partitioned between several sites, either horizontally or vertically, we devise secure distributed algorithms that allow the different sites to obtain a\n            <jats:italic>k<\/jats:italic>\n            -anonymized and \u2113-diverse view of the union of their databases, without disclosing sensitive information. Our algorithms are based on the sequential algorithm [Goldberger and Tassa 2010] that offers anonymizations with utility that is significantly better than other anonymization algorithms, and in particular those that were implemented so far in the distributed setting. Our algorithms can apply to different generalization techniques and utility measures and to any number of sites. While previous distributed algorithms depend on costly cryptographic primitives, the cryptographic assumptions of our solution are surprisingly minimal.\n          <\/jats:p>","DOI":"10.1145\/2188349.2188353","type":"journal-article","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T15:51:28Z","timestamp":1338565888000},"page":"1-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Secure distributed computation of anonymized views of shared databases"],"prefix":"10.1145","volume":"37","author":[{"given":"Tamir","family":"Tassa","sequence":"first","affiliation":[{"name":"The Open University of Israel, Ra'anana, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Gudes","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev, Be'er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the International Conference on Extending Database Technology (EDBT'04)","author":"Aggarwal C.","unstructured":"Aggarwal , C. and Yu , P . 2004. A condensation approach to privacy preserving data mining . In Proceedings of the International Conference on Extending Database Technology (EDBT'04) . 183--199. Aggarwal, C. and Yu, P. 2004. A condensation approach to privacy preserving data mining. In Proceedings of the International Conference on Extending Database Technology (EDBT'04). 183--199."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142374"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_17"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the EUROCRYPT Conference.","author":"Aggarwal G.","unstructured":"Aggarwal , G. , Mishra , N. , and Pinkas , B . 2004. Secure computation of the kth-ranked element . In Proceedings of the EUROCRYPT Conference. Aggarwal, G., Mishra, N., and Pinkas, B. 2004. Secure computation of the kth-ranked element. In Proceedings of the EUROCRYPT Conference."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.42"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA'07)","author":"Byun J.","unstructured":"Byun , J. , Kamra , A. , Bertino , E. , and Li , N . 2007. Efficient k-anonymization using clustering techniques . In Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA'07) . Byun, J., Kamra, A., Bertino, E., and Li, N. 2007. Efficient k-anonymization using clustering techniques. In Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA'07)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020598"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0007-0"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1197\/jamia.M2716"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1197\/jamia.M3144"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/229459.229469"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538909.1538911"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497483"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.129"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1824401.1824405"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775089"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0008-z"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03007-9_13"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-011-0235-9"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559861"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S. Jr. D. G. and Vecchi M. 1983. Optimization by simulated annealing. Sci. 220 4598 671--680.  Kirkpatrick S. Jr. D. G. and Vecchi M. 1983. Optimization by simulated annealing. Sci. 220 4598 671--680.","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.101"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the International Conference on Data Engineering (ICDE'07)","author":"Li N.","unstructured":"Li , N. , Li , T. , and Venkatasubramanian , S . 2007. T-Closeness: Privacy beyond k-anonymity and l-diversity . In Proceedings of the International Conference on Data Engineering (ICDE'07) . 106--115. Li, N., Li, T., and Venkatasubramanian, S. 2007. T-Closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of the International Conference on Data Engineering (ICDE'07). 106--115."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055591"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516388"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.44"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2006.147"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247490"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275508"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021848850200165X"},{"key":"e_1_2_1_42_1","article-title":"K-Concealment: An alternative model of k-type anonymity","author":"Tassa T.","year":"2012","unstructured":"Tassa , T. , Mazza , A. , and Gionis , A. 2012 . K-Concealment: An alternative model of k-type anonymity . Trans. Datab. Privacy. Tassa, T., Mazza, A., and Gionis, A. 2012. K-Concealment: An alternative model of k-type anonymity. Trans. Datab. Privacy.","journal-title":"Trans. Datab. Privacy."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the SIAM International Conference on Data Mining (SDM'07)","author":"Truta T.","unstructured":"Truta , T. , Campan , A. , and Meyer , P . 2007. Generating microdata with p-sensitive k-anonymity property . In Proceedings of the SIAM International Conference on Data Mining (SDM'07) . 124--141. Truta, T., Campan, A., and Meyer, P. 2007. Generating microdata with p-sensitive k-anonymity property. In Proceedings of the SIAM International Conference on Data Mining (SDM'07). 124--141."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150499"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'06)","author":"Xiao X.","unstructured":"Xiao , X. and Tao , Y . 2006. Anatomy: Simple and effective privacy preservation . In Proceedings of the International Conference on Very Large Databases (VLDB'06) . Xiao, X. and Tao, Y. 2006. Anatomy: Simple and effective privacy preservation. In Proceedings of the International Conference on Very Large Databases (VLDB'06)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150504"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the IPSEC'08 Conference. 319--333","author":"Yuan J.","unstructured":"Yuan , J. , Ye , Q. , Wang , H. , and Pieprzyk , J . 2008. Secure computation of the vector dominance problem . In Proceedings of the IPSEC'08 Conference. 319--333 . Yuan, J., Ye, Q., Wang, H., and Pieprzyk, J. 2008. Secure computation of the vector dominance problem. In Proceedings of the IPSEC'08 Conference. 319--333."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065185"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9033-2"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2188349.2188353","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2188349.2188353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:11Z","timestamp":1750236551000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2188349.2188353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["10.1145\/2188349.2188353"],"URL":"https:\/\/doi.org\/10.1145\/2188349.2188353","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]},"assertion":[{"value":"2011-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}