9807251
Originator Control in Usage Control
Originator Control is an access control policy that requires recipients to gain originator’s approval for redissemination of disseminated digital object. Originator control policies are one of the generic and key concerns of usage control. Usage control is an emerging concept which encompasses traditional access control and digital rights management solutions. However, current commercial Digital Rights Management (DRM) solutions lack enforcement of access control policies such as role-based access control (RBAC), mandatory access control (MAC), discretionary access control (DAC) and originator control because their control of access to digital object is mainly based on payment. In this paper, we attempt to combine originator control policies and usage control. Then we show how this can extend traditional originator control solutions to enforce access control policies even outside of a local control environment where a central control authority is not available. License and ticket concepts are proposed and used for originator control in usage control. Also, we define seven different solution approaches to deal with various dissemination situations. In addition, we discuss some published DRM solutions and relate these to our solution approaches.
15806644
Attribute Mutability in Usage Control
The notion of Usage Control (UCON) has been introduced recently to extend traditional access controls by including three decision factors called authorizations, obligations, and conditions. Usage control also recognize two important decision properties of continuity and mutability. In access control literature, an authorization decision is commonly made by utilizing some form of subject and object attributes. Identities, security labels and roles are some examples of attributes. Traditionally these attributes are assigned to subjects and objects by a security officer and can be modified only by administrative actions. However, in modern information systems these attributes are often required to be changed as a side effect of subject’s usage on object. This requirement of updates has been recognized and defined as mutability property in usage control. In this paper, we discuss issues of this attribute mutability and show how usage control can apply this mutability property in various traditional and modern access control policies.
15933972
A logical specification for usage control
Recently presented usage control (UCON) has been considered as the next generation access control model with distinguishing properties of decision continuity and attribute mutability. Ausage control decision is determined by combining authorizations, obligations, and conditions, presented as UCONABC core models by Park and Sandhu. Based on these core aspects, we develop afirst-order logic specification of UCON with Lamport's temporallogic of actions (TLA). The building blocks of this model include:(1) a sequence of states expressed by attributes of subjects, objects, and the system, (2) state predicates on subject andobject attributes, (3) pre-defined authorization actions performed by the security system and subjects, (4) obligation actions, and(5) condition predicates on system attributes. For a UCON model we define a set of temporal logic formulas that hold as usage control policies. We show the flexibility and expressive capability of this logic model by specifying the new features and core models of UCON.
5714667
Extending software communications architecture for QoS support in SDR signal processing
The software communications architecture (SCA) is middleware for providing component interfaces and dynamic reconfigurability to software define radio (SDR) modems and it is widely adopted by the SDR forum. Although its main application domains include real-time signal processing, SCA lacks QoS support. We thus propose a QoS-enabled extension of SCA called Q-SCA. Our extended architecture incorporates a new waveform model, extended domain profiles that describe QoS requirements, and a modified application instantiation process that supports both admission control and resource allocation. We show the viability of Q-SCA through full implementation and experiments.
45151226
A Framework for Trusted Wireless Sensor Networks
Wireless sensor technologies have become increasingly important in a variety of areas, including mission-critical applications. However, there are still many obstacles that we need to overcome before we apply the current wireless sensor network (WSN) technologies. Unlike traditional computing devices in a wired environment, the WSN faces significant challenges from wireless node devices, which usually have limitations in computational power, energy, and their working environment. In this paper we introduce a framework for a trusted large-scale WSN that provides a longer sensor lifetime, cost effectiveness, security, survivability, and scalable management. Our framework uses clustering mechanisms and multiple cluster heads within a cluster where we switch the cluster heads based on their current energy levels or security/survivability reasons. We also present the Extended Random Key Pre-distribution scheme adapted for such a framework.
13229931
A Haptic Teleoperation Approach Based on Contact Force Control
This paper presents a new teleoperation approach using a virtual spring, and local contact force control on the slave robot. The operational space framework provides the control structure needed to achieve decoupled task dynamics. A virtual spring connects the master and slave systems and a closed-loop force controller compensates for the dynamics of the slave system, rendering transparent the effector of the slave robotic system. The active force control approach allows the desired motion and contact forces to be combined in a single force command. The required performance and robustness of force control are achieved by a full state reconstruction using a modified Kalman estimator, which addresses disturbances and modeling uncertainties. The performance of both telepresence and force control are further improved by on-line stiffness estimation of the object in contact with the effector. The redundancy of the mobile manipulation system is addressed through a decoupled decomposition of task and posture dynamics.
6952634
A middleware approach for SAINT (secure, automatic, interoperable, and transparent) peer-to-peer content services
Expanded use of the Internet and technological advances are eliciting changes in how individuals manage and share their contents. The Internet has been primarily a client-server-based system, where it is challenging to keep contents up-to-date and consistent among all of the devices. Furthermore, the client-server model has service limitations in heterogeneous computing environments. However, a new peer-to-peer (P2P) model has emerged. In this P2P workplace, each participant (peer) acts as both client and content provider. Compared with services performed by the client-server model, P2P-based content management services have several advantages. In P2P environments, users can manage heterogeneous information resources residing in various platforms perhaps in different policy environments. A P2P-based content management model can provide higher resource availability due to the distributed nature of P2P computing. However, wide-scale application of P2P computing is constrained by limitations associated with the especially sophisticated control mechanisms needed between peers: most current P2P technologies simply focus on sharing services rather than on controls between the peers. In this paper, we introduce a middleware approach to support the underlying mechanisms, providing secure, automatic, interoperable, and transparent (SAINT) services for P2P content management. The underlying mechanisms are based on machine-understandable metadata. Our middleware approach using metadata facilitates the SAINT content management services with rich metadata expression in P2P computing environments. The broad dissemination of our approach allows the application of P2P technology to more reliable and efficient content services within organization or inter-organizations.
1384536
Mining association rules with adjustable accuracy
In this paper, we devise efficient algorithms for mining association rules with adjustable accuracy. It is noted that several applications require mining the transaction data to capture the customer behavior frequently. In those applications, the efficiency of data mining could be a more important faktor t.han the requirement for complete accuracy of the mining results. Allowing imprecise results can significantly improve the data mining efficiency. In this paper, two methods for mining association rules with adjustable accuracy are developed. By dealing with the concept of sampling, both methods obtain some essential knowledge from a sampled subset first, and in light of that knowledge, perform efficient association rule mining on the entire database. A technique of relaxing the support factor based on the sampling size is devised to achieve the desired level of accuracy. These two methods differ from each other in their ways of utilizing the sampled data. Performance of these two methods is comparatively analyzed. As shown by our experimental results, the relaxation factor, as well as the sample size, can be properly adjusted so as to improve the result accuracy while minimizing the corresponding execution time, thereby allowing us to effectively achieve a design trade-off between accuracy and efficiency with two control parameters. It is shown that with the advantage of controlled sampling, the proposed methods are very flexible and efficient, and can in general lead to results of a very high degree of accuracy.