{"id":"https://openalex.org/W3181338812","doi":"https://doi.org/10.1145/3528101","title":"Valued Authorization Policy Existence Problem: Theory and Experiments","display_name":"Valued Authorization Policy Existence Problem: Theory and Experiments","publication_year":2022,"publication_date":"2022-04-21","ids":{"openalex":"https://openalex.org/W3181338812","doi":"https://doi.org/10.1145/3528101","mag":"3181338812"},"language":"en","primary_location":{"id":"doi:10.1145/3528101","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3528101","pdf_url":null,"source":{"id":"https://openalex.org/S4210174050","display_name":"ACM Transactions on Privacy and Security","issn_l":"2471-2566","issn":["2471-2566","2471-2574"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Privacy and Security","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":"https://openalex.org/A5109050799","display_name":"Jason Crampton","orcid":"https://orcid.org/0000-0003-2151-8426"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jason Crampton","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eduard Eiben","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044021493","display_name":"Gregory Gutin","orcid":"https://orcid.org/0000-0002-2377-0417"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gregory Gutin","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-2377-0417","affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075467204","display_name":"Daniel Karapetyan","orcid":"https://orcid.org/0000-0003-4030-6525"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Karapetyan","raw_affiliation_strings":["University of Nottingham, Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038073617","display_name":"Diptapriyo Majumdar","orcid":"https://orcid.org/0000-0003-2677-4648"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Diptapriyo Majumdar","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-2677-4648","affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.793,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77490781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"25","issue":"4","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.998199999332428,"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.998199999332428,"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/T10237","display_name":"Cryptography and Data Security","score":0.9941999912261963,"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9668999910354614,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7635536193847656},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6025490760803223},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5757300853729248},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5599786639213562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5586107969284058},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5399678945541382},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4682199954986572},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46423783898353577},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4587460160255432},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4415161609649658},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4310721457004547},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.4180715084075928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3469439744949341},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34542953968048096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19175121188163757},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10470283031463623}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7635536193847656},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6025490760803223},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5757300853729248},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5599786639213562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5586107969284058},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5399678945541382},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4682199954986572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46423783898353577},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4587460160255432},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4415161609649658},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4310721457004547},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.4180715084075928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3469439744949341},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34542953968048096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19175121188163757},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10470283031463623},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3528101","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3528101","pdf_url":null,"source":{"id":"https://openalex.org/S4210174050","display_name":"ACM Transactions on Privacy and Security","issn_l":"2471-2566","issn":["2471-2566","2471-2574"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Privacy and Security","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8551038380","display_name":null,"funder_award_id":"RPG-2018-161","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1507717186","https://openalex.org/W1531592115","https://openalex.org/W1556898525","https://openalex.org/W1964889053","https://openalex.org/W1970736012","https://openalex.org/W1989617554","https://openalex.org/W2030164717","https://openalex.org/W2038953226","https://openalex.org/W2041670460","https://openalex.org/W2052773530","https://openalex.org/W2074747980","https://openalex.org/W2107311933","https://openalex.org/W2108004830","https://openalex.org/W2110723603","https://openalex.org/W2111739159","https://openalex.org/W2116087731","https://openalex.org/W2166566648","https://openalex.org/W2249739104","https://openalex.org/W2418605222","https://openalex.org/W2608151435","https://openalex.org/W2893049765","https://openalex.org/W2902651753","https://openalex.org/W2911580950","https://openalex.org/W2914414140","https://openalex.org/W2938826480","https://openalex.org/W2964075550","https://openalex.org/W2971686860","https://openalex.org/W3102379243","https://openalex.org/W3161976012","https://openalex.org/W3166549520","https://openalex.org/W3173016908","https://openalex.org/W4229606576","https://openalex.org/W4233759879","https://openalex.org/W4297824819","https://openalex.org/W4300986476"],"related_works":["https://openalex.org/W2997249752","https://openalex.org/W1865369187","https://openalex.org/W2523981875","https://openalex.org/W1767868015","https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W2087572620"],"abstract_inverted_index":{"Recent":[0],"work":[1],"has":[2,253],"shown":[3],"that":[4,124,244],"many":[5,39],"problems":[6],"of":[7,19,91,113,119,134,145,154,168,178,184,203,214,225,264],"satisfiability":[8],"and":[9,34,78,196,221,257],"resiliency":[10,179],"in":[11,38,181],"workflows":[12],"may":[13],"be":[14,44,153,191],"viewed":[15],"as":[16,235],"special":[17],"cases":[18],"the":[20,67,71,74,83,95,101,105,116,125,132,165,182,223,230,245,249,265],"authorization":[21,29,76,89],"policy":[22,30,52,72,90],"existence":[23],"problem":[24,126,180,216,231],"(APEP),":[25],"which":[26,70,86,228,247],"returns":[27,87],"an":[28,88],"if":[31,131,142],"one":[32,144],"exists":[33],"\u201cNo\u201d":[35],"otherwise.":[36],"However,":[37],"practical":[40,155],"settings":[41],"it":[42,189],"would":[43],"more":[45],"useful":[46],"to":[47,69,152,199,237],"obtain":[48],"a":[49,55,111,169,175,201,238],"\u201cleast":[50,58],"bad\u201d":[51,59],"than":[53],"just":[54],"\u201cNo,\u201d":[56],"where":[57,94],"is":[60,98,127,140,162],"characterized":[61],"by":[62,100,104],"some":[63],"numerical":[64],"value":[65],"indicating":[66],"extent":[68],"violates":[73],"base":[75],"relation":[77],"constraints.":[79],"Accordingly,":[80],"we":[81],"introduce":[82,174],"Valued":[84,120,194,207],"APEP,":[85,195],"minimum":[92],"weight,":[93],"(non-negative)":[96],"weight":[97],"determined":[99],"constraints":[102,135,150],"violated":[103],"returned":[106],"solution.":[107],"We":[108,122,172,209],"then":[109],"establish":[110],"number":[112],"results":[114,224,242],"concerning":[115],"parameterized":[117],"complexity":[118],"APEP.":[121,208],"prove":[123],"fixed-parameter":[128],"tractable":[129],"(FPT)":[130],"set":[133,202],"satisfies":[136],"two":[137,211],"restrictions,":[138],"but":[139],"intractable":[141],"only":[143],"these":[146,233],"restrictions":[147],"holds.":[148],"(Most":[149],"known":[151],"use":[156,197],"satisfy":[157],"both":[158],"restrictions.)":[159],"Our":[160,241],"analysis":[161],"based":[163],"on":[164],"novel":[166],"concept":[167],"user":[170,250],"profile.":[171],"also":[173],"new":[176],"type":[177],"context":[183],"workflow":[185],"satisfiability,":[186],"show":[187,243],"how":[188],"can":[190],"addressed":[192],"using":[193,217,232],"this":[198,215],"build":[200],"benchmark":[204],"instances":[205],"for":[206],"describe":[210],"different":[212],"formulations":[213,234],"mixed":[218],"integer":[219],"programming":[220],"report":[222],"computational":[226],"experiments":[227],"solve":[229],"input":[236],"general-purpose":[239],"solver.":[240],"formulation":[246,263],"employs":[248],"profile":[251],"concept,":[252],"FPT-like":[254],"running":[255],"time":[256],"usually":[258],"significantly":[259],"outperforms":[260],"our":[261],"naive":[262],"problem.":[266]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}