{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:46Z","timestamp":1725491806451},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_40","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"439-450","source":"Crossref","is-referenced-by-count":6,"title":["k-Anonymization with Minimal Loss of Information"],"prefix":"10.1007","author":[{"given":"Aristides","family":"Gionis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory - ICDT 2005","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363. Springer, Heidelberg (2004)"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the kth-ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027. Springer, Heidelberg (2004)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.: On the design and quantification of privacy preserving data mining lgorithms. In: PODS (2001)","DOI":"10.1145\/375551.375602"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD (2000)","DOI":"10.1145\/342009.335438"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R., Thomas, D.: Privacy preserving OLAP. In: SIGMOD (2005)","DOI":"10.1145\/1066157.1066187"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: The SuLQ framework. In: PODS (2005)","DOI":"10.1145\/1065167.1065184"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","author":"S. Chawla","year":"2005","unstructured":"Chawla, S., Dwork, C., McSherry, F., Smith, A., Wee, H.: Toward privacy in public databases. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378. Springer, Heidelberg (2005)"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"40_CR9","first-page":"17","volume":"14","author":"A.G. DeWaal","year":"1999","unstructured":"DeWaal, A.G., Willenborg, L.C.R.J.: Information loss through global recoding and local suppression. Netherlands Official Statistics, Special issue on SDC\u00a014, 17\u201320 (1999)","journal-title":"Netherlands Official Statistics, Special issue on SDC"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS (2003)","DOI":"10.1145\/773153.773173"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Nissim, K.: Privacy-preserving data mining on vertically partitioned databases. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152. Springer, Heidelberg (2004)"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: PODS (2003)","DOI":"10.1145\/773153.773174"},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Freedman","year":"2004","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027. Springer, Heidelberg (2004)"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"40_CR15","first-page":"256","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. JCSS\u00a09, 256\u2013278 (1974)","journal-title":"JCSS"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Mishra, N., Nissim, K.: Simulatable auditing. In: PODS (2005)","DOI":"10.1145\/1065167.1065183"},{"key":"40_CR17","first-page":"244","volume":"6","author":"J. Kleinberg","year":"2003","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Auditing boolean attributes. JCSS\u00a06, 244\u2013253 (2003)","journal-title":"JCSS"},{"issue":"3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"Journal of Cryptology"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: PODS (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"40_CR20","first-page":"1010","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondent\u2019s privacy in microdata release. TKDE\u00a013, 1010\u20131027 (2001)","journal-title":"TKDE"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information (abstract). In: PODS (1998)","DOI":"10.1145\/275487.275508"},{"issue":"5","key":"40_CR22","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-Anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"},{"key":"40_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0121-9","volume-title":"Elements of Statistical Disclosure Control","author":"L. Willenborg","year":"2001","unstructured":"Willenborg, L., DeWaal, T.: Elements of Statistical Disclosure Control. Springer, Heidelberg (2001)"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:22:55Z","timestamp":1619518975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_40","relation":{},"subject":[]}}