Abstract: Computerized methods and systems obtain a first resource identifier that identifies a first electronic resource. An association of the first electronic resource with one or more other electronic resources that are identified by resource identifiers in an identifier set is determined. The identifier set includes zero or more resource identifiers that identify electronic resources that are classified as sensitive. A type of environment to which the first electronic resource belongs is determined. A number of users in a user set that are associated with the first electronic resource is computed. The user set includes zero or more users that are classified as users of interest. A determination of whether the first electronic resource is sensitive is made based on a combination of the determined association, determined type of environment, and computed number of users.

Abstract: Based on received first criteria, computerized methods and systems select from one or more first set of computerized directories, that store information about subjects, resources, actions, and privileges associated with an organization, subsets of each of: subjects, groups of subjects, privileges, resources, groups of resources, and actions. Based on received second criteria, the computerized methods and systems select from one or more second set of directories a subset of activity logs that store information related to activities performed by subjects on resources. The computerized methods and systems generate a relationship graph using the selected subsets of subjects, groups of subjects, privileges, resources, groups of resources, actions, and activity logs, and apply a set of circulation problem constraints to the relationship graph to produce a constrained relationship graph.

Abstract: Computerized methods and systems obtain filtered candidate rules associated with components. Each component includes subsets of subjects associated with an organization and subsets of resources associated with the organization. The filtered candidate rules are optimized by a quantum optimization engine to produce optimized rules. Additional rules are produced from the optimized rules by a rule augmenter, and an updated set of rules is formed from the optimized rules and the additional rules. The updated rules are consolidated to produce new rules by taking the union of sets of the updated rules associated with two or more components. The optimizing, augmenting, and consolidating are repeated until only a single set of rules associated with a single component remains.