Demo Data from EDBT 2026 / reviewers in the wild / expert
Pullamsetty Harika
dblp:157/0236
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Authentication and access control · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control › access control
role-based access control |
0.2 | 1 | 2015 | Meeting Cardinality Constraints in Role Mining · IEEE Trans. Dependable Secur. Comput. 2015 |
Authentication and access control › access control › role-based access control › role engineering
role mining |
0.2 | 1 | 2015 | Meeting Cardinality Constraints in Role Mining · IEEE Trans. Dependable Secur. Comput. 2015 |
Methods — techniques the papers use, named apart from their topics
heuristic algorithm · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Meeting Cardinality Constraints in Role MiningabstractRole mining is a critical step for organizations that migrate from traditional access control mechanisms to role based access control (RBAC). Additional constraints may be imposed while generating roles from a given user-permission assignment relation. In this paper we consider two such constraints which are the dual of each other. A role-usage cardinality constraint limits the maximum number of roles any user can have. Its dual, the permission-distribution cardinality constraint, limits the maximum number of roles to which a permission can belong. These two constraints impose mutually contradictory requirements on user to role and role to permission assignments. An attempt to satisfy one of the constraints may result in a violation of the other. We show that the constrained role mining problem is NP-Complete and present heuristic solutions. Two distinct frameworks are presented in this paper. In the first approach, roles are initially mined without taking the constraints into account. The user-role and role-permission assignments are then checked for constraint violation in a post-processing step, and appropriately re-assigned, if necessary. In the second approach, constraints are enforced during the process of role mining. The methods are first applied on problems that consider the two constraints individually, and then with both considered together. Both methods are evaluated over a number of real-world data sets. Pullamsetty Harika, Marreddy Nagajyothi, John C. John, Shamik Sural, Jaideep Vaidya, Vijayalakshmi Atluri |
IEEE Trans. Dependable Secur. Comput. | 1 |