Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies
원문 초록
Modern software systems rely on mining insights from business sensitive data stored in public clouds. A data breach usually incurs significant (monetary) loss for a commercial organization. Conceptually, cloud security heavily relies on Identity Access Management (IAM) policies that IT admins need to properly configure and periodically update. Security negligence and human errors often lead to misconfiguring IAM policies which may open a backdoor for attackers. To address these challenges, first, we develop a novel framework that encodes generating optimal IAM policies using constraint programming (CP). We identify reducing dark permissions of cloud users as an optimality criterion, which intuitively implies minimizing unnecessary datastore access permissions. Second, to make IAM policies interpretable, we use graph representation learning applied to historical access patterns of users to augment our CP model with similarity constraints: similar users should be grouped together and share common IAM policies. Third, we describe multiple attack models and show that our optimized IAM policies significantly reduce the impact of security attacks using real data from 8 commercial organizations, and synthetic instances.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Permutation Equivariant Neural Controlled Differential Equations for Dynamic Graph Representation Learning
Wasserstein Hypergraph Neural Network
Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols
Language Embedding Meets Dynamic Graph: A New Exploration for Neural Architecture Representation Learning
Studying and Improving Graph Neural Network-based Motif Estimation
Mini-Game Lifetime Value Prediction in WeChat
토론
이 논문과 연결된 포럼 글이 아직 없습니다.