{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:52:28Z","timestamp":1743155548050,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":8,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_272","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:14:44Z","timestamp":1253088884000},"page":"2137-2139","source":"Crossref","is-referenced-by-count":4,"title":["Privacy Metrics"],"prefix":"10.1007","author":[{"given":"Chris","family":"Clifton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal D. and Aggarwal C.C. On the design and quantification of privacy preserving data mining algorithms. In Proc. 20th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2001, pp. 247\u2013255.","key":"272_CR1_272","DOI":"10.1145\/375551.375602"},{"doi-asserted-by":"crossref","unstructured":"Agrawal R. and Srikant R. Privacy-preserving data mining. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 439\u2013450.","key":"272_CR2_272","DOI":"10.1145\/335191.335438"},{"doi-asserted-by":"crossref","unstructured":"Li N. and Li T. T-closeness: privacy beyond k-anonymity and l-diversity. In Proc. 23rd Int. Conf. on Data Engineering, 2007.","key":"272_CR3_272","DOI":"10.1109\/ICDE.2007.367856"},{"doi-asserted-by":"crossref","unstructured":"Machanavajjhala A., Gehrke J., Kifer D., and Venkitasubramaniam M. l-diversity: privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data, 1(1), No.3, March 2007.","key":"272_CR4_272","DOI":"10.1145\/1217299.1217302"},{"doi-asserted-by":"crossref","unstructured":"Nergiz M., Atzori M., and Clifton C. Hiding the presence of individuals from shared databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2007, pp. 665\u2013676.","key":"272_CR5_272","DOI":"10.1145\/1247480.1247554"},{"doi-asserted-by":"crossref","unstructured":"Nergiz M.E. and Clifton C. Thoughts on k-anonymization. Data Knowl. Eng., 63(3):622\u2013645, December 2007.","key":"272_CR6_272","DOI":"10.1016\/j.datak.2007.03.009"},{"doi-asserted-by":"crossref","unstructured":"\u00d8hrn A. and Ohno-Machado L. Using boolean reasoning to anonymize databases. Artif. Intell. Med., 15(3):235\u2013254, 1999.","key":"272_CR7_272","DOI":"10.1016\/S0933-3657(98)00056-6"},{"doi-asserted-by":"crossref","unstructured":"Sweeney L. Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertainty Fuzziness Knowl.-based Syst., 10(5):557\u2013570, 2002.","key":"272_CR8_272","DOI":"10.1142\/S0218488502001648"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T04:11:36Z","timestamp":1590984696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_272","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}