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

P. V. Rajkumar

dblp:85/9568 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0001-5272-1182ORCID · reported

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

Security and privacy · 3 · 3 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
3 papers
Authentication and access control · 100%
Theoretical computer science
2 papers
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control › access control models
usage control
0.722020
Safety Decidability for Pre-Authorization Usage Control with Identifier Attribute Domains · IEEE Trans. Dependable Secur. Comput. 2020
Safety Decidability for Pre-Authorization Usage Control with Finite Attribute Domains · IEEE Trans. Dependable Secur. Comput. 2016
Authentication and access control › access control
role-based access control
0.212016
POSTER: Security Enhanced Administrative Role Based Access Control Models · CCS 2016

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

reachability analysis · 1.4ω-equivalence · 0.9decision procedure construction · 0.5
YearPublicationVenuePosition
2020 Safety Decidability for Pre-Authorization Usage Control with Identifier Attribute Domains
abstract
Safety analysis is a fundamental problem in authorization models. Safety decidable models provide theoretical foundations for decentralized security administration. Attributes of objects are central to usage control authorization models. It has previously been shown that inclusion of a single infinite attribute leads to undecidable safety, even without any creation of objects. Therefore unrestricted inclusion of infinite attributes is not possible in a safety decidable model. On the other hand, it has recently been shown that the safety problem for the pre-authorization usage control sub-model with finite attribute domains, called PreUCONAfinite, is decidable even with unbounded object creation. A major limitation of finite attributes is the inability to link objects through attribute values in presence of unbounded object creation (since attributes that reference other objects must be infinite in this case). It would be desirable to have safety-decidable attribute-based models which include both finite and infinite attributes (necessarily with some restrictions). This paper develops a pre-authorization usage control sub-model, called PreUCONAid, with attribute domains solely comprised of infinite object identifiers with considerable restrictions on how these attributes can be updated. Safety decidability for PreUCONAidis proved by defining the notion of ω-equivalent usage configurations, and showing that the reachable set of v-equivalent usage configurations is computable and can be used to answer safety questions. The utility of such models in practice is illustrated by means of an example. The paper further shows that addition of even a single finite domain attribute to PreUCONAidresults in undecidable safety. These results indicate that combining finite and infinite attributes in a safety decidable model is a challenging task, which will likely require carefully crafted restrictions on updates to these attributes. The formulation of such a model remains an important open question.
P. V. Rajkumar, Ravi S. Sandhu
IEEE Trans. Dependable Secur. Comput.1
2016 POSTER: Security Enhanced Administrative Role Based Access Control Models
abstract
Administrative rights are more powerful permissions and checking accountability of execution of admin rights is an important security measure. Most of the administrative RBAC models distribute rights to multiple administrators. Though such decentralized security management has difficulties in checking admin accountability, it is more efficient compared to centralized approach, particularly in large organizations. We introduced administrative obligations in ARBAC as a way to improve the accountability of admin users in the decentralized systems. The proposed approach would reduce the potential of security risk and improve accountability of security administrators. As the cloud and mobile applications are becoming integral part of business information systems, ensuring the accountability of admins play a vital role in system security. Obligations are well studied feature in the security literature and adding them into security administration would open up many possibilities for future developments in this direction.
P. V. Rajkumar, Ravi S. Sandhu
CCS1
2016 Safety Decidability for Pre-Authorization Usage Control with Finite Attribute Domains
abstract
This paper considers the safety problem for the pre-authorization sub-model of the well-known$UCON_{ABC}$usage control model, that is,$Pre\_UCON_A$. It is shown that$Pre\_UCON_A$with finite attribute domains has decidable safety even if arbitrary object creation is allowed. This result eliminates the previously known restrictions for obtaining safety decidability in this context, which only allow a finite bounded number of objects to be created. Our result specifically permits unbounded object creation, so the set of objects is potentially infinite. In the proof, we show that the set of reachable protection tuples in infinite state$Pre\_UCON_A$models is finite and computable. We also provide a construction for decision procedure which answers the safety question by examining the reachable protection tuples.
P. V. Rajkumar, Ravi S. Sandhu
IEEE Trans. Dependable Secur. Comput.1