{"id":"https://openalex.org/W4312851126","doi":"https://doi.org/10.1109/iscc55528.2022.9912964","title":"TKDA: An Improved Method for K-degree Anonymity in Social Graphs","display_name":"TKDA: An Improved Method for K-degree Anonymity in Social Graphs","publication_year":2022,"publication_date":"2022-06-30","ids":{"openalex":"https://openalex.org/W4312851126","doi":"https://doi.org/10.1109/iscc55528.2022.9912964"},"language":"en","primary_location":{"id":"doi:10.1109/iscc55528.2022.9912964","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc55528.2022.9912964","pdf_url":null,"source":{"id":"https://openalex.org/S4363605780","display_name":"2022 IEEE Symposium on Computers and Communications (ISCC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Symposium on Computers and Communications (ISCC)","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/A5101462707","display_name":"Nan Xiang","orcid":"https://orcid.org/0000-0003-1569-9355"},"institutions":[{"id":"https://openalex.org/I2722730","display_name":"Inner Mongolia University","ror":"https://ror.org/0106qb496","country_code":"CN","type":"education","lineage":["https://openalex.org/I2722730"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Nan Xiang","raw_affiliation_strings":["Wireless Networking and Mobile Computing Laboratory Inner Mongolia University,Hohhot,China","Wireless Networking and Mobile Computing Laboratory Inner Mongolia University, Hohhot, China"],"affiliations":[{"raw_affiliation_string":"Wireless Networking and Mobile Computing Laboratory Inner Mongolia University,Hohhot,China","institution_ids":["https://openalex.org/I2722730"]},{"raw_affiliation_string":"Wireless Networking and Mobile Computing Laboratory Inner Mongolia University, Hohhot, China","institution_ids":["https://openalex.org/I2722730"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029365711","display_name":"Xuebin Ma","orcid":"https://orcid.org/0000-0003-0963-2891"},"institutions":[{"id":"https://openalex.org/I2722730","display_name":"Inner Mongolia University","ror":"https://ror.org/0106qb496","country_code":"CN","type":"education","lineage":["https://openalex.org/I2722730"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuebin Ma","raw_affiliation_strings":["Wireless Networking and Mobile Computing Laboratory Inner Mongolia University,Hohhot,China","Wireless Networking and Mobile Computing Laboratory Inner Mongolia University, Hohhot, China"],"affiliations":[{"raw_affiliation_string":"Wireless Networking and Mobile Computing Laboratory Inner Mongolia University,Hohhot,China","institution_ids":["https://openalex.org/I2722730"]},{"raw_affiliation_string":"Wireless Networking and Mobile Computing Laboratory Inner Mongolia University, Hohhot, China","institution_ids":["https://openalex.org/I2722730"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101462707"],"corresponding_institution_ids":["https://openalex.org/I2722730"],"apc_list":null,"apc_paid":null,"fwci":0.4158,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59529196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","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"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","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/T11045","display_name":"Privacy, Security, and Data Protection","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9936000108718872,"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/graph-traversal","display_name":"Graph traversal","score":0.7799373865127563},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7124025821685791},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7011985778808594},{"id":"https://openalex.org/keywords/anonymity","display_name":"Anonymity","score":0.6723712086677551},{"id":"https://openalex.org/keywords/k-anonymity","display_name":"k-anonymity","score":0.5890707969665527},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5046674013137817},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4942512810230255},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49303147196769714},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47354644536972046},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.4642866849899292},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.4615921974182129},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.44429564476013184},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4276023507118225},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4256514012813568},{"id":"https://openalex.org/keywords/information-loss","display_name":"Information loss","score":0.42034605145454407},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4179174602031708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3898686170578003},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.386912077665329},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.28845226764678955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20238932967185974},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13615041971206665},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10651665925979614}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.7799373865127563},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7124025821685791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7011985778808594},{"id":"https://openalex.org/C178005623","wikidata":"https://www.wikidata.org/wiki/Q308859","display_name":"Anonymity","level":2,"score":0.6723712086677551},{"id":"https://openalex.org/C2777706471","wikidata":"https://www.wikidata.org/wiki/Q17061432","display_name":"k-anonymity","level":3,"score":0.5890707969665527},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5046674013137817},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4942512810230255},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49303147196769714},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47354644536972046},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.4642866849899292},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4615921974182129},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.44429564476013184},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4276023507118225},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4256514012813568},{"id":"https://openalex.org/C2988416141","wikidata":"https://www.wikidata.org/wiki/Q6031139","display_name":"Information loss","level":2,"score":0.42034605145454407},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4179174602031708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3898686170578003},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.386912077665329},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.28845226764678955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20238932967185974},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13615041971206665},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10651665925979614},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc55528.2022.9912964","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc55528.2022.9912964","pdf_url":null,"source":{"id":"https://openalex.org/S4363605780","display_name":"2022 IEEE Symposium on Computers and Communications (ISCC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2098331493","https://openalex.org/W2767039082","https://openalex.org/W2113844214","https://openalex.org/W2176473220","https://openalex.org/W1439490566","https://openalex.org/W2073216087","https://openalex.org/W1657141322","https://openalex.org/W1985313039","https://openalex.org/W63229467","https://openalex.org/W4312851126"],"abstract_inverted_index":{"Data":[0],"anonymization":[1,16,58],"is":[2,60,111],"one":[3],"of":[4,17,116,141],"the":[5,49,56,70,76,81,101,114,117,121,131,139,142],"most":[6],"important":[7],"directions":[8],"in":[9,134],"privacy-preserving.":[10],"However,":[11],"research":[12],"shows":[13],"that":[14,109,128],"simple":[15],"data":[18,133],"does":[19],"not":[20],"protect":[21],"privacy.":[22],"To":[23],"solve":[24],"this":[25],"problem,":[26],"we":[27],"present":[28],"a":[29,41,63],"novel":[30],"and":[31,94,137],"effective":[32],"algorithm":[33,73],"named":[34],"tree-based":[35],"K-degree":[36],"anonymity":[37,43],"(TKDA).":[38],"We":[39],"devise":[40],"new":[42],"sequence":[44,78],"generation":[45],"method":[46],"to":[47,99,113],"reduce":[48],"information":[50],"loss":[51],"for":[52],"social":[53],"graphs.":[54],"Then,":[55],"dynamic":[57],"process":[59],"implemented":[61],"by":[62],"depth-first":[64],"search":[65],"(DFS)":[66],"traversal":[67],"algorithm.":[68],"Finally,":[69],"graph":[71,83],"modification":[72],"based":[74],"on":[75,105,120],"anonymous":[77],"can":[79],"keep":[80],"original":[82,118],"structure":[84],"stable.":[85],"Average":[86,90],"Path":[87],"Length":[88],"(APL),":[89],"Clustering":[91],"Coefficient":[92],"(ACC),":[93],"Transitivity":[95],"(T)":[96],"are":[97],"employed":[98],"evaluate":[100],"method.":[102],"Experimental":[103],"results":[104],"several":[106],"datasets":[107],"show":[108],"TKDA":[110,129],"closer":[112],"values":[115],"graphs":[119],"correlated":[122],"three":[123],"experimental":[124],"metrics,":[125],"which":[126],"indicates":[127],"portrays":[130],"real":[132],"more":[135],"detail":[136],"improves":[138],"utility":[140],"released":[143],"data.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}