Search

The Interconnected Network or the Internet has revolutionized digital communications. It has expanded worldwide over the past four decades due to numerous features such as connectivity, transparency, hierarchy, and openness. Several drawbacks, including mobility, scalability, controllability, security, etc., have been presented due to continuous developments. Although several network paradigms exist to address such drawbacks, many issues still persist. This research proposed a future network paradigm that addresses multilevel security shortcomings. It suggested the following: (i) a two-router network-based cyber security architecture for multilevel data sharing; (ii) using a scheduler to deal with the multilevel transmitted packets scheduling problem; (iii) five algorithms for the studied difficult problem; and (iv) providing an experimental result to show the optimal results obtained by the developed algorithms and comparing it with algorithms in the literature. The experimental result shows that the random-grouped classification with shortest scheduling algorithm (RGS) performed the best at 37.7% with a gap of 0.03. This result proves the practicality of our approach in terms of two-machine scheduling problems.

The exponential advancement in telecommunication embeds the Internet in every aspect of communication. Interconnections of networks all over the world impose monumental risks on the Internet. A Flooding Attack (FA) is one of the major intimidating risks on the Internet where legitimate users are prevented from accessing network services. Irrespective of the protective measures incorporated in the communication infrastructure, FA still persists due to the lack of global cooperation. Most of the existing mitigation is set up either at the traffic starting point or at the traffic ending point. Providing mitigation at one or the other end may not be a complete solution. To insist on better protection against flooding attacks, this work proposes a cooperative multilevel defense mechanism. The proposed cooperative multilevel defense mechanism consists of two-level of mitigation. In the first level, it is proposed to design a Threshold-based rate-limiting with a Spoofing Resistant Tag (TSRT), as a source end countermeasure for High-Rate Flooding Attacks (HRFA) and spoofing attacks. In the second level, the accent is to discriminate normal traffic after Distributed Denial of Service (DDoS) traffic and drop the DDoS traffic at the destination end. Flow Congruence-based Selective Pushback (FCSP), as a destination-initiated countermeasure for the Low Rate Flooding Attack (LRFA). The source and the destination cooperate to identify and block the attack. A key advantage of this cooperative mechanism is that it can distinguish and channel down the attack traffic nearer to the starting point of the attack. The presentation of the agreeable cooperative multilevel safeguard mechanism is approved through broad recreation in NS-2. The investigation and the exploratory outcomes show that the proposed plan can effectively identify and shield from the attack. [ABSTRACT FROM AUTHOR]

Multilevel Security (MLS) is one of the ways that protects the stored information in the computer and mobile devices. It classifies users and information into levels of security; thus, the user can access information within its level or less. A smartphone is used in managing some of businesses, controlling the home and car devices within the smart city environment by using a set of data stored in the database. The database is used by more than one authorized user some of this data is confidential and important that requires protection from un authorized users. In this research a proposed system to implement the MLS principle within three levels of security is presented. The first level gives the user its own security level. The second level transfers users through the system parts according to their security level (system administrator or regular user). The third level allows users to manipulate the stored encrypted data in SQLite database by using a simple and quick cryptographic algorithm. The proposed system is implemented in the smart mobile devices which are supported by the Android operating system. The experimental result showed that the proposed system has the ability to protect the data in the database and prevents users to view the data at upper levels. Also, the inability of users to change the security level of data that prevents the leak of data from the upper security levels to the lower level. Moreover, the proposed system works quickly and needs a little storage space.

A secure concurrency control algorithms must be devoid of covert channels originating from data conflicts between transactions, in addition to ensuring database integrity. Current secure concurrency control algorithms mistreat transactions with higher access classes. Because it better solves the priority inversion problem. A widely used concurrency control algorithm is the two-phase locking with high priority (2 PL-HP). The inclusion of cyclic restart, deadlock, unnecessary abort, pseudo-priority inversion, and starvation, on the other hand, may reduce its performance. In this paper, a new enhanced of secure two-phase locking protocol with multilevel secure distributed database systems is presented, the idea of enhanced secure Two-Phase locking protocol by adding the security level to assign the priority to the transaction. The enhanced add a secure manager to decide the level of the security and give the instruction to process the transaction in real lock with data x/virtual lock with version data x0 or decided to Abort the transaction based on the security level. The suggested study intends to reduce transaction miss rate by addressing the following issues: deadlock by splitting the execution stage into locking and processing phases, it reduces unnecessary cycle restart, transaction aborts by checking the security priority level (high, medium, low), and generating virtual lock and versions data. Finally, simulation performance confirms that improvement in transactions miss's percent and reduction in transactions' rollbacks compared to other secure concurrency control.

Multilevel security (MLS) systems control access to data by formalizing permissible and impermissible information flows between data sources and destinations (e.g., database servers and clients) fixed with distinct security labels. In computer networks, MLS systems have been used to prevent unauthorized data disclosure in shared-infrastructure settings where network hosts and devices may fall within different trust domains (e.g., in multi-tenant cloud networks or wireless mesh networks). However, current MLS systems assume static network behavior—thus preventing the network from being practically usable in the presence of dynamic network events that frequent unstable network environments, including sudden changes in traffic patterns, link failures, and topology changes as a result of device movement or intermittent device connectivity. In this paper, we introduce MLS-Enforcer, a software-defined networking (SDN) controller application that can efficiently deploy network-level MLS policies while retaining the ability to securely relabel network nodes under changing topology state and network traffic demands. We model network adaptivity as an integer linear programming problem that reflects a given security policy. We then introduce heuristic relabeling algorithms that achieve near-optimal performance and are more tractable and efficient for larger networks. We validate MLS-Enforcer on several network topologies and traffic loads, demonstrating that it can relabel the network to route 90%+ of flows under normal conditions and quickly converge (on the order of seconds for the heuristic algorithms) under changing needs—from small network structure changes to catastrophic failures. This shows that formally secured networks can feasibly be deployed in diverse, changing, and unpredictable environments. [ABSTRACT FROM AUTHOR]

A secure concurrency control algorithms must be devoid of covert channels originating from data conflicts between transactions, in addition to ensuring database integrity. Current secure concurrency control algorithms mistreat transactions with higher access classes. Because it better solves the priority inversion problem. A widely used concurrency control algorithm is the two-phase locking with high priority (2 PL-HP). The inclusion of cyclic restart, deadlock, unnecessary abort, pseudo-priority inversion, and starvation, on the other hand, may reduce its performance. In this paper, a new enhanced of secure two-phase locking protocol with multilevel secure distributed database systems is presented, the idea of enhanced secure Two-Phase locking protocol by adding the security level to assign the priority to the transaction. The enhanced add a secure manager to decide the level of the security and give the instruction to process the transaction in real lock with data x/virtual lock with version data x0 or decided to Abort the transaction based on the security level. The suggested study intends to reduce transaction miss rate by addressing the following issues: deadlock by splitting the execution stage into locking and processing phases, it reduces unnecessary cycle restart, transaction aborts by checking the security priority level (high, medium, low), and generating virtual lock and versions data. Finally, simulation performance confirms that improvement in transactions miss's percent and reduction in transactions' rollbacks compared to other secure concurrency control. [ABSTRACT FROM AUTHOR]

High-assurance systems found in safety-critical infrastructures are facing steadily increasing cyber threats. These critical systems require rigorous guarantees in information flow security to prevent confidential information from leaking to an unclassified domain and the root of trust from being violated by an untrusted party. To enforce bit-tight information flow control, gate-level information flow tracking (GLIFT) has recently been proposed to precisely measure and manage all digital information flows in the underlying hardware, including implicit flows through hardware-specific timing channels. However, existing work in this realm either restricts to two-level security labels or essentially targets two-input primitive gates and several simple multilevel security lattices. This article provides a general way to expand the GLIFT method for multilevel security. Specifically, it formalizes tracking logic for an arbitrary Boolean gate under finite security lattices, presents a precise tracking logic generation method for eliminating false positives in GLIFT logic created in a constructive manner, and illustrates application scenarios of GLIFT for enforcing multilevel information flow security. Experimental results show various trade-offs in precision and performance of GLIFT logic created using different methods. It also reveals the area and performance overheads that should be expected when expanding GLIFT for multilevel security.

A multilevel secure access control strategy for distributed system was proposed,which could guarantee the data confidentiality and security,through adding platform and middleware modules.The security policy was described in the XACML language,and the security and flexibility of the policy were analyzed.

Abstract Covert channels can be used to transfer confidential information in multilevel secure operating systems. In this article authors will discuss an improvement of our technique of transferring data using covert channels. To achieve the maximum "top-down" data transfer rate authors presented synchronization and cooperation of two processes using the Linux task scheduler feature, proof-of-concept of explit were presented as well. In this article, authors will study the throughput of well-known covert communication channels on various modern multi-core processors under the Linux operating system - network port binding and file lock. Authors implement and analyze various methods of channel throughput increasing for different processors and different Linux-based operating systems. Optimization technique described in this paper allows to achieve more than 2 million bits per second using storage covert channel which appears a real threat to multilevel systems security where even more than 100 bits per second is considered unacceptable. [ABSTRACT FROM AUTHOR]

In transparent computing, client terminals are rather lightweight, while all other resources (including OSs) are stored on remote servers and delivered on demand to clients via streaming. In this article, the authors propose a Multilevel Access Control Scheme in Transparent Computing (MACTC) to protect user data with different security levels and provide multilevel access control and valid identity authentication. The proposed scheme is effective in multilevel data security, flexible in authorized resource sharing, and secure against various malicious attacks. [ABSTRACT FROM PUBLISHER]

In order to solve the problem caused by the variety and openness of the network,the research for the models of structured document and access control were taken.A new structured document representation model and method for the security requirements of the multi-element access control and multi-level security was proposed,and corresponding structure of security attribute and example of extensible markup language (XML) was given.Finally,analyzed the security performance.

A model which enhances the integrity of BLP model was presented based on the BLP model.This model was called as EIBLP model.Some necessary restraints to upward information flow were appended in EIBLP without chang-ing the information flow direction（down-read and up-write） of BLP model and the security axiom,access labels of sub-ject and object,access control operation mode,and state transition policy of BLP model were improved.And then,ana-lyzes the security of EIBLP was analyzed and proved.It shows that the improved EIBLP model not only satisfies com-pletely the basic security of BLP,but also enhances the integrity of BLP with improving the upward restraints,the subject and object access labels,the model operation mode,and the model state translation rules.At the same time,the improved EIBLP raises the confidentiality of BLP at a certain extent.

The Interconnected Network or the Internet has revolutionized digital communications. It has expanded worldwide over the past four decades due to numerous features such as connectivity, transparency, hierarchy, and openness. Several drawbacks, including mobility, scalability, controllability, security, etc ., have been presented due to continuous developments. Although several network paradigms exist to address such drawbacks, many issues still persist. This research proposed a future network paradigm that addresses multilevel security shortcomings. It suggested the following: (i) a two-router network-based cyber security architecture for multilevel data sharing; (ii) using a scheduler to deal with the multilevel transmitted packets scheduling problem; (iii) five algorithms for the studied difficult problem; and (iv) providing an experimental result to show the optimal results obtained by the developed algorithms and comparing it with algorithms in the literature. The experimental result shows that the random-grouped classification with shortest scheduling algorithm (RGS) performed the best at 37.7% with a gap of 0.03. This result proves the practicality of our approach in terms of two-machine scheduling problems., Competing Interests: The author declares that they have no competing interests., (©2023 Sarhan.)

Vulnerabilities such as design flaws, malicious codes and covert channels residing in hardware design are known to expose hard-to-detect security holes. However, security hole detection methods based on functional testing and verification cannot guarantee test coverage or identify malicious code triggered under specific conditions and hardware-specific covert channels. As a complement approach to cipher algorithms and access control, information flow analysis techniques have been proved to be effective in detecting security vulnerabilities and preventing attacks through side channels. Recently, gate level information flow tracking (GLIFT) has been proposed to enforce bittight information flow security from the level of Boolean gates, which allows detection of hardware-specific security vulnerabilities. However, the inherent high complexity of GLIFT logic causes significant overheads in verification time for static analysis or area and performance for physical implementation, especially under multilevel security lattices. This paper proposes to reduce the complexity of GLIFT logic through state encoding and logic optimization techniques. Experimental results show that our methods can reduce the complexity of GLIFT logic significantly, which will allow the application of GLIFT for proving multilevel information flow security. [ABSTRACT FROM AUTHOR]