{"id":"https://openalex.org/W4416962005","doi":"https://doi.org/10.1109/pst65910.2025.11268863","title":"An Integer Programming Framework for ReBAC Policy Mining and Optimized Conformance Testing","display_name":"An Integer Programming Framework for ReBAC Policy Mining and Optimized Conformance Testing","publication_year":2025,"publication_date":"2025-08-26","ids":{"openalex":"https://openalex.org/W4416962005","doi":"https://doi.org/10.1109/pst65910.2025.11268863"},"language":null,"primary_location":{"id":"doi:10.1109/pst65910.2025.11268863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pst65910.2025.11268863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 22nd Annual International Conference on Privacy, Security, and Trust (PST)","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/A5070601304","display_name":"Padmavathi Iyer","orcid":"https://orcid.org/0000-0001-9611-451X"},"institutions":[{"id":"https://openalex.org/I95144958","display_name":"Drury University","ror":"https://ror.org/03ntw4c66","country_code":"US","type":"education","lineage":["https://openalex.org/I95144958"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Padmavathi Iyer","raw_affiliation_strings":["Drury University,Springfield,Missouri"],"affiliations":[{"raw_affiliation_string":"Drury University,Springfield,Missouri","institution_ids":["https://openalex.org/I95144958"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070601304"],"corresponding_institution_ids":["https://openalex.org/I95144958"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.48742287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.98580002784729,"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.98580002784729,"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.0017000000225380063,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/correctness","display_name":"Correctness","score":0.7124999761581421},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6944000124931335},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6942999958992004},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5424000024795532},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47600001096725464},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4722999930381775},{"id":"https://openalex.org/keywords/access-control","display_name":"Access control","score":0.4235000014305115}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7124999761581421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6984999775886536},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6944000124931335},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6942999958992004},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5424000024795532},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47600001096725464},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4722999930381775},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4496000111103058},{"id":"https://openalex.org/C527821871","wikidata":"https://www.wikidata.org/wiki/Q228502","display_name":"Access control","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C108759981","wikidata":"https://www.wikidata.org/wiki/Q788590","display_name":"Authorization","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3005000054836273},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2694999873638153},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.2581999897956848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pst65910.2025.11268863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pst65910.2025.11268863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 22nd Annual International Conference on Privacy, Security, and Trust (PST)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1981058821","https://openalex.org/W2000107752","https://openalex.org/W2006841241","https://openalex.org/W2095881341","https://openalex.org/W2120588644","https://openalex.org/W2131782448","https://openalex.org/W2166602595","https://openalex.org/W2277593056","https://openalex.org/W2617428507","https://openalex.org/W2619305693","https://openalex.org/W2805336398","https://openalex.org/W2817857516","https://openalex.org/W2888685578","https://openalex.org/W2962744771","https://openalex.org/W2963956318","https://openalex.org/W3028881048","https://openalex.org/W3179367966","https://openalex.org/W4233692232","https://openalex.org/W4280649132","https://openalex.org/W4282555794","https://openalex.org/W4282573246","https://openalex.org/W4299351893","https://openalex.org/W4403398628"],"related_works":[],"abstract_inverted_index":{"Mathematical":[0],"optimization":[1],"provides":[2],"a":[3,17,44],"principled":[4],"approach":[5,46,102],"to":[6,47,116],"access":[7,32],"control":[8,33],"problems":[9],"that":[10,73,97,120],"require":[11],"selecting":[12],"the":[13,37,49,56,104],"best":[14],"alternative":[15],"from":[16],"set":[18],"of":[19,51,58,106],"possibilities.":[20],"In":[21],"this":[22,121],"paper,":[23],"we":[24],"introduce":[25],"integer":[26,81],"programming":[27,82],"formulations":[28],"for":[29,98],"two":[30],"relationship-based":[31],"(ReBAC)":[34],"problems:":[35],"(i)":[36],"established":[38],"policy":[39,99],"mining":[40],"problem":[41],"and":[42,119],"(ii)":[43],"novel":[45],"testing":[48],"correctness":[50],"mined":[52],"policies":[53],"while":[54],"minimizing":[55],"number":[57,105],"required":[59,107],"authorization":[60,108],"checks.":[61],"While":[62],"existing":[63,117],"approaches":[64],"rely":[65],"on":[66],"specialized":[67],"heuristics":[68],"or":[69],"machine":[70],"learning-based":[71],"methods":[72,118],"often":[74],"become":[75],"unwieldy":[76],"with":[77,124],"complex":[78],"constraints,":[79],"our":[80,101],"formulation":[83],"elegantly":[84],"captures":[85],"these":[86],"complexities":[87],"through":[88],"algebraic":[89],"equations,":[90],"ensuring":[91],"exact":[92],"solutions.":[93],"Experimental":[94],"results":[95],"show":[96],"testing,":[100],"reduces":[103],"test":[109],"cases":[110],"by":[111],"over":[112],"$90":[113],"\\%$":[114],"compared":[115],"reduction":[122],"scales":[123],"system":[125],"size,":[126],"significantly":[127],"improving":[128],"efficiency":[129],"in":[130],"growing":[131],"systems.":[132]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-03T00:00:00"}