{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:20:28Z","timestamp":1777962028707,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540852582","type":"print"},{"value":"9783540852599","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85259-9_1","type":"book-chapter","created":{"date-parts":[[2008,8,17]],"date-time":"2008-08-17T05:38:18Z","timestamp":1218951498000},"page":"1-15","source":"Crossref","is-referenced-by-count":4,"title":["How Anonymous Is k-Anonymous? Look at Your Quasi-ID"],"prefix":"10.1007","author":[{"given":"Claudio","family":"Bettini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X. Sean","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","first-page":"217","volume-title":"Proceedings of the 21st International Conference on Data Engineering","author":"R.J. Bayardo Jr.","year":"2005","unstructured":"Bayardo Jr., R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proceedings of the 21st International Conference on Data Engineering, pp. 217\u2013228. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"1_CR2","unstructured":"Claudio Bettini, X., Wang, S., Jajodia, S.: The role of quasi-identifiers in k-anonymity revisited. ACM Computing Research Repository (CoRR) (November 2006) arXiv:cs\/0611035v1"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology\u00a01(1), 65\u201375 (1988)","journal-title":"J. Cryptology"},{"issue":"3","key":"1_CR4","first-page":"329","volume":"2","author":"T. Dalenius","year":"1986","unstructured":"Dalenius, T.: Finding a needle in a haystack - or identifying anonymous census record. Journal of Official Statistics\u00a02(3), 329\u2013336 (1986)","journal-title":"Journal of Official Statistics"},{"key":"1_CR5","first-page":"744","volume-title":"ICDE","author":"A. Gionis","year":"2008","unstructured":"Gionis, A., Mazza, A., Tassa, T.: k-anonymization revisited. In: ICDE, pp. 744\u2013753. IEEE, Los Alamitos (2008)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., Ramakrishnan, R.: Workload-aware anonymization. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2006)","DOI":"10.1145\/1150402.1150435"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1066157.1066164","volume-title":"SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD international conference on Management of data","author":"K. LeFevre","year":"2005","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: efficient full-domain k-anonymity. In: SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp. 49\u201360. ACM Press, New York (2005)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-Diversity: Privacy beyond k-anonymity. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/1055558.1055591","volume-title":"Proceedings of the Twenty-third ACM Symposium on Principles of Database Systems","author":"A. Meyerson","year":"2004","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proceedings of the Twenty-third ACM Symposium on Principles of Database Systems, pp. 223\u2013228. ACM Press, New York (2004)"},{"key":"1_CR10","unstructured":"Mumick, I.S., Pirahesh, H., Ramakrishnan, R.: The magic of duplicates and aggregates. In: VLDB (1990)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44702-4_1","volume-title":"Designing Privacy Enhancing Technologies","author":"A. Pfitzmann","year":"2001","unstructured":"Pfitzmann, A., K\u00f6hntopp, M.: Anonymity, unobservability, and pseudonymity - a proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009, pp. 1\u20139. Springer, Heidelberg (2001)"},{"issue":"6","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents\u2019 identities in microdata release. IEEE Trans. Knowl. Data Eng.\u00a013(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"1_CR13","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 in Knowledge-based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal on Uncertainty, Fuzziness in Knowledge-based Systems"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10115-006-0035-5","volume":"11","author":"K. Wang","year":"2007","unstructured":"Wang, K., Fung, B.C.M., Yu, P.S.: Handicapping attacker\u2019s confidence: An alternative to k-anonymization. Knowledge and Information Systems: An International Journal\u00a011(3), 345\u2013368 (2007)","journal-title":"Knowledge and Information Systems: An International Journal"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Yao, C., Wang, L., Wang, X.S., Jajodia, S.: Indistinguishability: The other aspect of privacy. Secure Data Management, 1\u201317 (2006)","DOI":"10.1007\/11844662_1"}],"container-title":["Lecture Notes in Computer Science","Secure Data Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85259-9_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:23:37Z","timestamp":1606184617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85259-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852582","9783540852599"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85259-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}