Defining the Minimum Security Baseline in a Multiple Security Standards Environment by Graph Theory Techniques

12 - WISDOM for WLAN Practitioners

The Minimum Vertex Cover issue (MVCP) is a significant NP-complete optimization issue in graph theory. Its objective is to find a set of nodes that covers all edges of a given graph and contains the minimum number of nodes. Many different approaches and algorithms have been tried for this issue. Nevertheless, as the MVCP problem is an optimization problem, solutions are usually non-heuristic and only work under certain constraints Moreover, the proposed methods do not achieve the expected effect and the solution sets may change with each iteration. Having a minimum number of nodes in a network with a minimum coverage area improves network efficiency, reduces energy consumption, and allows for more efficient resource utilization. This study aims to control all streets in a popular neighborhood in Barcelona with a minimum number of security cameras. The Malatya Vertex Cover method is used to locate the optimal number of security cameras around the area. For modeling, the area is transformed into a graph using Google Earth. Each intersection represents a node. The graph was modeled using R programming language. Then, with the Malatya Vertex Cover algorithm, the Malatya centrality values of the nodes of the graph will be calculated. This centrality value is obtained from the sum of the ratio of the degree of each node to the degree of its neighbors. For the MVCP solution, the node of the graph with the highest Malatya centrality value is selected and added to the solution set. Then, this node and its edge links are removed from the graph. When the edges are completely covered, the process is terminated. As a result of this analysis, a low-cost solution is achieved by using the minimum number of security cameras to cover the entire region.

Software-as-a-service (SaaS) multi-tenancy in cloud-based applications helps service providers to save cost, improve resource utilization, and reduce service customization and maintenance time. This is achieved by sharing of resources and service instances among multiple "tenants" of the cloud-hosted application. However, supporting multi-tenancy adds more complexity to SaaS applications required capabilities. Security is one of these key requirements that must be addressed when engineering multi-tenant SaaS applications. The sharing of resources among tenants--i.e. multi-tenancy--increases tenants' concerns about the security of their cloud-hosted assets. Compounding this, existing traditional security engineering approaches do not fit well with the multi-tenancy application model where tenants and their security requirements often emerge after the applications and services were first developed. The resultant applications do not usually support diverse security capabilities based on different tenants' needs, some of which may change at run-time i.e. after cloud application deployment. We introduce a novel model-driven security engineering approach for multi-tenant, cloud-hosted SaaS applications. Our approach is based on externalizing security from the underlying SaaS application, allowing both application/service and security to evolve at runtime. Multiple security sets can be enforced on the same application instance based on different tenants' security requirements. We use abstract models to capture service provider and multiple tenants' security requirements and then generate security integration and configurations at runtime. We use dependency injection and dynamic weaving via Aspect-Oriented Programming (AOP) to integrate security within critical application/service entities at runtime. We explain our approach, architecture and implementation details, discuss a usage example, and present an evaluation of our approach on a set of open source web applications.

In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. There are O(n c) algorithms which solve Graph Isomorphism on graphs which have a bound on the treewidth, degree or bandwidth, but the exponent c depends on this bound, where n is the number of vertices in input graphs. We introduce some new graph parameters: the (rooted) path distance width, which is a restriction of bandwidth, and the (rooted) tree distance width, which is a restriction of treewidth. We give algorithms that solve Graph Isomorphism in O(n 2) time for graphs with bounded rooted path distance width, and in O(n 3) time for graphs with bounded rooted tree distance width. Additionally, we show that computing the path distance width of a graph is a NP-complete problem even if the input graphs are restricted to the class of trees. Moreover we show that the rooted path or tree distance width can be computed in O(ne) time and both path and tree distance width can be computed in O(n k+1) time, when they are bounded by a constant k, where e is the number of edges in input graphs. Finally, we study the relationships between the newly introduced parameters and other existing graph parameters.

Industry managers have long recognized the vital importance of information security for their businesses, but at the same time they perceived security as a technology-driven rather then a business-driven field. Today, this notion is changing and security management is shifting from technology- to business-oriented approaches. Whereas there is evidence of this shift in the literature, this paper argues that security standards and academic work have not yet taken it fully into account. We examine whether this disconnect has lead to a misalignment of IT security requirements in businesses versus industry standards and academic research. We conducted 13 interviews with practitioners from 9 different firms to investigate this question. The results present evidence for a significant gap between security requirements in industry standards and actually reported security vulnerabilities. We further find mismatches between the prioritization of security factors in businesses, standards and real-world threats. We conclude that security in companies serves the business need of protecting information availability to keep the business running at all times.

The extraction of multi-document summarization (MDS) has become the dominant technique to offer a compact form of documents that manages the opposite characteristic of the real documents. This technique finds the subset of similarity from the input documents (words/phrases/sentences) in the original text to form the summary in contrast. This paper has illustrated upon the similarity between the MDS problem with the vertex cover problem (VCP) and some important factors for the effective implementation of vertex cover algorithm (VCA) identified through a systematic review of the literature using SMART (Specific, Measurable, Assignable, Realistic, Time related) target. Further, they are categorized into five fields namely text summarization, MDS, Automatic text summarization, Sentence extraction, and Graph-based summarization and the lesson learned from these studies are discussed. The results of the research demonstrate the effectiveness of the proposed method in graph-based automatic multi-document summarization.

After implementing 5G technology, academia and industry started researching 6th generation wireless network technology (6G). 6G is expected to be implemented around the year 2030. It will offer a significant experience for everyone by enabling hyper-connectivity between people and everything. In addition, it is expected to extend mobile communication possibilities where earlier generations could not have developed. Several potential technologies are predicted to serve as the foundation of 6G networks. These include upcoming and current technologies such as post-quantum cryptography, artificial intelligence (AI), machine learning (ML), enhanced edge computing, molecular communication, THz, visible light communication (VLC), and distributed ledger (DL) technologies such as blockchain. From a security and privacy perspective, these developments need a reconsideration of prior security traditional methods. New novel authentication, encryption, access control, communication, and malicious activity detection must satisfy the higher significant requirements of future networks. In addition, new security approaches are necessary to ensure trustworthiness and privacy. This paper provides insights into the critical problems and difficulties related to the security, privacy, and trust issues of 6G networks. Moreover, the standard technologies and security challenges per each technology are clarified. This paper introduces the 6G security architecture and improvements over the 5G architecture. We also introduce the security issues and challenges of the 6G physical layer. In addition, the AI/ML layers and the proposed security solution in each layer are studied. The paper summarizes the security evolution in legacy mobile networks and concludes with their security problems and the most essential 6G application services and their security requirements. Finally, this paper provides a complete discussion of 6G networks’ trustworthiness and solutions.

Layout classification is an important task used in lithography simulation approaches, such as source optimization (SO), source-mask joint optimization (SMO) and so on. In order to balance the performance and time consumption of optimization, it is necessary to classify a large number of cut layouts with the same key patterns. This paper proposes a new kind of classification method for lithography layout patterns based on graph convolution network (GCN). GCN is an emerging machine learning approach that achieves impressive performance in processing graph signals with nonEuclidean topology structures. The proposed method first transforms the layout patterns into graph signals, where the sum of several adjacent layout pixels is associated with one graph vertex. Next, the adjacent graph vertices are connected by the graph edges, where the edge weights are determined by the correlations between the vertices. Therefore, the layout geometries can be represented by the function values on the graph vertices and the adjacency matrix. Subsequently, the GCN framework is established based on the graph Fourier transform, where the input is the graph signal of the layout, and the output is its classification label. The network parameters of GCN are trained in a supervised manner. The proposed method is compared to the simple convolutional neural network (CNN) with a few layers and VGG-16 network, respectively. Finally, the features of different methods are discussed in terms of classification accuracy and computational efficiency.

The paramount is ensuring future-proof and robust cybersecurity in the era of quantum computing. According to graph theory, the mathematical concept of Edge Antimagic Labelling (EATL) is leveraged by introducing a theoretical approach for encryption. Based on sum own label, a uniquely labelled edge is each graph edge. This work presents a quantum-resistant and secure encryption framework to exploit the combinational complexity, uniqueness, and inherent non-linearity of EATL. Construct the Quantum safe graphs as a special class of graphs, and the cryptographic key is generated to use the antimagic labelling that derives the dynamic edge weights. Both quantum and classical threats counter to improve the structural masking and key randomness by proposing improved security of EATL. Based on label prediction and graph isomorphism, a numerically hard problem space is provided via graph graph-theoretic foundation. The post-quantum, secure, and lightweight cryptographic models are designed with the powerful tool of EATL, established using graph theory.

The clique removal lemma says that for every and , there exists some so that every ‐vertex graph with fewer than copies of can be made ‐free by removing at most edges. The dependence of on in this result is notoriously difficult to determine: it is known that must be at least super‐polynomial in , and that it is at most of tower type in . We prove that if one imposes an appropriate minimum degree condition on , then one can actually take to be a linear function of in the clique removal lemma. Moreover, we determine the threshold for such a minimum degree requirement, showing that above this threshold we have linear bounds, whereas below the threshold the bounds are once again super‐polynomial, as in the unrestricted removal lemma. We also investigate this question for other graphs besides cliques, and prove some general results about how minimum degree conditions affect the bounds in the graph removal lemma.

We address issues related to threat assessment of mobile patient monitoring systems using a wireless infrastructure including body area biomedical sensor networks. Several user scenarios are presented. Patient sensitive data, mobile and wireless infrastructure, and resource-constraint sensor nodes provide a challenging task of fulfilling some minimum requirements for security, privacy, reliability of the data and availability of the system. We have therefore studied threats associated to both short range and long range mobile wireless communication infrastructures, where requirements for security recommendations for such systems are presented. Emphasis is given on applications that employ a wireless infrastructure, such as biomedical sensor networks. In this work we present an informal threat assessment of mobile patient monitoring systems used with several scenarios.

Every graph G with vertex V and edge E usually referred to as G = (V, E) in this research is a simple, undirected, and non-trivial graph. A set of vertice D of graph G = (V, E) is called Dominating Set if every vertex from is adjacent to a vertex . In this paper, we analyze the relation of domination number of corona product graphs and edge corona product graphs . The difference between corona product and edge corona product is located on the placement. If on corona product, copy of H graph is located at each vertex of graph G, while at edge corona product, copy of H graph is located on each edge of graph G. The difference in the number of vertices and edges between corona product and edge corona product is and . The result of this research is . There is a relation between all domination numbers that have been generated.

We present O(loglog n) -round algorithms in the Massively Parallel Computation (MPC) model, with O (n) memory per machine, that compute a maximal independent set, a 1+e approximation of maximum matching, and a 2+eapproximation of minimum vertex cover, for any n-vertex graph and any constant \eps>0. These improve the state of the art as follows: Our MIS algorithm leads to a simple O(loglog Δ)-round MIS algorithm in the CONGESTED-CLIQUE model of distributed computing, which improves on the O (√log Δ )-round algorithm of Ghaffari [PODC'17]. Our O(loglog n)-round (1+e)-approximate maximum matching algorithm simplifies or improves on the following prior work: O(log^2log n)-round (1+\eps)-approximation algorithm of Czumaj et al. [STOC'18] and $O(loglog n)-round (1+e)-approximation algorithm of Assadi et al. [arXiv'17]. Our O(loglog n)-round (2+e)-approximate minimum vertex cover algorithm improves on an O(loglog n)-round O(1)-approximation of Assadi et al. [arXiv'17].

The Minimum Security Requirements for Multi-User Operating Systems (MSR) document provides basic commercial computer system security requirements applicable to both government and commercial organizations. These requirements include technical measures that can be incorporated into multi-user, remote-access, resource-sharing, and information-sharing computer systems. The MSR document was written from the prospective of protecting the confidentiality and integrity of an organization's resources and promoting the continual availability of these resources. The MSR presented in this document form the basis for the commercially oriented protection profiles in Volume II of the draft Federal Criteria for Information Technology Security document (known as the Federal Criteria). The Federal Criteria is currently a draft and supersedes this document.

We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted case, one searches for a minimum number of vertex deletions to transform a graph into a collection of disjoint cliques. The parameter is the number of vertex deletions. We present efficient fixed-parameter algorithms for CVD applying the fairly new iterative compression technique. Moreover, we study the variant of CVD where the maximum number of cliques to be generated is prespecified. Here, we exploit connections to fixed-parameter algorithms for (weighted) Vertex Cover.