Basic Access Control Research Articles

Analysis of the features of the protection system of the domestic special-purpose operating system

The paper considers the task of studying the features of the protection system of the operating system Astra linux 1.6 SE (Further OS Astra 1.6 SE). The basic principles of access control, functional features of protection modules, settings of some configuration files of the operating system, as well as types and features of classification marks are revealed. The result of this work is the proposal for the implementation of the possibility of configuring the basic access control mechanisms without using a graphical shell, the study of the principle of operation of these mechanisms, as well as the use of the features of kernel modules, configuration files for the design of a security system for computer facilities by information protection units. This operating system has a specific feature of the structure of the security system, since it includes mechanisms for mandatory access control, allowing access to be denied or allowed depending on the user's authority. The exchange and processing of information occurs with the use of classification labels, which make it possible to delimit information flows of different mandated contexts. These labels are written in accordance with GOST R 58256-2018 “Information security. Information flow control in the information system. Format of classification marks”. The paper analyzes traffic in different mandated sessions, and also considers the behavior of information flows regarding interaction in a network of computers with the installed OS Astra linux 1.6 SE and the security system configured on it. In this case, the exchange of data will occur both with users in the same sessions and in different ones that differ between computers.

A topic‐centric access control model for the publish/subscribe paradigm

SummaryThe publish/subscribe paradigm provides loosely coupled and scalable communication for the Internet of Things (IoT). In this paradigm, access control is an efficient approach to guaranteeing security. However, existing access control methods are not suitable for the publish/subscribe paradigm in the sensing layer of the IoT due to their coarse‐grained controls and lack of self‐configuration. To address these problems, in this paper, we propose a topic‐centric access control model (TCAC) to realize fine‐grained authorization for the sensing layer of the IoT. First, we use topics, a fundamental concept for the publish/subscribe paradigm, as the basic access control unit to dynamically authorize access according to the attributes of devices, users, and topics. Second, an administration model for TCAC is proposed to manage these attributes and configure access policies to effectively implement user‐driven access controls. Finally, a healthcare case is used to demonstrate the security of the proposed TCAC. The results show that our model is dynamic, fine‐grained, and user driven.

Basic MAC Scheme for RF Energy Harvesting Wireless Sensor Networks: Throughput Analysis and Optimization.

Traditionally, how to reduce energy consumption has been an issue of utmost importance in wireless sensor networks. Recently, radio frequency (RF) energy harvesting technologies, which scavenge the ambient RF waves, provided us with a new paradigm for such networks. Without replacement or recharge of batteries, an RF energy harvesting wireless sensor network may live an eternal life. Against theoretical expectations, however, energy is scarce in practice and, consequently, structural naiveté has to be within a MAC scheme that supports a sensor node to deliver its data to a sink node. Our practical choice for the MAC scheme is a basic one, rooted in ALOHA, in which a sensor node simply repeats harvesting energy, backing off for a while and transmitting a packet. The basic medium access control (MAC) scheme is not able to perfectly prevent a collision of packets, which in turn deteriorates the throughput. Thus, we derive an exact expression of the throughput that the basic MAC scheme can attain. In various case studies, we then look for a way to enhance the throughput. Using the throughput formula, we reveal that an optimal back-off time, which maximizes the total throughput, is not characterized by the distribution but only by the mean value when the harvest times are deterministic. Also, we confirm that taking proper back-off times is able to improve the throughput even when the harvest times are random. Furthermore, we show that shaping the back-off time so that its variance is increased while its mean remains unchanged can help ameliorate the throughput that the basic MAC scheme is able to achieve.

Risk aware Access Control model for Trust Based collaborative organizations in cloud

Secure interactions between collaborative organizations having their applications and data stored in “Cloud Computing” are a critical issue. Access control is the biggest challenge and trust is regarded as an essential secured relationship within a distributed system. Basic access control models, like Discretionary Access Control, Mandatory Access Control, and Role Based Access Control, cannot satisfy requirements in such environment, and need some improvements. During the collaboration, the attitude of the user may change. Therefore, in this context, adding trust management to an access control model is mandatory. To achieve this goal, in this paper, a new trust model to control access in the cloud is proposed. The aim is to monitor in real-time security for collaborative organizations, having decided to migrate to the cloud.

Encryption techniques & access control models for data security: A survey

In the process of sending information from sender to receiver, an unauthorized user may work in an active way (update it) or passive way (read or delay in sending). There must be some techniques which assures receiver that whatever information received from authorized user as well as must be same as sent from sender side, in addition to this receiver never make Denial of service. Nowadays sharing of information or resources is a very common thing from single user to the network to the cloud. When information is moving from one node to another node, security is a big challenge. When information is stored on the user’s computer, it is under control but when it is in movement user lose control over it. In the world of security, to convert information from one form to another form, Encryption is used, so that only authorized party will able to read. Encryption is a technique for any security-conscious organization.In this paper, we present basic access control models along with encryption techniques.

Enhancing the security of e-passports using a secure key management framework

E-passport or biometric passport is a hybrid document that combines paper format with electronic capabilities. They have been adopted by more than 45 countries to avoid counterfeiting of regular passports. MRTDs were introduced by the International Civil Aviation Organization (ICAO) in its Document 9303 which provides a set of rules and standards for e-passports. E-passports are based on the RFID technology, where the reader and the chip communicate through a wireless channel. Thus, an access control mechanism is necessary for privacy protection. In the early versions of e-passports, it was reported that various kind of security attacks was possible. BAC was proposed by ICAO and provides a mutual authentication and an encrypted communication channel between the IS and e-passport to prevent skimming and eavesdropping. In this paper, certain security weaknesses of e-passports have been discussed and their possible solutions are proposed. The Basic Access Control is also discussed in detail since it forms the basis for our proposed solution. Finally, we propose an alternative method for the generation and management of the initial access key (Kseed) which is input to the BAC algorithm.

On the Security of Data Access Control for Multiauthority Cloud Storage Systems

Data access control has becoming a challenging issue in cloud storage systems. Some techniques have been proposed to achieve the secure data access control in a semitrusted cloud storage system. Recently, K. Yang et al. proposed a basic data access control scheme for multiauthority cloud storage system (DAC-MACS) and an extensive data access control scheme (EDAC-MACS). They claimed that the DAC-MACS could achieve efficient decryption and immediate revocation and the EDAC-MACS could also achieve these goals even though nonrevoked users reveal their Key Update Keys to the revoked user. However, through our cryptanalysis, the revocation security of both schemes cannot be guaranteed. In this paper, we first give two attacks on the two schemes. By the first attack, the revoked user can eavesdrop to obtain other users’ Key Update Keys to update its Secret Key, and then it can obtain proper Token to decrypt any secret information as a nonrevoked user. In addition, by the second attack, the revoked user can intercept Ciphertext Update Key to retrieve its ability to decrypt any secret information as a nonrevoked user. Secondly, we propose a new extensive DAC-MACS scheme (NEDAC-MACS) to withstand the above two attacks so as to guarantee more secure attribute revocation. Then, formal cryptanalysis of NEDAC-MACS is presented to prove the security goals of the scheme. Finally, the performance comparison among NEDAC-MACS and related schemes is given to demonstrate that the performance of NEDAC-MACS is superior to that of DACC, and relatively same as that of DAC-MACS.

From Security Protocols to Pushdown Automata

Formal methods have been very successful in analyzing security protocols for reachability properties such as secrecy or authentication. In contrast, there are very few results for equivalence-based properties, crucial for studying, for example, privacy-like properties such as anonymity or vote secrecy. We study the problem of checking equivalence of security protocols for an unbounded number of sessions. Since replication leads very quickly to undecidability (even in the simple case of secrecy), we focus on a limited fragment of protocols (standard primitives but pairs, one variable per protocol’s rules) for which the secrecy preservation problem is known to be decidable. Surprisingly, this fragment turns out to be undecidable for equivalence. Then, restricting our attention to deterministic protocols, we propose the first decidability result for checking equivalence of protocols for an unbounded number of sessions. This result is obtained through a characterization of equivalence of protocols in terms of equality of languages of (generalized, real-time) deterministic pushdown automata. We further show that checking for equivalence of protocols is actually equivalent to checking for equivalence of generalized, real-time deterministic pushdown automata. Very recently, the algorithm for checking for equivalence of deterministic pushdown automata has been implemented. We have implemented our translation from protocols to pushdown automata, yielding the first tool that decides equivalence of (some class of) protocols, for an unbounded number of sessions. As an application, we have analyzed some protocols of the literature including a simplified version of the basic access control (BAC) protocol used in biometric passports.

On the Throughput of Two-Way Relay Networks Using Network Coding

Network coding has shown the promise of significant throughput improvement. In this paper, we study the network throughput using network coding and explore how the maximum throughput can be achieved in a two-way relay wireless network. Unlike previous studies, we consider a more general network with arbitrary structure of overhearing status between receivers and transmitters. To efficiently utilize the coding opportunities, we invent the concept of network coding cliques (NCCs), upon which a formal analysis on the network throughput using network coding is elaborated. In particular, we derive the closed-form expression of the network throughput under certain traffic load in a slotted ALOHA network with basic medium access control. Furthermore, the maximum throughput as well as optimal medium access probability at each node is studied under various network settings. Our theoretical findings have been validated by simulation as well.

Power and bandwidth efficiency of wireless mesh networks

As a prevalent network topology, mesh, has been actively researched and developed as a key solution to improve the performance and services of wireless communications. In this study, the authors carry out a comprehensive analysis of the bandwidth efficiency (BE) in b/s/Hz and power efficiency (PE) in b/s/Hz/W of carrier sense multiple access with collision avoidance, the basic medium access control protocol for wireless mesh networks (WMNs). Analysis results show that the suboptimal, not the maximal, power and BE can be achieved simultaneously under the same conditions, for example, the number of competing nodes and contention windows. Hence, the authors present a heuristic bandwidth-PE tradeoff design. Simulation results show that the authors proposed protocol works well in both single-hop and multi-hop WMNs.

BioPACE

While developing the specifications for electronically enabled Machine Readable Travel Documents, the ICAO paid significant attention to security aspects related to the digital information stored in this type of electronic document. This has resulted in Passive and Active Authentication, Basic Access Control and Extended Access Control. The goal of Basic Access Control (BAC) is preventing unauthorized access to the chip data stored on eMRTDs. The PACE protocol has been developed as a future-proof method to overcome the limitations of BAC and to replace BAC in the future. In this paper the BioPACE protocol is proposed as a supplement to the PACE protocol. Besides verifying if the document holder is indeed the rightful owner, the BioPACE protocol provides a higher convenience for the bearer of the document.

Modelling and analysing medium access delay for differentiated services in IEEE 802.11s wireless mesh networks

Wireless mesh networks (WMNs) has been actively explored for a few years, and the IEEE 802.11 Task Group “s” has recently approved the active 802.11s standard for Wireless local area network (WLAN) mesh networking. To provide differentiated channel access and quality of service (QoS) guarantees for multimedia flows, IEEE 802.11s standard employs enhanced distributed channel access (EDCA) as the basic medium access control (MAC) protocol. In this study, the authors focus on modelling and analysing the medium access delay differentiation of EDCA under saturation condition in multi-hop WMNs. The authors develop a three-dimensional Markov chain model to evaluate the medium access delay differentiation of EDCA. In this model, the authors fully consider the performance impact of Request to Send (RTS) frame collisions and data frame collisions and then put forward the pseudo states to distinguish the different back-off procedures induced by these collisions. Using this analytical model, the authors derive the average medium access delay for the flows with different priorities. Comparisons with the simulation results show that the analytical model is extremely accurate.

City on the Sky: Extending XACML for Flexible, Secure Data Sharing on the Cloud

Sharing data from various sources and of diverse kinds, and fusing them together for sophisticated analytics and mash-up applications are emerging trends, and are prerequisites for realizing grand visions such as that of cyber-physical systems enabled smart cities. Cloud infrastructure can enable such data sharing both because it can scale easily to an arbitrary volume of data and computation needs on demand, as well as because of natural collocation of diverse such data sets within the infrastructure. However, in order to convince data owners that their data are well protected while being shared among cloud users, the cloud platform needs to provide flexible mechanisms for the users to express the constraints (access rules) subject to which the data should be shared, and likewise, enforce them effectively. We study a comprehensive set of practical scenarios where data sharing needs to be enforced by methods such as aggregation, windowed frame, value constrains, etc., and observe that existing basic access control mechanisms do not provide adequate flexibility to support effective data sharing in a secure and controlled manner. In this paper, we thus propose a framework for cloud that extends popular XACML model significantly by integrating flexible access control decisions and data access in a seamless fashion. We have prototyped the framework and deployed it on commercial cloud environment for experimental runs to test the efficacy of our approach and evaluate the performance of the implemented prototype.

A survey of system security in contactless electronic passports

A traditional paper-based passport contains a Machine-Readable Zone (MRZ) and a Visual Inspection Zone (VIZ). The MRZ has two lines of the holder’s personal data, document data, and verification characters encoded using Optical Character Recognition font B (OCR-B). The encoded data include the holder’s name, date of birth, and other identity information of the holder. The VIZ contains the holder’s photo with signature and is usually placed on the data page of a paper passport. However, the MRZ and VIZ can be easily duplicated with normal document reproduction technology to produce a fake passport which can pass traditional verification. Neither of these features actively verify the holder’s identity; nor do they bind the holder’s identity to the document in a fool proof way. A passport also contains blank pages for visa stamps and country entry or exit dates. Any of this information can be easily altered to produce fake permissions and travel records. The electronic passport, supporting authentication using secure credentials on a tamper-resistant chip, is an attempt to improve the security of paper-based passport at minimum cost. This paper surveys security mechanisms built in first-generation electronic passports and compares them with second-generation passports. It analyzes and describes the cryptographic protocols used in Basic Access Control (BAC) and Extended Access Control (EAC).

A survey of system security in contactless electronic passports

A traditional paper-based passport contains a Machine-Readable Zone (MRZ) and a Visual Inspection Zone (VIZ). The MRZ has two lines of the holder's personal data, some document data, and verification characters encoded using the Optical Character Recognition font B (OCR-B), described in the appendix. The encoded data includes the holder's name, date of birth, and other identifying information for the holder or the document. The VIZ contains the holder's photo and signature, usually on the data page. However, the MRZ and VIZ can be easily duplicated with normal document reproduction technology to produce a fake passport which can pass traditional verification. Neither of these features actively verify the holder's identity; nor do they bind the holder's identity to the document. A passport also contains pages for stamps of visas and of country entry and exit dates, which can be easily altered to produce fake permissions and travel records. The electronic passport, supporting authentication using secure credentials on a tamper-resistant chip, is an attempt to improve on the security of the paper-based passport at minimum cost. This paper surveys the security mechanisms built into the first-generation of authentication mechanisms and compares them with second-generation passports. It analyzes and describes the cryptographic protocols used in Basic Access Control (BAC) and Extended Access Control (EAC).

Semantics-based Access Control Approach for Web Service

Due to the open and distributed characteristics of web service, its access control becomes a challenging problem which has not been addressed properly. In this paper, we show how semantic web technologies can be used to build a flexible access control system for web service. We follow the Role-based Access Control model and extend it with credential attributes. The access control model is represented by a semantic ontology, and specific semantic rules are constructed to implement such as dynamic roles assignment, separation of duty constraints and roles hierarchy reasoning, etc. These semantic rules can be verified and executed automatically by the reasoning engine, which can simplify the definition and enhance the interoperability of the access control policies. The basic access control architecture based on the semantic proposal for web service is presented. Finally, a prototype of the system is implemented to validate the proposal.

Cross-Domain Data Sharing in Distributed Electronic Health Record Systems

Cross-organization or cross-domain cooperation takes place from time to time in Electronic Health Record (EHR) system for necessary and high-quality patient treatment. Cautious design of delegation mechanism must be in place as a building block of cross-domain cooperation, since the cooperation inevitably involves exchanging and sharing relevant patient data that are considered highly private and confidential. The delegation mechanism grants permission to and restricts access rights of a cooperating partner. Patients are unwilling to accept the EHR system unless their health data are guaranteed proper use and disclosure, which cannot be easily achieved without cross-domain authentication and fine-grained access control. In addition, revocation of the delegated rights should be possible at any time during the cooperation. In this paper, we propose a secure EHR system, based on cryptographic constructions, to enable secure sharing of sensitive patient data during cooperation and preserve patient data privacy. Our EHR system further incorporates advanced mechanisms for fine-grained access control, and on-demand revocation, as enhancements to the basic access control offered by the delegation mechanism, and the basic revocation mechanism, respectively. The proposed EHR system is demonstrated to fulfill objectives specific to the cross-domain delegation scenario of interest.

Hybrid Mandatory Integrity Model Composed of Biba and Clark-Wilson Policy

商业应用需要实施完整性策略保护.Biba模型提供了一种简洁的多级完整性控制方案,但是需要引入可信主体来保证实施的可用性.而Clark-Wilson模型通过可监控的状态转换提供了一种完备的完整性保护,但其复杂性影响了该模型的完整实现.提出的模型以Biba严格完整性策略为基础,同时根据可信主体在其生命周期所属的状态实施Biba低水标策略.对可信主体在其生命周期发生的状态转换及相应的低水标参数调整,采用Clark-Wilson模型来进行监控.在有效解决了Biba策略的可用性问题和Clark-Wilson模型监控量过大给系统带来的配置和运行负担问题的同时,继承它们的优点.证明了该策略融合方案是可行的、安全的.;Commercial application requires protection of integrity policy. Biba model provides a simple multi-level integrity access control scheme but it needs the introduction of trusted subject to ensure the usability. Clark-Wilson model provides a complete integrity protection by means of controlled state transaction, but its entire implementation is hindered by its complication. This paper proposes a model that enforces Biba strict integrity policy as basic access control mechanism, at the same time enforces Biba low-water-mark policy on trusted subjects according to the state in their lifecycle. Clark-Wilson model is used to control and audit subject’s state transition and run time adjustment of low-water-mark policy parameters. This paper solves the usability problem introduced by Biba policies and high configuration burden and runtime overload introduced by massive supervising task of Clark-Wilson, while at the same time borrows their merits. This policy composition scheme is proved to be applicable and secure.

VideoAcM: a transitive and temporal access control mechanism for collaborative video database production applications

Access control models play an important role in database management systems. In general, there are three basic access control models: Discretionary Access Control (DAC), Mandatory Access Control (MAC), and Non-Discretionary Access Control (NAC). Currently, the majority of commercial DBMSs provide only DAC, and some temporal access control models have been derived based on either DAC or NAC. In the context of video database applications, since the structure of video data is complex in nature, it requires a specific and tailor-made access control mechanism which should include MAC as well as DAC and NAC. However, only few efforts have been put on access control models for video database systems. In this paper, a transitive and temporal access control mechanism for collaborative video database production applications has been proposed, which subsumes the properties of DAC, MAC, and NAC. Moreover, our proposed mechanism is integrated with the intellectual property concerns by constructing an access control hierarchy of video data with authorization rules. In particular, our mechanism can derive novel authorization rules not only on conventional client-data access control, but also on data---data access control. Besides video data, the proposed model is applicable to other data types which exhibit a hierarchical data structure.

The Styx® architecture for distributed systems

A distributed system is constructed from a set of relatively independent components that form a unified but geographically and functionally diverse entity. Examples include networked operating systems, Internet services, the national telephone switching system, and, in general, all the technology using today's diverse digital networks. Nevertheless, distributed systems remain difficult to design, build, and maintain, primarily due to the lack of a clean, perspicuous interconnection model for the components. Our experience with two distributed operating systems, Plan 9® and Inferno®, encourages us to propose such a model. These systems depend on, advocate, and generally push to the limit a fruitful idea — to present their resources as files in a hierarchical name space. The objects appearing as files may represent stored data, but they may also be devices, dynamic information sources, interfaces to services, and control points. The approach unifies and provides basic naming, structuring, and access control mechanisms for all system resources. A simple underlying network protocol, Styx®, forms the core of the architecture by presenting a common language for communication within the system. Even within nondistributed systems, the presentation of services as files advantageously extends a familiar scheme for naming, classifying, and connecting to system resources. More important, the approach provides a natural way to build distributed systems by using well-known technology for attaching remote file systems. If resources are represented as files and there are remote file systems, one has a distributed system — resources available in one place are usable from another.