{"id":"https://openalex.org/W4415293122","doi":"https://doi.org/10.23919/jcin.2025.11207209","title":"An Analytic Hierarchy Process Based Access Control Algorithm for Zero-Trust Architecture","display_name":"An Analytic Hierarchy Process Based Access Control Algorithm for Zero-Trust Architecture","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4415293122","doi":"https://doi.org/10.23919/jcin.2025.11207209"},"language":null,"primary_location":{"id":"doi:10.23919/jcin.2025.11207209","is_oa":false,"landing_page_url":"https://doi.org/10.23919/jcin.2025.11207209","pdf_url":null,"source":{"id":"https://openalex.org/S4210178728","display_name":"Journal of Communications and Information Networks","issn_l":"2096-1081","issn":["2096-1081","2509-3312"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Communications and Information Networks","raw_type":"journal-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":null,"display_name":"Yuan Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuan Liu","raw_affiliation_strings":["College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101781340","display_name":"Jun Yan","orcid":"https://orcid.org/0000-0001-7113-0249"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Yan","raw_affiliation_strings":["College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100777576","display_name":"Wei Wang","orcid":"https://orcid.org/0000-0002-5974-1589"},"institutions":[{"id":"https://openalex.org/I4210136793","display_name":"Peng Cheng Laboratory","ror":"https://ror.org/03qdqbt06","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210136793"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Wang","raw_affiliation_strings":["Pengcheng Laboratory, Shenzhen 518000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pengcheng Laboratory, Shenzhen 518000, China","institution_ids":["https://openalex.org/I4210136793"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1990,"currency":"USD","value_usd":1990},"apc_paid":null,"fwci":2.4024,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.90815194,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"10","issue":"3","first_page":"268","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9538999795913696,"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"}},"topics":[{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9538999795913696,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/analytic-hierarchy-process","display_name":"Analytic hierarchy process","score":0.6502000093460083},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5648000240325928},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5426999926567078},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5317999720573425},{"id":"https://openalex.org/keywords/access-control","display_name":"Access control","score":0.5044999718666077},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.45249998569488525},{"id":"https://openalex.org/keywords/bayesian-network","display_name":"Bayesian network","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C87345402","wikidata":"https://www.wikidata.org/wiki/Q485202","display_name":"Analytic hierarchy process","level":2,"score":0.6502000093460083},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5648000240325928},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5454000234603882},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5426999926567078},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5317999720573425},{"id":"https://openalex.org/C527821871","wikidata":"https://www.wikidata.org/wiki/Q228502","display_name":"Access control","level":2,"score":0.5044999718666077},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.45249998569488525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4377000033855438},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3797000050544739},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33880001306533813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32170000672340393},{"id":"https://openalex.org/C44492722","wikidata":"https://www.wikidata.org/wiki/Q327069","display_name":"Conditional probability","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28949999809265137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2858999967575073},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.26980000734329224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/jcin.2025.11207209","is_oa":false,"landing_page_url":"https://doi.org/10.23919/jcin.2025.11207209","pdf_url":null,"source":{"id":"https://openalex.org/S4210178728","display_name":"Journal of Communications and Information Networks","issn_l":"2096-1081","issn":["2096-1081","2509-3312"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Communications and Information Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"With":[0],"the":[1,7,41,49,54,58,61,65,74,81,88,97,104,106,113,120,132,142,149,156,162,167,169,178],"rapid":[2],"development":[3],"of":[4,84,103,135,145],"Internet":[5],"technology,":[6],"network":[8],"access":[9,29,43,137,140,170],"control":[10,30,44,171],"has":[11],"received":[12],"much":[13],"attention,":[14],"especially":[15],"for":[16,141],"zero-trust":[17],"architecture":[18],"(ZTA).":[19],"In":[20],"this":[21],"paper,":[22],"an":[23],"analytic":[24],"hierarchy":[25,108,151],"process":[26],"(AHP)":[27],"based":[28],"algorithm":[31,180],"using":[32],"machine":[33],"learning":[34],"and":[35,64,100,138],"Bayesian":[36,125],"probability":[37,126],"is":[38,46,77,92,110,116,128,153,159,172],"proposed.":[39],"Firstly,":[40],"actual":[42],"problem":[45],"formulated":[47],"as":[48],"AHP":[50],"model":[51,76],"which":[52],"decomposes":[53],"decision-related":[55],"elements":[56],"into":[57],"goal":[59],"layer,":[60],"criterion":[62],"layer":[63],"alternative":[66],"layer.":[67],"To":[68],"obtain":[69],"more":[70],"accurate":[71],"feature":[72],"weights,":[73],"XGBoost":[75],"introduced":[78],"to":[79,118,130],"compute":[80],"importance":[82],"score":[83],"each":[85,146],"feature.":[86,147],"And":[87,148],"pairwise":[89],"comparison":[90],"matrix":[91,121],"constructed.":[93],"Then,":[94],"by":[95,161],"calculating":[96],"maximum":[98],"eigenvalue":[99],"corresponding":[101],"eigenvector":[102],"matrix,":[105],"single":[107],"sorting":[109,152],"achieved.":[111,154],"Moreover,":[112],"consistency":[114],"verification":[115],"proposed":[117,179],"ensure":[119],"consistency.":[122],"Next,":[123],"a":[124],"method":[127],"used":[129],"calculate":[131],"conditional":[133],"weights":[134],"allowed":[136],"denied":[139],"attribute":[143],"values":[144],"total":[150],"Last,":[155],"optimal":[157],"threshold":[158],"determined":[160],"Youden":[163],"index.":[164],"Compared":[165],"with":[166],"threshold,":[168],"estimated.":[173],"Experimental":[174],"results":[175],"illustrated":[176],"that":[177],"performs":[181],"better":[182],"than":[183],"some":[184],"existing":[185],"methods.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-18T00:00:00"}