CONSTRUCTION OF AUTHENTICATION CODES WITH ARBITRATION FROM UNITARY GEOMETRY

A family of authentication codes with arbitration is constructed from unitary geometry,the parameters and the probabilities of deceptions of the codes are also computed.In a special case a perfect authentication code with arbitration is obtained.

Using Normal Form of Nilpotent Matrices over Finite Fields to Construct Cartesian Authentication Codes

Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.

A Note on Authentication Codes with Arbitration

By use of partially balanced t-designs (v,b, k;λ,0) that is constructed by the rational normal curves given by [5] and the Cartesian product given by [4],an authentication code with arbitration is constructed and its probability of success of attacks by the transmitter, the receiver and the opponent is obtained in this paper.

Using Normal Form of Idempotent Matrices over Finite Local Ring Z/p^kZ to Construct Cartesian Authentication Codes

In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.

A construction of authentication codes with arbitration based on orthogonal spaces

In this paper we give a new construction of authentication codes with arbitration using orthogonal spaces. Some parameters and the probabilities of successful attacks are computed.

A Construction Method of Cartesian Authentication Codes from B N Pair Decomposition of SL_n(F_q)

In the present paper, a construction of Cartesian authentication codes by using the BN pair decomposition of special linear group is presented. Moreover, under the case that the encoding rules are chosen according to a uniform probability distribution, the probability of a successful impersonation attack and the probability of a successful substitution attack of the code are computed.

Using Normal Form of Matrices over Finite Fields to Construct Cartesian Authentication Codes

In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the P I and P S , which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.

TWO NEW CONSTRUCTIONS OF CARTESIAN AUTHENTICATION CODES FROM SYMPLECTIC GEOMETRY

In this paper, two new constructions of Cartesian authentication codes from symplectic geometry are presented and their size parameters are computed.

Two Constructions of Optimal Cartesian Authentication Codes from Unitary Geometry over Finite Fields

Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack are computed. They are optimal under some cases.

TuLP: A Family of Lightweight Message Authentication Codes for Body Sensor Networks

A wireless sensor network （WSN） commonly whilst a body sensor network （BSN） must be secured with requires lower level security for public information gathering, strong authenticity to protect personal health information. In this paper, some practical problems with the message authentication codes （MACs）, which were proposed in the popular security architectures for WSNs, are reconsidered. The analysis shows that the recommended MACs for WSNs, e.g., CBC- MAC （TinySec）, OCB-MAC （MiniSec）, and XCBC-MAC （SenSee）, might not be exactly suitable for BSNs. Particularly an existential forgery attack is elaborated on XCBC-MAC. Considering the hardware limitations of BSNs, we propose a new family of tunable lightweight MAC based on the PRESENT block cipher. The first scheme, which is named TukP, is a new lightweight MAC with 64-bit output range. The second scheme, which is named TuLP-128, is a 128-bit variant which provides a higher resistance against internal collisions. Compared with the existing schemes, our lightweight MACs are both time and resource efficient on hardware-constrained devices.

A Construction of Authentication Codes with Arbitration from Vector Spaces over Finite Fields

This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.

Construction of authentication codes with distrust arbitration from polynomials over finite fields

The authentication codes with arbitration are able to solve dispute between the sender and the receiver. The authentication codes with trusted arbitration are called AZ-codes, the authentication codes with distrust arbitration are called A3-codes . As an expansion of Az-cOdes , an A3-code is an authentication system which is closer to the reality environment. Therefore, A3-codes have more extensive application value. In this paper, we construct a class of A3-codes based on polynomials over finite fields, give the parameters of the constructed codes, and calculate a variety of cheating attacks the maximum probabilities of success. Especially, in a special case, the constructed A3-codes are perfect. Compared with a known type of codes, they have almost the same security level, however, our codes need less storage requirements. Therefore, our codes have more advantages.

Construction of Authentication Codes with Double Arbiters over Symplectic Geometry

In a common authentication code with arbitration, the dishonest arbiter may make a threat to the security of authentication system. In this paper, an authentication code with double arbiters over symplectic geometry is constructed, and the relevant parameters and the probabilities of successful attacks are calculated. The model not only prevents deception from the opponent and members of the system, but also effectively limits the attacks of single arbiter. Moreover, the collusion attacks from arbiters and participators are difficult to succeed.

Construction of Authentication Codes with Arbitration from Singular Pseudo-Symplectic Geometry over Finite Fields

A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.

Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.

TESLA-Based Authentication for BeiDou Civil Navigation Message

Due to the civil BeiDou navigation system is open,unauthenticated,and non-encrypted,civilian BeiDou navigation signals may have great security loopholes during transmission or reception.The main security loophole here is spoofing attacks.Spoofing attacks make the positioning or timing results of BeiDou civilian receivers wrong.Such errors may cause a series of security problems,which lays a serious hidden danger for Bei-Dou satellite information security.This article proposes an anti-spoofing method for BeiDou navigation system based on the combination of SM commercial cryptographic algorithm and Timed Efficient Stream Loss-tolerant Authentication(TESLA)for spoofing attacks.In this solution,we use the SM3 algorithm to generate a TESLA key chain with time information,and then use the key in the key chain to generate the message authentication code for the BeiDou D2 navigation message.The message authentication code is inserted into a reserved bit of the D2 navigation message.In addition,this solution uses the SM2 algorithm to protect and encrypt time information in the TESLA key chain to prevent key replay attacks in TESLA.The experimental results tested on the experimental platform built in this paper show that this scheme reduces the possibility of the BeiDou navigation system being deceived and enhances the safety of the BeiDou navigation system.

A Novel Video Data-Source Authentication Model Based on Digital Watermarking and MAC in Multicast

A novel video data authentication model based on digital video watermarking and MAC （message authentication code） in multicast protocol is proposed in this paper, The digital watermarking which composes of the MAC of the significant vid eo content, the key and instant authentication data is embedded into the insignificant video component by the MLUT （modified look-up table） video watermarking technology. We explain a method that does not require storage of each data packet for a time, thus making receiver not vulnerable to DOS （denial of service） attack. So the video packets can be authenticated instantly without large volume buffer in the receivers. TESLA （timed efficient stream loss tolerant authentication） does not explain how to select the suitable value for d, which is an important parameter in multicast source authentication. So we give a method to calculate the key disclosure delay （number of intervals）. Simulation results show that the proposed algorithms improve the performance of data source authentication in multicast.

Secure authentication of classical messages with single photons

This paper proposes a scheme for secure authentication of classical messages with single photons and a hashed function. The security analysis of this scheme is also given, which shows that anyone cannot forge valid message authentication codes （MACs）. In addition, the lengths of the authentication key and the MACs are invariable and shorter, in comparison with those presented authentication schemes. Moreover, quantum data storage and entanglement are not required in this scheme. Therefore, this scheme is more efficient and economical.

A Secure Public-key Image Authentication Plan

Digital watermark can be used for image ownership verification orauthentication. In this paper, we propose a new image authentication plan concentrating on itssecurity performance. Digital watermark is first turbo coded, sealed and then processed. In waveletdomain. To enhance security level, public key cryptosystem is utilized to replace traditionalwatermark key. Simulation results are finally given by experiment.

Security System in United Storage Network and Its Implementation

With development of networked storage and its applications, united storage network (USN) combined with network attached storage (NAS) and storage area network (SAN) has emerged. It has such advantages as high performance, low cost, good connectivity, etc. However the security issue has been complicated because USN responds to block I/O and file I/O requests simultaneously. In this paper, a security system module is developed to prevent many types of attacks against USN based on NAS head. The module not only uses effective authentication to prevent unauthorized access to the system data, but also checks the data integrity. Experimental results show that the security module can not only resist remote attacks and attacks from those who has physical access to the USN, but can also be seamlessly integrated into underlying file systems, with little influence on their performance.