{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:29:36Z","timestamp":1742930976285,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642154966"},{"type":"electronic","value":"9783642154973"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15497-3_32","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:51:46Z","timestamp":1283338306000},"page":"524-539","source":"Crossref","is-referenced-by-count":1,"title":["Evaluating Adversarial Partitions"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Pashalidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schiffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11766155_14","volume-title":"Emerging Trends in Information and Communication Security","author":"S. Clau\u00df","year":"2006","unstructured":"Clau\u00df, S.: A framework for quantification of linkability within a privacy-enhancing identity management system. In: M\u00fcller, G. (ed.) ETRICS 2006. LNCS, vol.\u00a03995, pp. 191\u2013205. Springer, Heidelberg (2006)"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-34416-0_3","volume-title":"Data Science and Classification, Mathematics and Statistics","author":"L. Den\u0153ud","year":"2006","unstructured":"Den\u0153ud, L., Gu\u00e9noche, A.: Comparison of distance indices between partitions. In: Batagelj, V., Bock, H.-H., Ferligoj, A., Ziberna, A. (eds.) Data Science and Classification, Mathematics and Statistics, pp. 21\u201328. Springer, Berlin (2006)"},{"key":"32_CR3","first-page":"111","volume-title":"Proceedings of the 2008 ACM Workshop on Privacy in the Electronic Society, WPES 2008","author":"L. Fischer","year":"2008","unstructured":"Fischer, L., Katzenbeisser, S., Eckert, C.: Measuring unlinkability revisited. In: Proceedings of the 2008 ACM Workshop on Privacy in the Electronic Society, WPES 2008, Alexandria, Virginia, USA, October 27, pp. 111\u2013116. ACM Press, New York (2008)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75551-7_1","volume-title":"Privacy Enhancing Technologies","author":"M. Franz","year":"2007","unstructured":"Franz, M., Meyer, B., Pashalidis, A.: Attacking unlinkability: The importance of context. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol.\u00a04776, pp. 1\u201316. Springer, Heidelberg (2007)"},{"key":"32_CR5","volume-title":"Introduction to Clustering Large and High-Dimensional Data","author":"J. Kogan","year":"2007","unstructured":"Kogan, J.: Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1217299.1217302","volume":"1","author":"A. Machanavajjhala","year":"2007","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data\u00a01(1), 3 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"5","key":"32_CR7","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","volume":"98","author":"M. Meil\u0103","year":"2007","unstructured":"Meil\u0103, M.: Comparing clusterings\u2014an information based distance. J. Multivar. Anal.\u00a098(5), 873\u2013895 (2007)","journal-title":"J. Multivar. Anal."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/1102351.1102424","volume-title":"ICML 2005: Proceedings of the 22nd International Conference on Machine Learning","author":"M. Meil\u01ce","year":"2005","unstructured":"Meil\u01ce, M.: Comparing clusterings: an axiomatic view. In: ICML 2005: Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany, pp. 577\u2013584. ACM Press, New York (2005)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Neubauer, M.: Modelling of pseudonymity under probabilistic linkability attacks. In: IEEE International Conference on Computational Science and Engineering, vol.\u00a03, pp. 160\u2013167 (2009)","DOI":"10.1109\/CSE.2009.376"},{"key":"32_CR10","volume-title":"Combinatorial Algorithms","author":"A. Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms, 2nd edn. Academic Press Inc., London (1978)","edition":"2"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Pashalidis, A.: Measuring the effectiveness and the fairness of relation hiding systems. In: Proceedings of the First International Workshop on Multimedia, Information Privacy and Intelligent Computing Systems (2008)","DOI":"10.1109\/APSCC.2008.20"},{"issue":"336","key":"32_CR12","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2307\/2284239","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association\u00a066(336), 846\u2013850 (1971)","journal-title":"Journal of the American Statistical Association"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/978-3-642-03168-7_6","volume-title":"PETS 2009","author":"S. Schiffner","year":"2009","unstructured":"Schiffner, S., Clau\u00df, S.: Using linkability information to attack mix-based anonymity services. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 94\u2013107. Springer, Heidelberg (2009)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-40956-4_3","volume-title":"Privacy Enhancing Technologies","author":"S. Steinbrecher","year":"2003","unstructured":"Steinbrecher, S., K\u00f6psell, S.: Modelling unlinkability. In: Dingledine, R. (ed.) PET 2003. LNCS, vol.\u00a02760, pp. 32\u201347. Springer, Heidelberg (2003)"},{"key":"32_CR15","unstructured":"Wagner, D., Wagner, S.: Comparing clusterings\u2013an overview. Technical Report 2006-04, Faculty of Informatics, University of Karlsruhe, TH (2006)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15497-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:31:38Z","timestamp":1559507498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15497-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642154966","9783642154973"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15497-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}