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

Ken Moody

dblp:36/5483 · DBLP profile ↗
← Back
16ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

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

Security and privacy · 7 · 1 first-authorSoftware engineering, systems software and programming languages · 6 · 1 first-authorSystems, architecture and hardware · 1Computer networks · 1Databases, data management, data science and information retrieval · 1

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control › user authentication
credential-based authentication
0.011998
Access Control in an Open Distributed Environment · S&P 1998
Authentication and access control › access control
distributed access control
0.011998
Access Control in an Open Distributed Environment · S&P 1998
Authentication and access control › access control
role-based access control
0.011998
Access Control in an Open Distributed Environment · S&P 1998
Distributed systems › distributed system security
distributed authorization
0.011998
Access Control in an Open Distributed Environment · S&P 1998
Distributed systems
distributed coordination
0.011998
Access Control in an Open Distributed Environment · S&P 1998

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

role membership certificates · 0.0horn clauses · 0.0formal logic · 0.0
YearPublicationVenuePosition
2007 Dynamic trust domains for secure, private, technology-assisted living
abstract
Large scale distributed systems comprising many administration domains have been well-researched. An example is a national health service, with domains such as primary care practices, hospitals, specialist clinics, etc. A new and relatively unexplored scenario is technology-assisted living, in which domains are small, dynamically created, and is associated with units of personal living. There is a great deal of commercial interest in providing technology to support assisted living, but services are created in isolation. We explore how such services could be integrated with a system that can ensure security and privacy. We propose to audit both system behaviour and the actions of principals, holding particular regard to the fulfillment of their obligations, to establish a computational expression of the trust to be associated with each principal
Jatinder Singh, Jean Bacon, Ken Moody
ARES3
2005 Securing Publish/Subscribe for Multi-domain Systems
Jean Bacon, David M. Eyers, Ken Moody, Lauri I. W. Pesonen
Middleware3
2004 Using trust and risk in role-based access control policies
abstract
Emerging trust and risk management systems provide a framework for principals to determine whether they will exchange resources, without requiring a complete definition of their credentials and intentions. Most distributed access control architectures have far more rigid policy rules, yet in many respects aim to solve a similar problem. This paper elucidates the similarities between trust management and distributed access control systems by demonstrating how the OASIS access control system and its role-based policy language can be extended to make decisions on the basis of trust and risk analyses rather than on the basis of credentials alone. We apply our new model to the prototypical example of a file storage and publication service for the Grid, and test it using our Prolog-based OASIS implementation.
Nathan Dimmock, András Belokosztolszki, David M. Eyers, Jean Bacon, Ken Moody
SACMAT5
2003 Persistent versus Dynamic Role Membership
Jean Bacon, David W. Chadwick, Sassa Otenko, Ken Moody
DBSec4
2003 Access control and trust in the use of widely distributed services
abstract
Abstract OASIS is a role‐based access control (RBAC) architecture for achieving secure interoperation of independently managed services in an open, distributed environment. OASIS differs from other RBAC schemes in a number of ways: role management is decentralized, roles are parametrized, roles are activated within sessions and privileges are not delegated. OASIS depends on an active middleware platform to notify services of any relevant changes in their environment. Services define roles and establish formally specified policy for role activation and service use (authorization); users must present the required credentials and satisfy specified constraints in order to activate a role or invoke a service. The membership rule of a role indicates which of the role activation conditions must remain true while the role is active. A role is deactivated immediately if any of the conditions of the membership rule associated with its activation become false. OASIS introduces the notion of appointment, whereby being active in certain roles carries the privilege of issuing appointment certificates to other users. Appointment certificates capture the notion of long‐lived credentials such as academic and professional qualification or membership of an organization. The role activation conditions of a service may include appointment certificates, prerequisite roles and environmental constraints. The role activation and authorization policies of services within an administrative domain need not embody role hierarchies nor enforce privilege delegation. But OASIS is sufficiently flexible to capture such notions, through prerequisite roles and appointments, if they are required within an application domain. We define the model and architecture and discuss engineering details, including security issues. We illustrate how an OASIS session can span multiple domains and we propose a minimal infrastructure to enable widely distributed, independently developed services to enter into agreements to respect each other's credentials. In a multi‐domain system access control policy may come from multiple sources and must be expressed, enforced and managed. In order to respond to changing relationships between organizations it should be easy to allow role holders in one domain to obtain privileges in another. Our approach to policy and meta‐policy management is described. We speculate on a further extension to mutually unknown, and therefore untrusted, parties. Each party will accumulate audit certificates which embody its interaction history and which may form the basis of a web of trust. Copyright © 2003 John Wiley & Sons, Ltd.
Jean Bacon, Ken Moody, Walt Yao
Softw. Pract. Exp.2
2002 A model of OASIS role-based access control and its support for active security
abstract
OASIS is a role-based access control architecture for achieving secure interoperation of services in an open, distributed environment. The aim of OASIS is to allow autonomous management domains to specify their own access control policies and to interoperate subject to service level agreements (SLAs). Services define roles and implement formally specified policy to control role activation and service use; users must present the required credentials, in an appropriate context, in order to activate a role or invoke a service. All privileges are derived from roles, which are activated for the duration of a session only. In addition, a role is deactivated immediately if any of the conditions of the membership rule associated with its activation becomes false. These conditions can test the context, thus ensuring active monitoring of security.To support the management of privileges, OASIS introduces appointment . Users in certain roles are authorized to issue other users with appointment certificates , which may be a prerequisite for activating one or more roles. The conditions for activating a role at a service may include appointment certificates as well as prerequisite roles and constraints on the context. An appointment certificate does not therefore convey privileges directly but can be used as a credential for role activation. The lifetime of appointment certificates is not restricted to the issuing session, so they can be used as long-lived credentials to represent academic and professional qualification, or membership of an organization.Role-based access control (RBAC), in associating privileges with roles, provides a means of expressing access control that is scalable to large numbers of principals. However, pure RBAC associates privileges only with roles, whereas applications often require more fine-grained access control. Parametrized roles extend the functionality to meet this need.We motivate our approach and formalise OASIS. We first present the overall architecture through a basic model, followed by an extended model that includes parametrization.
Jean Bacon, Ken Moody, Walt Yao
ACM Trans. Inf. Syst. Secur.2
2001 Access Control and Trust in the Use of Widely Distributed Services
Jean Bacon, Ken Moody, Walt Yao
Middleware2
2001 A model of OASIS role-based access control and its support for active security
abstract
OASIS is a role-based access control architecture for achieving secure interoperation of services in an open, distributed environment. Services define roles and implement formally specified policy for role activation and service use; users must present the required credentials, in the specified context, in order to activate a role or invoke a service. Roles are activated for the duration of a session only. In addition, a role is deactivated immediately if any of the conditions of the membership rule associated with its activation becomes false.
Walt Yao, Ken Moody, Jean Bacon
SACMAT2
2001 Using Association Rules to Add or Eliminate Query Constraints Automatically
abstract
Much interesting work has been done on the use of semantic associations for optimizing query execution. Our objective is to study the use of association rules to add or eliminate constraints in the where clause of a select query. In particular, we take advantage of the following heuristics presented by Siegel et al. (1992): i) if a selection on attribute A is implied by another selection condition on attribute B and A is not an index attribute, then the selection on A can be removed from the query; ii) if a relation R in the query has a restricted attribute A and an unrestricted cluster index attribute B, then look for a rule where the restriction on A implies a restriction on B. The contribution of our work is twofold. First, we present detailed algorithms that apply these heuristics. Hence, our ideas are easy to implement. Second we discuss conditions under which it is worth applying these optimization techniques, and we show the extent to which they speed up query execution.
Agathoniki Trigoni, Ken Moody
SSDBM2
2000 Coordinating Policy for Federated Applications
Ken Moody
DBSec1
2000 An Architecture for Distributed OASIS Services
John H. Hine, Walt Yao, Jean Bacon, Ken Moody
Middleware4
1998 Access Control in an Open Distributed Environment
abstract
We describe an architecture for secure, independent, interworking services (Oasis). Each service is made responsible for the classification of its clients into named roles, using a formal logic to specify precise conditions for entering each role. A client becomes authenticated by presenting credentials to a service that enable the service to prove that the client conforms to its policy for entry to a particular role. During authentication a data structure is created that embodies the proof. An authenticated client is issued a role membership certificate (RMC) for its subsequent use with that service. An RMC is an encryption-protected capability which includes the role name, the identity of the principal to which it was issued and a reference to the issuing service. A proof rule of one service may refer to an authenticated user of another; that is, an RMC issued by one service may be required as a credential during authentication by another. A dynamic proof tree may thus be built which exhibits amongst other things the trust relationships between the services which the client has entered. The paper shows how a service may define a set of proof rules (Horn clauses) that specify who may use it and in what way. Delegation of rights may be expressed naturally within these rules. It goes on to present the design details of the system. The system is inherently decentralised and has a tuneable reaction to network or server failure which allows services to make appropriate decisions when authorization or revocation information is unavailable. A prototype system has been implemented and tested.
Richard Hayton, Jean Bacon, Ken Moody
S&P3
1997 An Open Architecture for Secure Interworking Services
abstract
There is a developing need for applications and distributed services to cooperate or interoperate. The article describes an architectural approach to security. The key idea is that a process is the universal client entity; a process may act on behalf of an identified individual as in traditional security schemes. More generally, a process may adopt an application specific name or role, and this is used as the basis for authentication in Oasis. A service may then be written in terms of service specific categories of clients, decoupled from the mechanisms used to specify and enforce access control policy. This approach allows great flexibility when integrating a number of services, and reduces the mismatch of policies that is common in heterogeneous systems. In addition, Oasis services may be integrated with alternative authentication and access control schemes, providing a truly open architecture. A flexible security definition is meaningless if not backed by a robust and efficient implementation. Oasis has been fully implemented, and is inherently distributed and scalable. We describe the general approach, then concentrate on revocation, where security designs are most often criticised. Oasis is unique in supporting the rapid and selective revocation of privileges which can cascade between services and organisations.
Richard Hayton, Ken Moody
ICDCS2
1997 Providing World Wide Access to Historical Sources
Tim Mills, Ken Moody, Kerry Rodden
Comput. Networks2
1983 The Design and Implementation of CODD
T. J. King, Ken Moody
Softw. Pract. Exp.2
1980 A Coroutine Mechanism for BCPL
abstract
Abstract In recent years interest in coroutines has increased considerably and their usefulness is no longer in question. This paper describes a simple coroutine mechanism that fits neatly into the philosophy of the BCPL language. A few diverse applications of the mechanism are presented at the end.
Ken Moody, Martin Richards
Softw. Pract. Exp.1