{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:28:17Z","timestamp":1743046097407,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_23","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"299-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy in Elections: k-Anonymizing Preference Orders"],"prefix":"10.1007","author":[{"given":"Nimrod","family":"Talmon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Ashur, T., Dunkelman, O.: Poster: on the anonymity of Israel\u2019s general elections. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 1399\u20131402. ACM (2013)","DOI":"10.1145\/2508859.2512510"},{"issue":"7","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2007.12.088","volume":"309","author":"T Biedl","year":"2009","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: On the complexity of crossings in permutations. Discrete Math. 309(7), 1813\u20131823 (2009)","journal-title":"Discrete Math."},{"key":"23_CR3","first-page":"213","volume-title":"Multiagent Systems, 2nd edn.,","author":"F Brandt","year":"2013","unstructured":"Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Weiss, G. (ed.) Multiagent Systems, 2nd edn., pp. 213\u2013283. MIT Press, Cambridge (2013)"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"678","DOI":"10.3390\/a6040678","volume":"6","author":"R Bredereck","year":"2013","unstructured":"Bredereck, R., Nichterlein, A., Niedermeier, R.: Pattern-guided k-anonymity. Algorithms 6(4), 678\u2013701 (2013)","journal-title":"Algorithms"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/978-3-319-07956-1_5","volume-title":"Algorithmic Aspects in Information and Management","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Froese, V., Hartung, S., Nichterlein, A., Niedermeier, R., Talmon, N.: The complexity of degree anonymization by vertex addition. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 44\u201355. Springer, Heidelberg (2014)"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10618-012-0293-7","volume":"28","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Nichterlein, A., Niedermeier, R., Philip, G.: The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Disc. 28(1), 65\u201391 (2014b)","journal-title":"Data Min. Knowl. Disc."},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chong, S., Kash, I.A., Moran, T., Vadhan, S.: Truthful mechanisms for agents that value privacy. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 215\u2013232. ACM (2013)","DOI":"10.1145\/2492002.2482549"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Clifton, C., Tassa, T.: On syntactic anonymity and differential privacy. In: 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), pp. 88\u201393. IEEE (2013)","DOI":"10.1109\/ICDEW.2013.6547433"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-40203-6_27","volume-title":"Computer Security \u2013 ESORICS 2013","author":"\u00c9 Cuvelier","year":"2013","unstructured":"Cuvelier, \u00c9., Pereira, O., Peters, T.: Election verifiability or ballot privacy: do we need to choose? In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 481\u2013498. Springer, Heidelberg (2013)"},{"key":"23_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Heidelberg (2013)"},{"issue":"3\u20134","key":"23_CR12","first-page":"211","volume":"9","author":"C Dwork","year":"2013","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Theoret. Comput. Sci. 9(3\u20134), 211\u2013407 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622. ACM (2001)","DOI":"10.1145\/371920.372165"},{"key":"23_CR14","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: On the role of distances in defining voting rules. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 375\u2013382. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"key":"23_CR15","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-642-39212-2_52","volume-title":"Automata, Languages, and Programming","author":"S Hartung","year":"2013","unstructured":"Hartung, S., Nichterlein, A., Niedermeier, R., Such\u00fd, O.: A refined complexity analysis of degree anonymization in graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 594\u2013606. Springer, Heidelberg (2013)"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 93\u2013106. ACM (2008)","DOI":"10.1145\/1376616.1376629"},{"issue":"1","key":"23_CR20","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. Disc. Data (TKDD) 1(1), 3 (2007)","journal-title":"ACM Trans. Knowl. Disc. Data (TKDD)"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: PrefLib: a library for preferences http:\/\/www.preflib.org. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS, vol. 8176, pp. 259\u2013270. Springer, Heidelberg (2013)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal $$k$$-anonymity. In: Proceedings of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 223\u2013228. ACM (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"23_CR23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"6","key":"23_CR24","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/0167-4048(91)90081-N","volume":"10","author":"H Nurmi","year":"1991","unstructured":"Nurmi, H., Salomaa, A., Santean, L.: Secret ballot elections in computer networks. Comput. Secur. 10(6), 553\u2013560 (1991)","journal-title":"Comput. Secur."},{"issue":"05","key":"23_CR25","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. Int. J. Uncertainty, Fuzziness Knowl. Based Syst. 10(05), 557\u2013570 (2002)","journal-title":"Int. J. Uncertainty, Fuzziness Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:37:19Z","timestamp":1674567439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}