# US 2025/0061216 A1 · User indexing for identifying access to sensitive data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0061216 A1
- Document ID: US20250061216A1
- Status: Published application
- Kind: A1
- Application number: 18/234,691
- Filed: 2023-08-16
- Published: 2025-02-20
- Earliest claimed: 2023-08-16
- Assignees: Rubrik, Inc.
- Applicants: Rubrik, Inc.
- Inventors: Mudit Malpani; Muraliraja Muniraju; Fabiano Botelho; Jeremy Dong
- Web page: https://patentgrep.com/patent/US20250061216A1

## CPC

- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- H04L 63/101: {Access control lists [ACL]}
- G06F 21/604: {Tools and structures for managing or administering access control systems}
- H04L 63/0263: {Rule management}
- G06F 2221/2101: Auditing as a secondary aspect
- G06F 2221/2141: Access rights, e.g. capability lists, access control lists, access tables, access matrices
- H04L 63/20: {for managing network security; network security policies in general (filtering policies H04L63/0227)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Methods, systems, and devices for data management are described. In some examples, a data management system (DMS) may obtain a snapshot of an identity management system (IMS) that governs access to a set of computing objects for principals. The DMS may generate membership data structures for the principals based on the snapshot. A membership data structure for a principal may indicate one or more other principals included in the principal. The DMS may obtain access control lists (ACLs) for the set of computing objects. An ACL for a computing object may indicate access approvals, access denials, or any combination thereof for one or more associated principals. The DMS may generate mapping functions based on the ACLs. Applying a mapping function for an ACL to membership data structures for principals may yield a set of permitted users that have access to a computing object that is associated with the ACL.

## Claims

### Claim 1

A method, comprising:
obtaining a snapshot of an identity management system that governs access to a set of computing objects for a plurality of principals, the plurality of principals comprising users and groups of users;
generating, based at least in part on the snapshot of the identity management system, membership data structures for the plurality of principals, wherein a membership data structure for a principal indicates one or more users or one or more groups included in the principal;
obtaining, from a snapshot of the set of computing objects, access control lists for the set of computing objects, the access control lists indicating, for respective computing objects, one or more access approvals, one or more access denials, or any combination thereof for one or more associated principals from among the plurality of principals;
generating a set of mapping functions based at least in part on the access control lists, wherein applying a mapping function for an access control list to one or more membership data structures for one or more principals associated with the access control list yields a set of one or more permitted users, the set of one or more permitted users having access to a computing object that is associated with the access control list; and
using the set of mapping functions and the membership data structures to identify, for the set of computing objects, respective sets of one or more permitted users.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
obtaining metadata for the plurality of principals based at least in part on information included in the snapshot, wherein the metadata for a principal comprises an identifier of the principal, direct group membership information for the principal, a type of the principal, one or more secureness attributes associated with the principal, or any combination thereof, and wherein the direct group membership information for the principal indicates one or more groups of which the principal is a direct member.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
identifying a sequential order associated with the one or more access approvals and the one or more access denials included in an access control list for a respective computing object from among the set of computing objects; and
partitioning the access control list into one or more subsets of permissions based at least in part on the identified sequential order, wherein a subset of permissions comprises a single access denial of the one or more access denials and a subset of access approvals from among the one or more access approvals, and wherein generating a mapping function of the set of mapping functions for the respective computing object is based at least in part on the one or more subsets of permissions.

### Claim 4 (depends on 3)

The method of claim 3, wherein generating a mapping function from among the set of mapping functions comprises:
generating, for the one or more subsets of permissions, respective logical expressions that represent the one or more subsets of permissions; and
generating the mapping function based at least in part on a combination of the respective logical expressions associated with the one or more subsets of permissions included in the access control list, the mapping function associated with the respective computing object.

### Claim 5 (depends on 3)

The method of claim 3, wherein using the set of mapping functions and the membership data structures to identify the respective sets of one or more permitted users comprises:
inputting the membership data structures for the one or more principals associated with the access control list into the mapping function for the access control list;
generating a bitmap that represents the set of one or more permitted users having access to the computing object that is associated with the access control list based at least in part on inputting the membership data structures into the mapping function;
converting, based at least in part on a plurality of unique values assigned to the plurality of principals, the bitmap that represents the set of one or more permitted users to a set of one or more identifiers for the set of one or more permitted users, wherein a unique value of the plurality of unique values corresponds to a position in the bitmap that represents a respective principal; and
outputting, to a client, the set of one or more identifiers associated with the set of one or more permitted users.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
performing a plurality of secureness checks for the plurality of principals of the identity management system based at least in part on one or more secureness attributes comprising whether a principal has access to all computing objects of the set of computing objects, whether a password for the principal has an expiration time, whether the password for the principal aligns with one or more password policies, or any combination thereof; and
outputting, to a client, an indication of respective secureness levels for the plurality of principals based at least in part on the plurality of secureness checks.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
assigning a plurality of unique values to the plurality of principals based at least in part on metadata for the plurality of principals, wherein a unique value assigned to a principal comprises an integer associated with a position that represents the principal within one or more bitmaps, and wherein a quantity of bits in a bitmap of the one or more bitmaps is equal to a quantity of the plurality of principals identified from the snapshot.

### Claim 8 (depends on 7)

The method of claim 7, wherein assigning the plurality of unique values comprises:
assigning respective unique values to the plurality of principals until all principals within the plurality of principals are assigned a respective unique value.

### Claim 9 (depends on 7)

The method of claim 7, wherein generating the membership data structures for the plurality of principals comprises:
generating membership bitmaps for the plurality of principals in accordance with the plurality of unique values, wherein a membership bitmap for a principal of the plurality of principals comprises one or more bits set to a first value and remaining bits set to a second value, the one or more bits set to the first value corresponding to one or more positions in the membership bitmap that are assigned to one or more principals that descend from the principal within a hierarchical structure of the plurality of principals identified from the snapshot.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
performing a graph traversal procedure for the plurality of principals, wherein performing the graph traversal procedure comprises identifying, based at least in part on direct group membership information included in metadata for the plurality of principals, a hierarchical structure comprising dependency chains between principals.

### Claim 11 (depends on 10)

The method of claim 10, wherein the graph traversal procedure comprises a plurality of iterations, and wherein performing an iteration of the plurality of iterations comprises:
identifying, for a first set of principals from among the plurality of principals identified from the snapshot of the identity management system, a respective subset of metadata that corresponds to the first set of principals, wherein the respective subset of metadata comprises a respective subset of direct group membership information that indicates one or more groups of which principals in the first set of principals are direct members from within the hierarchical structure of the plurality of principals; and
performing, for the first set of principals and based at least in part on identifying the one or more groups, one or more union procedures to generate one or more membership data structures, the one or more membership data structures for the one or more groups identified in the respective subset of direct group membership information for the first set of principals.

### Claim 12 (depends on 11)

The method of claim 11, wherein performing the graph traversal procedure further comprises:
performing, after performing the iteration, one or more second iterations of the plurality of iterations until respective direct group membership information for all of the plurality of principals is identified and the membership data structures for the plurality of principals are generated.

### Claim 13

An apparatus, comprising:
one or more memories storing processor-executable code; and
one or more processors coupled with the one or more memories and individually or collectively operable to execute the code to cause the apparatus to:
obtain a snapshot of an identity management system that governs access to a set of computing objects for a plurality of principals, the plurality of principals comprising users and groups of users;
generate, based at least in part on the snapshot of the identity management system, membership data structures for the plurality of principals, wherein a membership data structure for a principal indicates one or more users or one or more groups included in the principal;
obtain, from a snapshot of the set of computing objects, access control lists for the set of computing objects, the access control lists indicating, for respective computing objects, one or more access approvals, one or more access denials, or any combination thereof for one or more associated principals from among the plurality of principals;
generate a set of mapping functions based at least in part on the access control lists, wherein applying a mapping function for an access control list to one or more membership data structures for one or more principals associated with the access control list yields a set of one or more permitted users, the set of one or more permitted users having access to a computing object that is associated with the access control list; and
use the set of mapping functions and the membership data structures to identify, for the set of computing objects, respective sets of one or more permitted users.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein the one or more processors are individually or collectively further operable to execute the code to cause the apparatus to:
obtain metadata for the plurality of principals based at least in part on information included in the snapshot, wherein the metadata for a principal comprises an identifier of the principal, direct group membership information for the principal, a type of the principal, one or more secureness attributes associated with the principal, or any combination thereof, and wherein the direct group membership information for the principal indicates one or more groups of which the principal is a direct member.

### Claim 15 (depends on 13)

The apparatus of claim 13, wherein the one or more processors are individually or collectively further operable to execute the code to cause the apparatus to:
identify a sequential order associated with the one or more access approvals and the one or more access denials included in an access control list for a respective computing object from among the set of computing objects; and
partition the access control list into one or more subsets of permissions based at least in part on the identified sequential order, wherein a subset of permissions comprises a single access denial of the one or more access denials and a subset of access approvals from among the one or more access approvals, and wherein generating a mapping function of the set of mapping functions for the respective computing object is based at least in part on the one or more subsets of permissions.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein, to generate a mapping function from among the set of mapping functions, the one or more processors are individually or collectively operable to execute the code to cause the apparatus to:
generate, for the one or more subsets of permissions, respective logical expressions that represent the one or more subsets of permissions; and
generate the mapping function based at least in part on a combination of the respective logical expressions associated with the one or more subsets of permissions included in the access control list, the mapping function associated with the respective computing object.

### Claim 17

A non-transitory computer-readable medium storing code, the code comprising instructions executable by one or more processors to:
obtain a snapshot of an identity management system that governs access to a set of computing objects for a plurality of principals, the plurality of principals comprising users and groups of users;
generate, based at least in part on the snapshot of the identity management system, membership data structures for the plurality of principals, wherein a membership data structure for a principal indicates one or more users or one or more groups included in the principal;
obtain, from a snapshot of the set of computing objects, access control lists for the set of computing objects, the access control lists indicating, for respective computing objects, one or more access approvals, one or more access denials, or any combination thereof for one or more associated principals from among the plurality of principals;
generate a set of mapping functions based at least in part on the access control lists, wherein applying a mapping function for an access control list to one or more membership data structures for one or more principals associated with the access control list yields a set of one or more permitted users, the set of one or more permitted users having access to a computing object that is associated with the access control list; and
use the set of mapping functions and the membership data structures to identify, for the set of computing objects, respective sets of one or more permitted users.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the instructions are further executable by the one or more processors to:
obtain metadata for the plurality of principals based at least in part on information included in the snapshot, wherein the metadata for a principal comprises an identifier of the principal, direct group membership information for the principal, a type of the principal, one or more secureness attributes associated with the principal, or any combination thereof, and wherein the direct group membership information for the principal indicates one or more groups of which the principal is a direct member.

### Claim 19 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the instructions are further executable by the one or more processors to:
identify a sequential order associated with the one or more access approvals and the one or more access denials included in an access control list for a respective computing object from among the set of computing objects; and
partition the access control list into one or more subsets of permissions based at least in part on the identified sequential order, wherein a subset of permissions comprises a single access denial of the one or more access denials and a subset of access approvals from among the one or more access approvals, and wherein generating a mapping function of the set of mapping functions for the respective computing object is based at least in part on the one or more subsets of permissions.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein, to generate a mapping function from among the set of mapping functions, the instructions are executable by the one or more processors to:
generate, for the one or more subsets of permissions, respective logical expressions that represent the one or more subsets of permissions; and
generate the mapping function based at least in part on a combination of the respective logical expressions associated with the one or more subsets of permissions included in the access control list, the mapping function associated with the respective computing object.
