[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M71DHX2A21YX7SD9BMTYVC8K":3,"skill-same:01M71DHX2A21YX7SD9BMTYVC8K":86},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":39,"linkOnly":40,"markdownContent":41,"markdownBody":42,"frontMatter":43,"refName":59,"commitSha":60,"skillDirectory":61,"forksCount":14,"repositoryHtmlUrl":62,"repositoryHomepageUrl":6,"ownerHtmlUrl":63,"ownerBlogUrl":6,"ownerDescription":64,"updatedAt":65,"install":66,"resources":79},"01M71DHX2A21YX7SD9BMTYVC8K","access-rbac-audit",null,"Apply bottom-up and top-down role mining techniques to discover optimal RBAC roles from existing user-permission assignments, reducing role explosion and enforcing least privilege.","DCx7C5\u002Fai-marketplace","DCx7C5","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F42419559?v=4","01M71C01G2AZV3NTNGWAWSHJPP","DC","01M71C01GQW6G50S2BYMS7PP3E",0,"MIT","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fidentity\u002Faccess\u002Frbac\u002Faudit\u002FSKILL.md",[],[19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38],"access","audit","rbac","access rbac audit","rbac audit","pr","explosion","clustering","role-mining","sonnet","identity","least-privilege","permission","read","top","mining","Bash","cybersecurity","up","discover","2026-11-10 10:12:30",false,"---\nname: access-rbac-audit\ndescription: Apply bottom-up and top-down role mining techniques to discover optimal RBAC roles from existing user-permission assignments, reducing role explosion and enforcing least privilege.\ndomain: cybersecurity\nsubdomain: identity-access-management\ntags:\n- rbac\n- role-mining\n- identity-governance\n- access-control\n- least-privilege\n- clustering\nnist_csf:\n- PR.AA-01\n- PR.AA-02\n- PR.AA-05\n- PR.AA-06\nmodel: sonnet\nmaxTurns: 20\ntools: [Read, Bash, Glob, Grep]\ncapec: []\n---\n\n# Building Role Mining for RBAC Optimization\n\n## Overview\n\nRole mining is the process of analyzing existing user-permission assignments to discover optimal roles for a Role-Based Access Control (RBAC) system. Organizations accumulate excessive permissions over time through job changes, project assignments, and ad-hoc access grants, leading to \"role explosion\" where thousands of granular roles exist with significant overlap. Role mining uses data analysis -- including clustering algorithms, formal concept analysis, and graph-based methods -- to consolidate permissions into a minimal set of roles that accurately represent business functions while enforcing least privilege.\n\n\n## When to Use\n\n- When deploying or configuring building role mining for rbac optimization capabilities in your environment\n- When establishing security controls aligned to compliance requirements\n- When building or improving security architecture for this domain\n- When conducting security assessments that require this implementation\n\n## Prerequisites\n\n- Export of current user-permission assignments (CSV\u002Fdatabase)\n- Identity governance platform or directory service access\n- Python 3.9+ with pandas, scikit-learn, numpy\n- Understanding of organizational structure and job functions\n- Stakeholder access for role validation workshops\n\n## Core Concepts\n\n### Role Mining Approaches\n\n| Approach | Description | Best For |\n|----------|-------------|----------|\n| Bottom-Up | Analyze existing permissions to discover common patterns | Large datasets with organic permission growth |\n| Top-Down | Design roles from business requirements and job descriptions | Greenfield RBAC or organizational restructuring |\n| Hybrid | Combine bottom-up analysis with top-down business validation | Most production environments |\n\n### Role Mining Algorithms\n\n**1. Permission Clustering**: Group users with similar permission sets using k-means or hierarchical clustering. Users in the same cluster share a common role.\n\n**2. Formal Concept Analysis (FCA)**: Mathematical framework that identifies complete set of concepts (user groups sharing exact permission sets) from a binary user-permission matrix.\n\n**3. Graph-Based Mining**: Model users and permissions as a bipartite graph, then find dense subgraphs representing candidate roles.\n\n**4. Boolean Matrix Decomposition**: Decompose the user-permission matrix U into U ≈ R × P where R maps users to roles and P maps roles to permissions.\n\n### Role Mining Metrics\n\n| Metric | Formula | Target |\n|--------|---------|--------|\n| Role Count | Total distinct roles after mining | Minimize |\n| Coverage | Permissions explained by mined roles \u002F Total permissions | > 95% |\n| Weighted Structural Complexity (WSC) | Sum of role-user + role-permission assignments | Minimize |\n| Deviation | Extra permissions not covered by assigned roles | \u003C 5% |\n\n## Workflow\n\n### Step 1: Extract User-Permission Data\n\nCollect the current access state from all identity sources:\n\n```python\nimport pandas as pd\nimport numpy as np\n\n# Load user-permission assignments\n# Format: user_id, permission_id (one row per assignment)\nassignments = pd.read_csv(\"user_permissions.csv\")\n\n# Create binary user-permission matrix (UPA matrix)\nupa_matrix = assignments.pivot_table(\n    index=\"user_id\",\n    columns=\"permission_id\",\n    aggfunc=\"size\",\n    fill_value=0\n)\nupa_matrix = (upa_matrix > 0).astype(int)\n\nprint(f\"Users: {upa_matrix.shape[0]}\")\nprint(f\"Permissions: {upa_matrix.shape[1]}\")\nprint(f\"Assignments: {assignments.shape[0]}\")\nprint(f\"Density: {upa_matrix.values.sum() \u002F upa_matrix.size:.2%}\")\n```\n\n### Step 2: Bottom-Up Role Discovery Using Clustering\n\n```python\nfrom sklearn.cluster import AgglomerativeClustering\nfrom sklearn.metrics import silhouette_score\n\ndef find_optimal_clusters(matrix, max_k=50):\n    \"\"\"Find optimal number of roles using silhouette analysis.\"\"\"\n    scores = []\n    for k in range(2, min(max_k, matrix.shape[0])):\n        clustering = AgglomerativeClustering(\n            n_clusters=k, metric=\"jaccard\", linkage=\"average\"\n        )\n        labels = clustering.fit_predict(matrix)\n        score = silhouette_score(matrix, labels, metric=\"jaccard\")\n        scores.append((k, score))\n\n    optimal_k = max(scores, key=lambda x: x[1])[0]\n    return optimal_k, scores\n\ndef mine_roles_clustering(upa_matrix, n_clusters):\n    \"\"\"Mine roles using hierarchical clustering on Jaccard distance.\"\"\"\n    clustering = AgglomerativeClustering(\n        n_clusters=n_clusters, metric=\"jaccard\", linkage=\"average\"\n    )\n    user_matrix = upa_matrix.values\n    labels = clustering.fit_predict(user_matrix)\n\n    roles = {}\n    for cluster_id in range(n_clusters):\n        cluster_users = upa_matrix.index[labels == cluster_id]\n        cluster_permissions = upa_matrix.loc[cluster_users]\n\n        # Core role = permissions held by >80% of cluster members\n        permission_frequency = cluster_permissions.mean()\n        core_permissions = permission_frequency[permission_frequency >= 0.8].index.tolist()\n\n        roles[f\"Role_{cluster_id}\"] = {\n            \"permissions\": core_permissions,\n            \"user_count\": len(cluster_users),\n            \"users\": cluster_users.tolist(),\n            \"coverage\": permission_frequency[permission_frequency >= 0.8].mean()\n        }\n\n    return roles, labels\n```\n\n### Step 3: Formal Concept Analysis\n\n```python\ndef mine_roles_fca(upa_matrix, min_support=3):\n    \"\"\"Mine roles using Formal Concept Analysis (frequent closed itemsets).\"\"\"\n    from itertools import combinations\n\n    users = upa_matrix.index.tolist()\n    permissions = upa_matrix.columns.tolist()\n\n    concepts = []\n\n    # Find all maximal permission sets shared by at least min_support users\n    for size in range(len(permissions), 0, -1):\n        for perm_combo in combinations(permissions, size):\n            perm_set = set(perm_combo)\n            # Find users who have ALL permissions in this set\n            matching_users = []\n            for user in users:\n                user_perms = set(upa_matrix.columns[upa_matrix.loc[user] == 1])\n                if perm_set.issubset(user_perms):\n                    matching_users.append(user)\n\n            if len(matching_users) >= min_support:\n                # Check if this is a closed concept (no superset with same extent)\n                is_closed = True\n                for concept in concepts:\n                    if set(matching_users) == set(concept[\"users\"]) and \\\n                       perm_set.issubset(set(concept[\"permissions\"])):\n                        is_closed = False\n                        break\n\n                if is_closed:\n                    concepts.append({\n                        \"permissions\": list(perm_set),\n                        \"users\": matching_users,\n                        \"support\": len(matching_users)\n                    })\n\n        if len(concepts) > 100:  # Limit for performance\n            break\n\n    return concepts\n```\n\n### Step 4: Evaluate and Select Roles\n\n```python\ndef evaluate_role_set(roles, upa_matrix):\n    \"\"\"Evaluate the quality of a mined role set.\"\"\"\n    total_assignments = upa_matrix.values.sum()\n    covered_assignments = 0\n    extra_assignments = 0\n\n    for role_name, role_data in roles.items():\n        role_perms = set(role_data[\"permissions\"])\n        for user in role_data[\"users\"]:\n            user_perms = set(upa_matrix.columns[upa_matrix.loc[user] == 1])\n            covered = role_perms.intersection(user_perms)\n            extra = role_perms - user_perms\n            covered_assignments += len(covered)\n            extra_assignments += len(extra)\n\n    metrics = {\n        \"total_roles\": len(roles),\n        \"total_assignments\": total_assignments,\n        \"covered_assignments\": covered_assignments,\n        \"coverage_rate\": covered_assignments \u002F total_assignments if total_assignments else 0,\n        \"extra_permissions\": extra_assignments,\n        \"deviation_rate\": extra_assignments \u002F (covered_assignments + extra_assignments) if (covered_assignments + extra_assignments) else 0,\n        \"avg_role_size\": np.mean([len(r[\"permissions\"]) for r in roles.values()]),\n        \"avg_users_per_role\": np.mean([r[\"user_count\"] for r in roles.values()]),\n    }\n    return metrics\n```\n\n### Step 5: Business Validation\n\nAfter mining candidate roles:\n\n1. Map mined roles to business functions (department, job title)\n2. Conduct workshops with business unit managers to validate role definitions\n3. Identify outlier permissions that indicate misconfiguration\n4. Refine roles based on feedback and re-evaluate metrics\n5. Document role definitions with business justification\n\n## Validation Checklist\n\n- [ ] User-permission matrix extracted from all identity sources\n- [ ] Multiple mining algorithms compared (clustering, FCA)\n- [ ] Optimal role count determined via silhouette analysis or WSC\n- [ ] Coverage rate exceeds 95% of existing assignments\n- [ ] Deviation rate below 5% (minimal extra permissions)\n- [ ] Mined roles validated with business stakeholders\n- [ ] Role hierarchy defined (parent-child inheritance)\n- [ ] Exception\u002Foutlier permissions documented\n- [ ] Migration plan created for transitioning to new role model\n- [ ] Ongoing role governance process defined\n\n## References\n\n- [Role Mining: Optimizing RBAC - NIST](https:\u002F\u002Fcsrc.nist.gov\u002Fprojects\u002Frole-based-access-control)\n- [RBAC Standard - ANSI\u002FINCITS 359-2012](https:\u002F\u002Fwww.incits.org\u002F)\n- [Formal Concept Analysis for Role Engineering](https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-540-73070-6_7)\n- [scikit-learn Clustering Documentation](https:\u002F\u002Fscikit-learn.org\u002Fstable\u002Fmodules\u002Fclustering.html)\n","# Building Role Mining for RBAC Optimization\n\n## Overview\n\nRole mining is the process of analyzing existing user-permission assignments to discover optimal roles for a Role-Based Access Control (RBAC) system. Organizations accumulate excessive permissions over time through job changes, project assignments, and ad-hoc access grants, leading to \"role explosion\" where thousands of granular roles exist with significant overlap. Role mining uses data analysis -- including clustering algorithms, formal concept analysis, and graph-based methods -- to consolidate permissions into a minimal set of roles that accurately represent business functions while enforcing least privilege.\n\n\n## When to Use\n\n- When deploying or configuring building role mining for rbac optimization capabilities in your environment\n- When establishing security controls aligned to compliance requirements\n- When building or improving security architecture for this domain\n- When conducting security assessments that require this implementation\n\n## Prerequisites\n\n- Export of current user-permission assignments (CSV\u002Fdatabase)\n- Identity governance platform or directory service access\n- Python 3.9+ with pandas, scikit-learn, numpy\n- Understanding of organizational structure and job functions\n- Stakeholder access for role validation workshops\n\n## Core Concepts\n\n### Role Mining Approaches\n\n| Approach | Description | Best For |\n|----------|-------------|----------|\n| Bottom-Up | Analyze existing permissions to discover common patterns | Large datasets with organic permission growth |\n| Top-Down | Design roles from business requirements and job descriptions | Greenfield RBAC or organizational restructuring |\n| Hybrid | Combine bottom-up analysis with top-down business validation | Most production environments |\n\n### Role Mining Algorithms\n\n**1. Permission Clustering**: Group users with similar permission sets using k-means or hierarchical clustering. Users in the same cluster share a common role.\n\n**2. Formal Concept Analysis (FCA)**: Mathematical framework that identifies complete set of concepts (user groups sharing exact permission sets) from a binary user-permission matrix.\n\n**3. Graph-Based Mining**: Model users and permissions as a bipartite graph, then find dense subgraphs representing candidate roles.\n\n**4. Boolean Matrix Decomposition**: Decompose the user-permission matrix U into U ≈ R × P where R maps users to roles and P maps roles to permissions.\n\n### Role Mining Metrics\n\n| Metric | Formula | Target |\n|--------|---------|--------|\n| Role Count | Total distinct roles after mining | Minimize |\n| Coverage | Permissions explained by mined roles \u002F Total permissions | > 95% |\n| Weighted Structural Complexity (WSC) | Sum of role-user + role-permission assignments | Minimize |\n| Deviation | Extra permissions not covered by assigned roles | \u003C 5% |\n\n## Workflow\n\n### Step 1: Extract User-Permission Data\n\nCollect the current access state from all identity sources:\n\n```python\nimport pandas as pd\nimport numpy as np\n\n# Load user-permission assignments\n# Format: user_id, permission_id (one row per assignment)\nassignments = pd.read_csv(\"user_permissions.csv\")\n\n# Create binary user-permission matrix (UPA matrix)\nupa_matrix = assignments.pivot_table(\n    index=\"user_id\",\n    columns=\"permission_id\",\n    aggfunc=\"size\",\n    fill_value=0\n)\nupa_matrix = (upa_matrix > 0).astype(int)\n\nprint(f\"Users: {upa_matrix.shape[0]}\")\nprint(f\"Permissions: {upa_matrix.shape[1]}\")\nprint(f\"Assignments: {assignments.shape[0]}\")\nprint(f\"Density: {upa_matrix.values.sum() \u002F upa_matrix.size:.2%}\")\n```\n\n### Step 2: Bottom-Up Role Discovery Using Clustering\n\n```python\nfrom sklearn.cluster import AgglomerativeClustering\nfrom sklearn.metrics import silhouette_score\n\ndef find_optimal_clusters(matrix, max_k=50):\n    \"\"\"Find optimal number of roles using silhouette analysis.\"\"\"\n    scores = []\n    for k in range(2, min(max_k, matrix.shape[0])):\n        clustering = AgglomerativeClustering(\n            n_clusters=k, metric=\"jaccard\", linkage=\"average\"\n        )\n        labels = clustering.fit_predict(matrix)\n        score = silhouette_score(matrix, labels, metric=\"jaccard\")\n        scores.append((k, score))\n\n    optimal_k = max(scores, key=lambda x: x[1])[0]\n    return optimal_k, scores\n\ndef mine_roles_clustering(upa_matrix, n_clusters):\n    \"\"\"Mine roles using hierarchical clustering on Jaccard distance.\"\"\"\n    clustering = AgglomerativeClustering(\n        n_clusters=n_clusters, metric=\"jaccard\", linkage=\"average\"\n    )\n    user_matrix = upa_matrix.values\n    labels = clustering.fit_predict(user_matrix)\n\n    roles = {}\n    for cluster_id in range(n_clusters):\n        cluster_users = upa_matrix.index[labels == cluster_id]\n        cluster_permissions = upa_matrix.loc[cluster_users]\n\n        # Core role = permissions held by >80% of cluster members\n        permission_frequency = cluster_permissions.mean()\n        core_permissions = permission_frequency[permission_frequency >= 0.8].index.tolist()\n\n        roles[f\"Role_{cluster_id}\"] = {\n            \"permissions\": core_permissions,\n            \"user_count\": len(cluster_users),\n            \"users\": cluster_users.tolist(),\n            \"coverage\": permission_frequency[permission_frequency >= 0.8].mean()\n        }\n\n    return roles, labels\n```\n\n### Step 3: Formal Concept Analysis\n\n```python\ndef mine_roles_fca(upa_matrix, min_support=3):\n    \"\"\"Mine roles using Formal Concept Analysis (frequent closed itemsets).\"\"\"\n    from itertools import combinations\n\n    users = upa_matrix.index.tolist()\n    permissions = upa_matrix.columns.tolist()\n\n    concepts = []\n\n    # Find all maximal permission sets shared by at least min_support users\n    for size in range(len(permissions), 0, -1):\n        for perm_combo in combinations(permissions, size):\n            perm_set = set(perm_combo)\n            # Find users who have ALL permissions in this set\n            matching_users = []\n            for user in users:\n                user_perms = set(upa_matrix.columns[upa_matrix.loc[user] == 1])\n                if perm_set.issubset(user_perms):\n                    matching_users.append(user)\n\n            if len(matching_users) >= min_support:\n                # Check if this is a closed concept (no superset with same extent)\n                is_closed = True\n                for concept in concepts:\n                    if set(matching_users) == set(concept[\"users\"]) and \\\n                       perm_set.issubset(set(concept[\"permissions\"])):\n                        is_closed = False\n                        break\n\n                if is_closed:\n                    concepts.append({\n                        \"permissions\": list(perm_set),\n                        \"users\": matching_users,\n                        \"support\": len(matching_users)\n                    })\n\n        if len(concepts) > 100:  # Limit for performance\n            break\n\n    return concepts\n```\n\n### Step 4: Evaluate and Select Roles\n\n```python\ndef evaluate_role_set(roles, upa_matrix):\n    \"\"\"Evaluate the quality of a mined role set.\"\"\"\n    total_assignments = upa_matrix.values.sum()\n    covered_assignments = 0\n    extra_assignments = 0\n\n    for role_name, role_data in roles.items():\n        role_perms = set(role_data[\"permissions\"])\n        for user in role_data[\"users\"]:\n            user_perms = set(upa_matrix.columns[upa_matrix.loc[user] == 1])\n            covered = role_perms.intersection(user_perms)\n            extra = role_perms - user_perms\n            covered_assignments += len(covered)\n            extra_assignments += len(extra)\n\n    metrics = {\n        \"total_roles\": len(roles),\n        \"total_assignments\": total_assignments,\n        \"covered_assignments\": covered_assignments,\n        \"coverage_rate\": covered_assignments \u002F total_assignments if total_assignments else 0,\n        \"extra_permissions\": extra_assignments,\n        \"deviation_rate\": extra_assignments \u002F (covered_assignments + extra_assignments) if (covered_assignments + extra_assignments) else 0,\n        \"avg_role_size\": np.mean([len(r[\"permissions\"]) for r in roles.values()]),\n        \"avg_users_per_role\": np.mean([r[\"user_count\"] for r in roles.values()]),\n    }\n    return metrics\n```\n\n### Step 5: Business Validation\n\nAfter mining candidate roles:\n\n1. Map mined roles to business functions (department, job title)\n2. Conduct workshops with business unit managers to validate role definitions\n3. Identify outlier permissions that indicate misconfiguration\n4. Refine roles based on feedback and re-evaluate metrics\n5. Document role definitions with business justification\n\n## Validation Checklist\n\n- [ ] User-permission matrix extracted from all identity sources\n- [ ] Multiple mining algorithms compared (clustering, FCA)\n- [ ] Optimal role count determined via silhouette analysis or WSC\n- [ ] Coverage rate exceeds 95% of existing assignments\n- [ ] Deviation rate below 5% (minimal extra permissions)\n- [ ] Mined roles validated with business stakeholders\n- [ ] Role hierarchy defined (parent-child inheritance)\n- [ ] Exception\u002Foutlier permissions documented\n- [ ] Migration plan created for transitioning to new role model\n- [ ] Ongoing role governance process defined\n\n## References\n\n- [Role Mining: Optimizing RBAC - NIST](https:\u002F\u002Fcsrc.nist.gov\u002Fprojects\u002Frole-based-access-control)\n- [RBAC Standard - ANSI\u002FINCITS 359-2012](https:\u002F\u002Fwww.incits.org\u002F)\n- [Formal Concept Analysis for Role Engineering](https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-540-73070-6_7)\n- [scikit-learn Clustering Documentation](https:\u002F\u002Fscikit-learn.org\u002Fstable\u002Fmodules\u002Fclustering.html)\n",{"name":5,"tags":44,"capec":47,"model":28,"tools":48,"domain":36,"maxTurns":52,"nist_csf":53,"subdomain":58,"description":7},[21,27,45,46,30,26],"identity-governance","access-control",[],[49,35,50,51],"Read","Glob","Grep",20,[54,55,56,57],"PR.AA-01","PR.AA-02","PR.AA-05","PR.AA-06","identity-access-management","main","a91f1293287ffa9f4f1b8f486cd6e835a1568c84","skills\u002Fidentity\u002Faccess\u002Frbac\u002Faudit","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace","https:\u002F\u002Fgithub.com\u002FDCx7C5","#Python","2026-09-01 11:21:00",{"source":8,"skillName":5,"commands":67,"prompt":77,"zipAvailable":78},[68,71,74],{"tool":69,"command":70},"npx","npx skills add DCx7C5\u002Fai-marketplace --skill access-rbac-audit",{"tool":72,"command":73},"bunx","bunx skills add DCx7C5\u002Fai-marketplace --skill access-rbac-audit",{"tool":75,"command":76},"pnpm","pnpm dlx skills add DCx7C5\u002Fai-marketplace --skill access-rbac-audit","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fidentity\u002Faccess\u002Frbac\u002Faudit\u002FSKILL.md",true,[80],{"path":81,"resourceType":82,"resourceTypeDesc":83,"sizeBytes":84,"sourceHtmlUrl":85},"index.json","REFERENCE","参考文档",648,"https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fidentity\u002Faccess\u002Frbac\u002Faudit\u002Findex.json",[87,112,133,154,176,192],{"skillNo":88,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":91,"categories":92,"keywords":93,"publishedAt":39},"01M71HAPZ01KQ30RKTB0FFSQ05","services-wmi-persistence-detect","Detect WMI event subscription persistence by enumerating ActiveScriptEventConsumer, CommandLineEventConsumer, and permanent subscriptions in the WMI repository.","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fwindows\u002Fservices\u002Fwmi\u002Fpersistence\u002Fdetect\u002FSKILL.md",[],[94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,36,111],"services","detect","services wmi persistence detect","wmi","persistence","de","cm","process","activescript","event","subscriptions","commandline-consumer","repository","subscription","event-subscription","t1546.003","forensics","process-forensics",{"skillNo":113,"name":114,"nameZh":6,"description":115,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":116,"categories":117,"keywords":118,"publishedAt":39},"01M71HAK6JTTTS229T17WJMMCG","services-wmi-exec-exploit","Perform lateral movement across Windows networks using WMI-based remote execution techniques including Impacket wmiexec.py, CrackMapExec, and native WMI commands for stealthy post-exploitation during red team engagements.","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fwindows\u002Fservices\u002Fwmi\u002Fexec\u002Fexploit\u002FSKILL.md",[],[119,94,120,97,121,122,123,36,35,124,125,126,127,128,99,129,130,32,131,132],"exploit","services wmi exec exploit","exec","remote","traffic","analysis","team","across","crackmapexec","native","command","lateral movement","lateral-movement","Impacket",{"skillNo":134,"name":135,"nameZh":6,"description":136,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":137,"categories":138,"keywords":139,"publishedAt":39},"01M71HAG6MHKNQV8KDZKMT4886","registry-artifact-extract","Extract and analyze Windows Registry hives to uncover user activity, installed software, autostart entries, and evidence of system compromise.","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fwindows\u002Fregistry\u002Fartifact\u002Fextract\u002FSKILL.md",[],[140,141,142,143,144,145,36,35,146,124,147,148,99,32,149,150,151,152,153,28],"artifact","registry","registry artifact extract","extract","evidence-collection","artifact-analysis","collection","analyze","uncover","software","activity","digital-forensics","windows-registry","regripper",{"skillNo":155,"name":156,"nameZh":6,"description":157,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":158,"categories":159,"keywords":160,"publishedAt":39},"01M71HACR4A8XTWTTSXK4124AA","processes-token-impersonate-detect","Detect Windows token impersonation and privilege abuse including SeImpersonatePrivilege exploitation via Potato attacks and token stealing techniques.","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fwindows\u002Fprocesses\u002Ftoken\u002Fimpersonate\u002Fdetect\u002FSKILL.md",[],[95,161,162,163,164,165,166,100,167,36,111,168,169,170,171,172,173,174,175,99],"processes token impersonate detect","token","processes","attacks","windows","escalation","techniques","privilege-escalation","seimpersonate","token-impersonation","printspoofer","exploitation","potato","impersonation","via",{"skillNo":177,"name":178,"nameZh":6,"description":179,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":180,"categories":181,"keywords":182,"publishedAt":39},"01M71HAABSB4Z6QFSXEG00R4RK","processes-thread-injection-detect","Detect Windows thread injection techniques including CreateRemoteThread, QueueUserAPC, NtCreateThreadEx, and thread hijacking via process memory analysis.","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fwindows\u002Fprocesses\u002Fthread\u002Finjection\u002Fdetect\u002FSKILL.md",[],[183,184,95,185,163,165,186,100,187,167,36,111,124,188,189,190,191,175,99,101],"thread","processes thread injection detect","injection","memory","process-injection","api","apc-injection","thread-injection","nt-api",{"skillNo":193,"name":194,"nameZh":6,"description":195,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":196,"categories":197,"keywords":198,"publishedAt":39},"01M71HA7H311V5G14WMX58HQSS","processes-hollow-technique-detect","Detect process hollowing (RunPE) by identifying processes with mismatched image paths between PEB and VAD tree, or unmapped PE headers in memory.","https:\u002F\u002Fgithub.com\u002FDCx7C5\u002Fai-marketplace\u002Fblob\u002Fmain\u002Fskills\u002Fwindows\u002Fprocesses\u002Fhollow\u002Ftechnique\u002Fdetect\u002FSKILL.md",[],[199,95,163,200,186,100,201,202,36,111,203,204,205,206,207,208,99,101,209,210],"processes hollow technique detect","tree","memory-forensics","process-hollow","peb","runpe","image","pe-header","in memory","with","mismatched","headers"]