Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tanjila Mawla

dblp:320/7596 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0001-6186-744XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021

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
2 papers
Authentication and access control · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Theoretical computer science
1 paper
Logic in computer science · 50% Automated reasoning and model checking · 50%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control › access control models
attribute-based access control
1.522025
SecureFedPROM: A Zero-Trust Federated Learning Approach With Multi-Criteria Client Selection · IEEE J. Sel. Areas Commun. 2025
Reachability Analysis for Attributes in ABAC With Group Hierarchy · IEEE Trans. Dependable Secur. Comput. 2023
Machine learning › Efficient and distributed learning › federated learning
client selection
0.912025
SecureFedPROM: A Zero-Trust Federated Learning Approach With Multi-Criteria Client Selection · IEEE J. Sel. Areas Commun. 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
SecureFedPROM: A Zero-Trust Federated Learning Approach With Multi-Criteria Client Selection · IEEE J. Sel. Areas Commun. 2025
Authentication and access control › access control
access control management
0.712023
Reachability Analysis for Attributes in ABAC With Group Hierarchy · IEEE Trans. Dependable Secur. Comput. 2023
Edge and fog computing
edge intelligence
0.312025
SecureFedPROM: A Zero-Trust Federated Learning Approach With Multi-Criteria Client Selection · IEEE J. Sel. Areas Commun. 2025
Automated reasoning and model checking
reachability
0.212023
Reachability Analysis for Attributes in ABAC With Group Hierarchy · IEEE Trans. Dependable Secur. Comput. 2023
Logic in computer science
transition systems
0.212023
Reachability Analysis for Attributes in ABAC With Group Hierarchy · IEEE Trans. Dependable Secur. Comput. 2023

Methods — techniques the papers use, named apart from their topics

PROMETHEE · 2.6multi-criteria decision-making · 1.7polynomial-time algorithm · 1.3PSPACE complexity analysis · 1.3multi-criteria decision making · 0.9
YearPublicationVenuePosition
2025 SecureFedPROM: A Zero-Trust Federated Learning Approach With Multi-Criteria Client Selection
abstract
Federated Learning (FL) enables decentralized learning while preserving data privacy. However, ensuring security and optimizing resource utilization in FL remains challenging, particularly in untrusted environments. To address this, we propose SecureFedPROM, a novel zero-trust FL framework that integrates Attribute-Based Access Control (ABAC) for secure client authorization and Preference Ranking Organization Method for Enrichment of Evaluations (PROMETHEE) for dynamic, multi-criteria client selection. Unlike traditional FL client selection methods that prioritize security or efficiency, SecureFedPROM optimizes trustworthiness, computational efficiency, and performance, ensuring robust participation in each training round. We evaluate SecureFedPROM across multiple real-world datasets, demonstrating its superiority over state-of-the-art client selection protocols. Our results show that SecureFedPROM achieves a 7.19% improvement in model accuracy, accelerates convergence, and reduces the number of training rounds. Additionally, it minimizes wall-clock time and computational overhead, making it highly scalable for edge AI environments. These findings highlight the importance of integrating zero-trust security principles with multi-criteria decision-making to enhance security and efficiency in FL.
Mehreen Tahir, Tanjila Mawla, Feras M. Awaysheh, Sadi Alawadi, Maanak Gupta, Muhammad Intizar Ali
IEEE J. Sel. Areas Commun.2
2023 Reachability Analysis for Attributes in ABAC With Group Hierarchy
abstract
Attribute-based access control (ABAC) models are widely used to provide fine-grained and adaptable authorization based on the attributes of users, resources, and other relevant entities. Hierarchical group and attribute based access control (HGABAC) model was recently proposed which introduces the novel notion of attribute inheritance through group membership. GURAGwas subsequently proposed to provide an administrative model for user attributes in HGABAC, building upon the ARBAC97 and GURA administrative models. The GURA model uses administrative roles to manage user attributes. The reachability problem for the GURA model is to determine what attributes a particular user can acquire, given a predefined set of administrative rules. This problem has been previously analyzed in the literature. In this article, we study the user attribute reachability problem based on directly assigned attributes of the user and attributes inherited via group memberships. We first define a restricted form of GURAG, called rGURAGscheme, as a state transition system with multiple instances having different preconditions and provide reachability analysis for each of these schemes. In general, we show PSPACE-complete complexity for all rGURAGschemes. We further present polynomial time algorithms with empirical experimental evaluation to solve special instances of rGURAGschemes under restricted conditions.
Maanak Gupta, Ravi S. Sandhu, Tanjila Mawla, James O. Benson
IEEE Trans. Dependable Secur. Comput.3
2022 BlueSky: Activity Control: A Vision for "Active" Security Models for Smart Collaborative Systems
abstract
Cyber physical ecosystem connects different intelligent devices over heterogeneous networks. Various operations are performed on smart objects to ensure efficiency and to support automation in smart environments. An Activity (defined by Gupta and Sandhu) reflects the current state of an object, which changes in response to requested operations. Due to multiple running activities on different objects, it is critical to secure collaborative systems considering run-time decisions impacted due to related activities (and other parameters) supporting active enforcement of access control decision. Recently, Gupta and Sandhu proposed Activity-Centric Access Control (ACAC) and discussed the notion of activity as a prime abstraction for access control in collaborative systems. The model provides an active security approach that considers activity decision factors such as authorizations, obligations, conditions, and dependencies among related device activities. This paper takes a step forward and presents the core components of an ACAC model and compares with other security models differentiating novel properties of ACAC. We highlight how existing models do not (or in limited scope) support 'active' decision and enforcement of authorization in collaborative systems. We propose a hierarchical structure for a family of ACAC models by gradually adding the properties related to notion of activity and discuss states of an activity. We highlight the convergence of ACAC with Zero Trust tenets to reflect how ACAC supports necessary security posture of distributed and connected smart ecosystems. This paper aims to gain a better understanding of ACAC in collaborative systems supporting novel abstractions, properties and requirements.
Tanjila Mawla, Maanak Gupta, Ravi S. Sandhu
SACMAT1