{"id":"https://openalex.org/W2052806235","doi":"https://doi.org/10.1145/1055558.1055591","title":"On the complexity of optimal K-anonymity","display_name":"On the complexity of optimal K-anonymity","publication_year":2004,"publication_date":"2004-06-14","ids":{"openalex":"https://openalex.org/W2052806235","doi":"https://doi.org/10.1145/1055558.1055591","mag":"2052806235"},"language":"en","primary_location":{"id":"doi:10.1145/1055558.1055591","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1055558.1055591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113788789","display_name":"Adam Meyerson","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Meyerson","raw_affiliation_strings":["University of California, Los Angeles, CA","University of California, Los Angeles. CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California, Los Angeles. CA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":46.2609,"has_fulltext":false,"cited_by_count":829,"citation_normalized_percentile":{"value":0.99864778,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-anonymity","display_name":"k-anonymity","score":0.6975658535957336},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.6894820332527161},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6457896828651428},{"id":"https://openalex.org/keywords/anonymity","display_name":"Anonymity","score":0.6216322183609009},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5873651504516602},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5873163938522339},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5371016263961792},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5092788934707642},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.49343863129615784},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4203079640865326},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4181835651397705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37587136030197144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36450889706611633},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36064910888671875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3357756733894348},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32504481077194214},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1913793385028839}],"concepts":[{"id":"https://openalex.org/C2777706471","wikidata":"https://www.wikidata.org/wiki/Q17061432","display_name":"k-anonymity","level":3,"score":0.6975658535957336},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.6894820332527161},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6457896828651428},{"id":"https://openalex.org/C178005623","wikidata":"https://www.wikidata.org/wiki/Q308859","display_name":"Anonymity","level":2,"score":0.6216322183609009},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5873651504516602},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5873163938522339},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5371016263961792},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5092788934707642},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.49343863129615784},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4203079640865326},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4181835651397705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37587136030197144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36450889706611633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36064910888671875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3357756733894348},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32504481077194214},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1913793385028839},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1055558.1055591","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1055558.1055591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1999602050","https://openalex.org/W2035071899","https://openalex.org/W2040924621","https://openalex.org/W2093099348","https://openalex.org/W2110868467","https://openalex.org/W2128906841","https://openalex.org/W2130099852","https://openalex.org/W2159024459","https://openalex.org/W2630394794","https://openalex.org/W2914418376","https://openalex.org/W4248358572"],"related_works":["https://openalex.org/W2381086482","https://openalex.org/W2355715322","https://openalex.org/W223766737","https://openalex.org/W2353100240","https://openalex.org/W1625052858","https://openalex.org/W3105058304","https://openalex.org/W2010323877","https://openalex.org/W2057844631","https://openalex.org/W1987868057","https://openalex.org/W1755217240"],"abstract_inverted_index":{"The":[0],"technique":[1],"of":[2,32,35,50,73,76,105,131],"k-anonymization":[3,34],"has":[4],"been":[5],"proposed":[6],"in":[7,94,110,143],"the":[8,40,55,74,77,92,95,103,106,129,132],"literature":[9],"as":[10],"an":[11,69],"alternative":[12],"way":[13],"to":[14,45,52],"release":[15],"public":[16],"information,":[17],"while":[18],"ensuring":[19],"both":[20],"data":[21,24],"privacy":[22],"and":[23],"integrity.":[25],"We":[26,57,134],"prove":[27],"that":[28,67],"two":[29],"general":[30],"versions":[31],"optimal":[33,65],"relations":[36],"are":[37],"NP-hard,":[38],"including":[39],"suppression":[41],"version":[42],"which":[43],"amounts":[44],"choosing":[46],"a":[47,60,87,122],"minimum":[48],"number":[49],"entries":[51],"delete":[53],"from":[54],"relation.":[56,133],"also":[58],"present":[59],"polynomial":[61],"time":[62],"algorithm":[63,107,116,137],"for":[64],"k-anonymity":[66],"achieves":[68],"approximation":[70],"ratio":[71],"independent":[72],"size":[75],"database,":[78],"when":[79],"k":[80],"is":[81,86,97,108,121,128],"constant.":[82],"In":[83],"particular,":[84],"it":[85],"O(k":[88,123],"log":[89,124],"k)-approximation":[90],"where":[91,126],"constant":[93],"big-O":[96],"no":[98],"more":[99,114],"than":[100],"4,":[101],"However,":[102],"runtime":[104],"exponential":[109],"k.":[111],"A":[112],"slightly":[113],"clever":[115],"removes":[117],"this":[118,136],"condition,":[119],"but":[120],"m)-approximation,":[125],"m":[127],"degree":[130],"believe":[135],"could":[138],"potentially":[139],"be":[140],"quite":[141],"fast":[142],"practice.":[144]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":22},{"year":2021,"cited_by_count":34},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":38},{"year":2018,"cited_by_count":33},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":43},{"year":2015,"cited_by_count":33},{"year":2014,"cited_by_count":51},{"year":2013,"cited_by_count":55},{"year":2012,"cited_by_count":52}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}