Search

Software-Defined-Networking (SDN) has been recently arising as a new technology in the IT industry. It is a network architecture that hopes to provide better solutions to most of the constraints in contemporary networks. SDN is a centralized control architecture for networking in which the control plane is separated from the data plane, the network services are abstracted from the underlying forwarding devices, and the network’s intelligence is centralized in a software-based directly-programmed device called a controller. These features of SDN provide more flexible, programmable and innovative network’s architecture. However, they may pose new vulnerabilities and may lead to new security problems. In this paper, we propose the application-aware firewall mechanism for SDN, which can be implemented as an extension to the network’s controller. In order to provide more control and visibility in applications running over the network, the system is able to detect network applications that may at some point affect network’s performance, and it is capable to dynamically enforce constraint rules on applications. The firewall architecture is designed as four cooperating modules: the Main Module, the Filtering Module, the Application Identification Module, and the Security-Enforcement Module. The proposed mechanism checks the network traffic at the network, transport, and application levels, and installs appropriate security instructions down into the network. The proposed solution features were implemented and tested using a Python-based POX controller, and the network topology was built using Mininet emulation tool.

The currently developed 5G networks using MEC technology (5G MEC) allow for the harmonious cooperation of many areas of the economy (called the vertical industries) within an integrated information network. Providing the necessary security in such a complex configuration of business partners requires the design of consistent and effective security architecture. In this paper, we present a new concept of an access control architecture for the 5G MEC network in line with the 5G network model and MEC architecture proposed by international standardization organizations. We give an overview of the high-level security architecture of 5G MEC networks, which provides security solutions for the network’s components and establishes secure access to all cooperating entities. Next, we introduce the MEC Enabler, a new network’s module, which manages security credentials required to access resources of MEC-hosted services. We consider a series of several use cases with increasing demands on network data resources and computing power. Finally, we present a sample protocol diagram for gaining access to resources (authentication in a service using MEC technology) in our access control architecture.

As the amount of information, critical services, and interconnected computers and “things” in the cyberspace is steadily increasing, the number, sophistication, and impact of cyberattacks are becoming more and more significant. In the last decades, governmental and non-governmental organisations have become aware of this problem. However, the existing cybersecurity workforce has not been sufficient for satisfying the increasing demand for qualified cybersecurity professionals, and the shortfall will increase in the next years. Meanwhile, to address the increasing demand for cybersecurity professionals, academic institutions have been establishing cybersecurity programs, particularly, cybersecurity master programs. This paper aims at analysing which cybersecurity topics are covered by existing cybersecurity master programs of top universities and how these topics are distributed through courses. It starts by reviewing the evolution and maturation of the cybersecurity discipline, focusing on the ACM efforts, which include the early addition of the Information Assurance and Security Knowledge Areas to the computer science curricula and, more recently, the development of curricular recommendations to support the definition of post-secondary cybersecurity programs. These latest guidelines are used to analyse and review 21 cybersecurity master programs, focusing on the contents of their courses, structure, admission requirements, duration, requirements for completion, and evolution.

With the increasing role of numerous Internet services, more and more private data must be protected. One of the mechanisms which is used to ensure data security is user authentication. A reliable authentication mechanism is a foundation of security of a remote service but, on the other hand, it is also a source of user frustration because of fear of losing access in case of three failures. A remedy to this problem could be contextual secure authentication. Such a protocol should provide multi-level authentication mechanism which increases user satisfaction without decreasing a protection level. In this paper we propose a risk analysis procedure of a new authentication management model using contextual data and oriented on user experience. We describe an approach to risk assessment of the mechanism, which supports a process of choosing the proper multi-step authentication procedure. On this basis, it is possible to provide a security solution which keeps balance between user satisfaction (related to QoE) and the obtained Level of Security (related to QoP).

Card-Linked Loyalty is an emerging trend observed in the market to use payment card as a unique identifier for Loyalty Programs. This approach allows to redeem goods and collect bonus points directly during a payment transaction. In this paper, we proposed additional, intangible reward, that can be used in such solutions: shorter transaction processing time. We presented a complete solution for it: Contextual Risk Management System, that can make a dynamic decision whether Cardholder Verification is necessary for the current transaction, or not. It is also able to maintain an acceptable level of risk approved by the Merchant. Additionally, we simulated the proposed solution with real-life transaction traces from payment terminals and showed what kind of information can be determined from it.

In this paper, we present a systematic overview of existing isolation techniques in nodes and networks, especially in the Radio Access Network and the Core Network (RAN and CN) to give a background to standardized methods of calculating an isolation level leading to secure End-to-End (E2E) slices’ isolation. We present specific isolation technologies used in layers of 5G RAN and CN. For RAN and CN slices we propose several isolation properties and parameters to enable qualitative and quantitative characterization of the isolation. Finally, we present our approach that makes it possible to establish the common level of isolation for an E2E slice in the 5G network. To illustrate how such an isolation model works in practice, we give numerical examples of calculating an isolation level for simple network slices.

5G networks are expected to be a set of slices which are virtual subnets designed for specific applications. A crucial requirement for providing proper functioning of the network and its security is proper isolation of slices. The aim of this paper is to propose a new method of determination of the isolation level of a slice. We propose a Graph-based model of the sliced network, which has a layered structure. In each layer, the appropriate network elements have their own isolation level. The lowest layer of the Graph-based model represents virtual network elements with isolation traits used for calculating their isolation level. Climbing to the top of the stack of layers one can calculate, successively, isolation level for a network's physical element, a link, subnetworks and, the End-to-End slice's isolation level. We present numerical examples, where suitable traits are specified and the isolation level in each layer is calculated.

Although 5G (fifth generation) networks are still in the realm of ideas, their architecture can be considered as reaching a forming phase. There are several reports and white papers which attempt to precise 5G architectural requirements presenting them from different points of view, including techno-socio-economic impacts and technological constraints. Most of them deal with network slicing aspects as a central point, often strengthening slices with slice isolation. The idea of isolation in the network is not new. However, currently considered technologies give new capabilities that can bring added value in this field. The goal of this paper is to present and examine the isolation capabilities and selected approaches to its realization in network slicing context. As the 5G architecture is still evolving, the specification of isolated slices operation and management brings new requirements that need to be addressed, especially in a context of end-to-end (E2E) security. Thus, an outline of recent trends in slice isolation and a set of challenges are presented. The challenges, if properly addressed, could be a step from the concept of 5G networks to proof-of-concept solutions which provide E2E user’s security based on slices isolation. Among other things, the key features are proper slice design and establishment, security at interfaces, suitable access protocols, correct virtual resources sharing, and an adaptable management and orchestration architecture (MANO). In conclusion of the paper, short outlines of two of the main secure isolation challenges are given: a proper definition of isolation parameters and designing suitable MANO system.

Software-Defined Network (SDN) is recognized as one of the most important future networking area. SDN architecture is a revolutionary new idea that, moving the traditional network to be software-based, provides more flexibility, high degree of automation and shorter provision time. SDN architecture dynamically separates the control plane from the data (forwarding) plane of the network, which provides centralized view of the entire network and makes it easier for managing and for monitoring the network’s resources. However, the initial design of the SDN, with its centralized point of control, does not consider sufficiently the security requirements, which makes the security issues additional challenges. In this paper we propose a new access control system for the SDN architecture, working as a controller application used to verify the identity of a host upon connection to the network. The proposed mechanism, which denies the access attempts from unauthorized hosts and defines different levels of privileges for each host, according to its authentication credentials, is implemented using a POX controller. Our approach neither needs a support of new protocols, nor requires additional configuration of hosts or routers.

Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography which is based on the arithmetic on elliptic curves and security of the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. Elliptic curve a lgorithms are also applied to generation of sequences of pseudo-random numbers. Another recent branch of cryptography is chaotic dynamical systems where security is based on high sensitivity of iterations of maps to initial conditions and parameters. In the present work, we give a short survey describing state-of-the-art of several sugge sted constructions for generating sequences of pseudorandom number generators based on elliptic curves (ECPRNG) over finite fields of prime o rder. In the second part of the paper we propose a method of generating sequences of pseudorandom points on elliptic curves over fin ite fields which is driven by a chaotic map. Such a constructio n improves randomness of the sequence generated since it combines good statistical properties of an ECPRNG and a CPRNG (Chaotic Pseudo- Random Number Generator). The algorithm proposed in this work is of interest for both classical and elliptic curve crypt ography.

There are several reports and white papers which attempt to precise 5G architectural requirements presenting them from different points of view, including techno-socio-economic impacts and technological constraints. Most of them deal with network slicing aspects as a central point, often strengthening slices with slice isolation. The goal of this paper is to present and examine the isolation capabilities and selected approaches for its realization in network slicing context. As the 5G architecture is still evolving, the specification of isolated slices operation and management brings new requirements that need to be addressed, especially in a context of End-to-End (E2E) security. Thus, an outline of recent trends in slice isolation and a set of challenges are proposed, which (if properly addressed) could be a step to E2E user's security based on slices isolation.

Electronic card payments gained huge popularity mainly because of their simplicity, convenience and processing time. Unfortunately transaction processing rules are constant for every transaction, for example each transaction above some hard limit (50 PLN in Poland) must be authorized with PIN verification. One can notice that such an approach is simple, but is not optimal: that is why Contextual Risk Management systems for payment transactions started to be created. This paper presents a new Cardholder’s Reputation System that can be used in Contextual Risk Management Systems. It is flexible thanks to a few parameters and allows to cover all possible transaction processes.

Traditional networks are often quite static, slow to modify, dedicated for a single service and very difficult to scale, what is typical for a large number of different network devices (such as switches, routers, firewalls, and so on), with many complex protocols implemented or embedded on them. Software Defined Network (SDN) is a new technology in communication industry that promises to provide new approach attempting to overcome this weakness of the current network paradigm. The SDN provides a highly scalable and centralized control architecture in which the data plane is decoupled from the control plane; this abstraction gives more flexible, programmable and innovative network architecture. However, centralization of the control plane and ability of programming the network are very critical and challenging tasks causing security problems. In this paper we propose a framework for securing the SDN by introducing an application as an extension to the controller to make it able to check every specific flow in the network and to push the security instructions in real-time down to the network. We also compare our proposal with other existing SDN-based security solutions.

In this paper we propose a new optimality measure for Wireless Sensor Network-based structural monitoring systems. First, we present the results of experiments showing the reasons for random effects in Wireless Sensor Network (WSN) functioning. Then, the formulas for calculating a network’s reputation measure are given. Finally, we conclude with arguments for the application of the reputation-based optimality measure in WSNs. We propose significantly new recommendations for the design and usage of WSNs.

Symmetric block ciphers are usually used in WSN for security services. This paper puts forward the idea of using advanced modes of operation of symmetric block ciphers to achieve confidentiality and authentication in one cryptographic operation. The modes of operation approved by NIST that is CMAC, CCM, GCM/GMAC are applied here. The benchmarks of these approaches in the terms of efficiency of nodes in WSN are presented.

Electronic services in dynamic environment (e.g. e-government, e-banking, e-commerce, etc.), meet many different barriers reducing their efficient applicability. One of them is the requirement of information security when it is transmitted, transformed, and stored in an electronic service. It is possible to provide the appropriate level of security by applying the present-day information technology. However, the level of protection of information is often much higher than it is necessary to meet potential threats. Since the level of security strongly affects the performance of the whole system, the excessive protection decreases its reliability and availability and, as a result, its global security. In this paper we present a mechanism of adaptable security for, digital information transmission systems (being usually the crucial part of e-service). It makes it possible to guarantee the adequate level of protection for actual level of threats dynamically changing in the environment. In our model the basic element of the security is the Public Key Infrastructure (PKI) is enriched with specific cryptographic modules.

In the paper we propose a general, abstract framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying Secret Sharing Scheme (SSS). ASGS allows to prevent the Dealer from knowing the secret. The Basic Property Conjecture (BPC) forms the base of the framework. Due to the level of abstraction, results are portable into the realm of quantum computing. Two situations are discussed. First concerns simultaneous generation and sharing of the random, prior nonexistent secret. Such a secret remains unknown until it is reconstructed. Next, we propose the framework for automatic sharing of a known secret. In this case the Dealer does not know the secret and the secret Owner does not know the shares. We present opportunities for joining ASGS with other extended capabilities, with special emphasis on PVSS and pre-positioned secret sharing. Finally, we illustrate framework with practical implementation.

Elliptic Curve Cryptography (ECC) has attractive advantages compared to other public-key cryptosystems that motivated cryptographers for using it. ECC offers equal security for a smaller key sizes, thereby reducing processing overhead, making it ideal for small devices, key agreement protocols and digital signature applications. Images are data types that occasionally include secret information, such as faces, places and signatures. Encryption scheme is a technique to protect images secrecy by encrypting them before transmission over public networks and unsecured channels. In this paper, we proposed an image encryption scheme which is based on computational operations (Add, Double, Multiply) on points that lie on a predefined elliptic curve (EC). For any ECC-based encryption scheme, converting a message (image pixel) to a coordinate on an affine curve is a mandatory prerequisite. The proposed image encryption scheme utilizes, both, the Koblitz’s encoding method and the novel proposed mapping method to convert pixels of a plainimage into coordinates of the predefined EC-points. Then, addition of the resulting points with the points resulting from the Chaos-Driven Elliptic Curve Pseudo-random Number Generator (C-D ECPRNG) is considered for completion of the image encryption process. Discussing Koblitz’s encoding method, creating the mapping table, the converting process and the encryption itself are given in detail along with their implementation. Finally, drawing EC-points is done to show changes in the distribution of points in each case.

This paper will concern itself with a formulation of a traffic analysis problem for mobile agents. It is an interesting theoretical problem as well as a critical feature when using agents on a massive scale in decision making systems. The decision making systems are applied to demanding and complex environments such as stock markets. The mobile agents used are natural targets for attacks because they provide information for decision making. The resulting information can have a value measured in millions of dollars and information of such a high value attracts potential attacks. An efficient way to attack the user of decision making systems is to learn her strategy and respond in kind. In this respect even passive observation of agents can provide useful data, namely what information they are gathering. A common first defense is to provide anonymity for mobile agents. However, what happens when anonymity is gone? What information then becomes available and what steps will the user take? Yet, the problem has not been previously formulated for such a framework. We formulate it in terms of various factors used for traffic analysis. These factors originate from different side channels that provide information on the operating agents. At the end we state a paradox, which links an excessive use of countermeasures against traffic analysis with weakening system security.

One of the most common types of attacks on reputation systems is made by reporting unfair ratings. They can be performed by the individual malicious members or by a group of agents forming a coalition and cooperating together in order to achieve particular purpose (e.g, to gain higher position in the community or to discredit the competition). Due to the fact, that such attacks are performed often by intelligent coalitions, they are much more harmful and harder to detect. This paper describes a novel algorithm for coalition detecting in reputation systems. By observing the agents which are controversially rated by the community it is possible to construct agents cooperation matrices and identify harmful coalitions. Detailed description of the algorithm is provided and presented simulation results confirm the effectiveness of the detection.

Last decades the contextual approach became an important methodology of analysing information processes in the dynamic environment. In this paper we propose a context management framework suitable for secure network services. The framework allows tracking the contextual information from its origin, through all stages of its processing up to application in security services protecting the secure network application. Besides the framework's description, an example of its application in constructing secure voice call network service is given.

In this paper, after a short survey describing several known constructions recommended for generating sequences of pseudo-random numbers based on elliptic curves over finite fields of prime order, we propose a method of generating such sequences of points with algorithms driven by a chaotic map. Our construction improves randomness of the sequence generated since it combines good statistical properties of an ECPRNG (Elliptic Curve Pseudo-Random Number Generator) and a CPRNG (Chaotic Pseudo-Random Number Generator). Theoretical analysis shows that periods of the proposed constructions are longer than in the case of the ECPRNG without modulation by a chaotic map. In the second part of the paper we present numerical analysis of the proposed construction to obtain optimal parameters of the generator. We also use some tests from the NIST’s SP 800-22 Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications to analyze statistical properties of the proposed constructions for different values of parameters.

The purpose of this paper is to propose a context-aware secure routing protocol suitable for real-time services. Since such a protocol undergoes a number of independent constraints connected with: dynamic changes of the environment, security assumptions, network limitations and end-users personal requirements, the context factors need specific treatment to be real support for an optimal route selection. The proposed framework systemizes the roles of all actors in establishing optimal and secure network connection for real-time services. The most suitable routing scheme is selected dynamically from the available portfolio, basing on actual context factors. Optimally, in the case of absence of any routing scheme satisfying a specific criterion given by context, a new scheme can be created on-demand, using the multi-constrained optimal path selection technique. The framework supports also additional optimization techniques (like fast packet retransmission, redundant routing etc.). Also the necessary security mechanisms have been implemented. Besides standard hard-security mechanisms, like private key encryption, also soft security techniques (i.e. reputation management) for detecting and blocking malicious nodes are used.

Pseudorandom number generators are used in many areas of contemporary technology such as modern communication systems and engineering applications. In recent years a new approach to secure transmission of information based on the application of the theory of chaotic dynamical systems has been developed. In this paper we present a method of generating pseudorandom numbers applying discrete chaotic dynamical systems. The idea of construction of chaotic pseudorandom number generators (CPRNG) intrinsically exploits the property of extreme sensitivity of trajectories to small changes of initial conditions, since the generated bits are associated with trajectories in an appropriate way. To ensure good statistical properties of the CPRBG (which determine its quality) we assume that the dynamical systems used are also ergodic or preferably mixing. Finally, since chaotic systems often appear in realistic physical situations, we suggest a physical model of CPRNG.

In the paper we propose a method of constructing cryptosystems, utilizing a nonpredictability property of discrete chaotic systems. We point out the requirements for such systems to ensure their security. The presented algorithms of encryption and decryption are based on multiple iteration of a certain dynamical chaotic system coming from gas dynamics models. A plaintext message specifies a part of the initial condition of the system (a particle's initial position). A secret key specifies the remaining part of initial condition (the particle's initial angle) as well as a sequence of discrete choices of the pre-images in the encryption procedure. We also discuss problems connected with the practical realization of such chaotic cryptosystems. Finally we demonstrate numerical experiments illustrating the basic properties of the proposed cryptosystem.

An EU Future Internet Engineering project currently underway in Poland defines three Parallel Internets (PIs). The emerging IIP System (IIPS, abbreviating the project’s Polish name), has a four-level architecture, with Level 2 responsible for creation of virtual resources of the PIs. This paper proposes a three-tier security architecture to address Level 2 threats of alien traffic injection and IIPS traffic manipulation or forging. It is argued that the measures to be taken differ in nature from those ensuring classical security attributes. A combination of hard- and soft-security mechanisms produces node reputation and trust metrics, which permits to eliminate or ostracize misbehaving nodes. Experiments carried out in a small-scale IIPS testbed are briefly discussed.

Heterogeneous wireless networks increasingly encroach on our lives. Various technologies and mobile applications more often than usual are now used by mobile users. Intensive development of mobile networks not only sets new standards for radio, but increasingly focuses on providing security for traffic transmitted in wireless networks. Security in wireless networks has never been the primary objective of the designers of new network standards. The reason for this fact were both low hardware resources of equipment, but also lack of awareness of users about the potential vulnerabilities. Creating a secure, independent of network architecture solutions effectively raising the level of security of transmitted data between end users is the main priority of our research. Current wireless security solutions do not provide sufficient protection of the integrity, confidentiality of data, are not designed to operate in heterogeneous networks, or are too complex to implement. Both networks WiMAX, LTE and WiFi, there are methods that protect the resources in these networks, but they are not consistent with each other. The proposed security system requires the use of mobile version of the PKI to verify the identity of mobile users. Mobile PKI center is an innovative solution, not yet introduced for casual use. Such a solution in heterogeneous wireless networks is a fast, secure and transparent to transmission medium. Designing secure and efficient authentication protocols to enable fast connections to the heterogeneous network is challenging. In the proposed system in this paper, the users authenticate their identity digital certificates that are issued by a trusted third party (CA). PKI uses the algorithms based on elliptic curves. Advantages of elliptic curves in mobile environment will be particularly evident. This ensures adequate protection of data in a heterogeneous networks. In this system, it is possible to implement many new secure services for end users secure email, secure chat, secure remote access.

In this paper we propose a new infrastructure for real-time applications. As a preliminary, we describe basic characteristics of the most popular real-time services like VoIP, videoconferencing, live media streaming, and network multiplayer games. We focus on the end-to-end latency, bandwidth and efficient transmission methods. Next, we present our project concepts, infrastructure model, details of implementation and our testing environment which was designed for testing many aspects of real-time services. The system combines mechanisms for ensuring best possible connection quality (QoS), load balance of servers in infrastructure and gives control over the packet routing decisions. Additionally, provided security mechanisms make it a good choice even in the environment where a high security level is required. The system is based on the Peer-to-Peer (P2P) model and data between users is routed over an overlay network, consisting of all participating peers as network nodes. This overlay can by used for application level multicast or live media stream. In the logging process each user is assigned to a specific node (based on his geographic location and nodes load). Because nodes are participating in data transmission, we have control over the data flow route. It is possible to specify the desired route, so, regardless of the external routing protocol, we can avoid paths that are susceptible to eavesdropping. Another feature of the presented system is usage of agents. Each agent acts within the single node. Its main task is to constantly control the quality of transmission. It analyzes such parameters like link bandwidth use, number of lost packets, time interval between each packet etc. The information collected by the agents from all nodes allows to build a dynamic routing table. Every node uses the Dijkstra's algorithm to find the best at the moment route to all other nodes. The routes are constantly modified as a consequence of changes found by agents or updates sent by other nodes. In VoD services agents also analyze popularity of streamed media, which helps build intelligent video cache. To ensure greater security and high reliability of the system, we have provided a reputation mechanism. It is used during bringing up to date the information about possible routes and their quality, given by other nodes. Owing to this solution nodes and routes which are more reliable get higher priority.

Many network services and protocols can work correctly only when freshness of messages sent between participants is assured and when the protocol parties' internal clocks are adjusted. In this paper we present a novel, secure and fast procedure which can be used to ensure data freshness and clock synchronization between two communicating parties. Next, we show how this solution can be used in other cryptographic protocols. As an example of application we apply our approach to the Internet Key Exchange (IKE) protocol family.

In this paper we present a few non cryptographic methods for improving the security, integrity and reliability of real time services. The methods presented in this paper apply to real time transmitting systems, which are based on the Peer-to-Peer (P2P) model. A basic idea of the first technique is to use agents for detecting steganographic content in packet headers, so packets with suspicious entries in the IP header fields will be blocked or the fields will be erased. The two other presented techniques are based on reputation and trust systems, so trust and reputation basic definitions, types and modelling methods are shown. Also a simple design scheme of using these mechanisms in a P2P real-time data transmitting infrastructure is presented. Additionally, we describe an idea of path selecting technique, which can be used to avoid paths that are susceptible to eavesdropping.

This document presents thorough information on the WiMAX technology, its detailed architecture and illustrates security mechanisms employed. The first part discusses basic properties and components of WiMAX network. Individual sub-layers of the network operation have been presented. The second part describes all security-related aspects and solutions employed to ensure secure data exchange: cryptographic keys generation and exchange, authentication processes and encrypted data exchange. The last part illustrates potential attacks, means of effective protection and methods for improving security in WiMAX networks.

Nowadays, storing the information is fundamental for the correct functioning of any organization. The critical factor is to guarantee the security of the stored data. In the traditional database systems the security requirements are limited to confidentiality, integrity, availability of the data and user authorization. The criticality of the database system and data repositories for modern business with the new requirements of law and governments, makes the development of new system architecture necessary which ensures sophisticated set of security services. In this paper we propose the database architecture that ensures the non-repudiation of the user queries and data warehouse actions. These security services are accomplished by means of the middleware layer in the data warehouse architecture.

Recently we have observed the growth of the intelligent application especially with its mobile character, called e-anything. The implementation of these applications provides guarantee of security requirements of the cryptographic protocols which are used in the application. Traditionally the protocols have been configured with the strongest possible security mechanisms. Unfortunately, when the application is used by means of the mobile devices, the strongest protection can lead to the denial of services for them. The solution of this problem is introducing the quality of protection models which will scale the protection level depending on the actual threat level. In this article we would like to introduce the application which manages the protection level of the processes in the mobile environment. The Security Protocol Optimizing Tool (SPOT) optimizes the cryptographic protocol and defines the protocol version appropriate to the actual threat level. In this article the architecture of the SPOT is presented with a detailed description of the included modules.

Traffic in Wireless Sensor Network (WSN) consists of short packets sent by nodes that are usually identical in respect of software applied and their hardware architecture. In such a communication environment it is important to guarantee authentication of the nodes. The most popular way to achieve this basic security service is using Message Authentication Code (MAC). The sensor node’s harbware is very limited so the cryptography used must be very efficient. In the article we focus on the influence of the authentication method’s performance on delays in data sampling by the sensor nodes. We present efficiency results for MACs generation in the node. We compare the results for approved, standardized and commonly-used schemes: CMAC, GMAC and HMAC based on MD5 and SHA-1. Additionally, we compare the obtained results with the performance of PKC-based authentication method using the ECDSA.

Generally, Intrusion Detection Systems (IDS) work using two methods of identification of attacks: by signatures, that are specific defined elements of the network traffic possible to identify and by anomalies being some deviation form of the network behaviour assumed as normal. Recently, some attempts have been made to implement artificial intelligence method for detection of attacks. Many such implementations use for testing and learning process the data set provided by KDD (Knowledge Discovery and Data Mining Competition) project in 1999. Unfortunately, KDD99 data set was created more than eight years ago and during this time many new attacks have been discovered. In this paper we present our research on updating KDD99 data with traces of attacks of new types. After updating, the data set was used for training and testing MLP (Multi Layer Perceptron) neural network architecture IDS.

In this paper we report our experiment concerning new attacks detection by a neural network-based Intrusion Detection System. What is crucial for this topic is the adaptation of the neural network that is already in use to correct classification of a new "normal traffic" and of an attack representation not presented during the network training process. When it comes to the new attack it should also be easy to obtain vectors to test and to retrain the neural classifier. We describe the proposal of an algorithm and a distributed IDS architecture that could achieve the goals mentioned above., Comment: 9 pages, 3 figures, 4 tables

The propagation of scalar harmonic waves through a randomly stratified slab is investigated. The transition matrix method is applied for the analysis of the problem. To obtain the effective parameters of the material of the slab the law of large numbers for non-commuting products is applied. The results are illustrated with the numerical example of the propagation of elastic waves in steel-titanium laminate in an aluminium environment.