{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:46:58Z","timestamp":1775054818761,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"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":[],"published-print":{"date-parts":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066165","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["To do or not to do"],"prefix":"10.1145","author":[{"given":"Laks V. S.","family":"Lakshmanan","sequence":"first","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond T.","family":"Ng","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ganesh","family":"Ramesh","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/76894.76895"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_17"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375602"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/371090.371092"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.2002.1029724"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.09.001"},{"key":"e_1_3_2_1_11_1","first-page":"14","article-title":"Disclosure Limitation using perturbation and related methods for Categorical Data","author":"Fienberg S. E.","year":"1998","unstructured":"Fienberg S. E. et. al. Disclosure Limitation using perturbation and related methods for Categorical Data . Journal of Office Statistics , 14 , 1998 .]] Fienberg S. E. et. al. Disclosure Limitation using perturbation and related methods for Categorical Data. Journal of Office Statistics, 14, 1998.]]","journal-title":"Journal of Office Statistics"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775089"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380877"},{"key":"e_1_3_2_1_14_1","first-page":"16","article-title":"A mildly exponential approximation algorithm for the permanent","author":"Jerrum U.","year":"1996","unstructured":"M. Jerrum and U. Vazirani . A mildly exponential approximation algorithm for the permanent . Algorithmica 16 , 1996 .]] M. Jerrum and U. Vazirani. A mildly exponential approximation algorithm for the permanent. Algorithmica 16, 1996.]]","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.704129"},{"key":"e_1_3_2_1_17_1","volume-title":"RR 96-04","author":"Moore R. A.","year":"1996","unstructured":"Moore Jr . R. A. Controlled Data-Swapping Techniques for Masking Public Use Microdata Sets. Statistical Research Division Report Series , RR 96-04 , US Bureau of Census , Washington D. C. , 1996 .]] Moore Jr. R. A. Controlled Data-Swapping Techniques for Masking Public Use Microdata Sets. Statistical Research Division Report Series, RR 96-04, US Bureau of Census, Washington D. C., 1996.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/331983.331986"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055591"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772865"},{"key":"e_1_3_2_1_21_1","first-page":"5","article-title":"Approximating the permanent: A simple approach","author":"Rasmussen L. E","year":"1994","unstructured":"Rasmussen L. E . Approximating the permanent: A simple approach . Random Structures and Algorithms , 5 , 1994 .]] Rasmussen L. E. Approximating the permanent: A simple approach. Random Structures and Algorithms, 5, 1994.]]","journal-title":"Random Structures and Algorithms"},{"key":"e_1_3_2_1_22_1","volume-title":"IEEE Symposium on Research in Security and Privacy","author":"Samarati P.","year":"1998","unstructured":"Samarati P. and Sweeney L . Protecting Privacy when Disclosing Information: k-anonymity and its Enforcement through Generalization and Suppression . IEEE Symposium on Research in Security and Privacy , 1998 .]] Samarati P. and Sweeney L. Protecting Privacy when Disclosing Information: k-anonymity and its Enforcement through Generalization and Suppression. IEEE Symposium on Research in Security and Privacy, 1998.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1994.383392"},{"key":"e_1_3_2_1_25_1","first-page":"8","article-title":"The Complexity of Computing the Permanent","author":"Valiant L. G","year":"1979","unstructured":"Valiant L. G . The Complexity of Computing the Permanent . Theoretical Computer Science , 8 , 1979 .]] Valiant L. G. The Complexity of Computing the Permanent. Theoretical Computer Science, 8, 1979.]]","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316700"}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066165","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:18Z","timestamp":1750262898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066165"}},"subtitle":["the dilemma of disclosing anonymized data"],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":27,"alternative-id":["10.1145\/1066157.1066165","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066165","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}