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.

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.

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.

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.

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.

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 Secure Visual Secret Sharing Scheme with Authentication Based on QR Code

With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response(QR)code has been widely researched in IoT.However,the security of privacy data in IoT is also a very important issue.At the same time,because IoT is developing towards low-power devices in order to be applied to more fields,the technology protecting the security of private needs to have the characteristics of low computational complexity.Visual Secret Sharing(VSS),with its features of safety and low computational cost,can fully meet the requirements of communication security in IoT.Therefore,a VSS scheme with QR code(VSS-QR)was proposed and has been applied to some extent.In VSS-QR,the secret is shared into a series of shares.These shares are usually common QR codes,which cannot cause the attention of the attacker.However,if there is dishonesty among participants,the secret cannot be recovered,which will lead to VSS-QR cannot be widely used due to its inadequate security.In this paper,we propose a visual secret sharing scheme with authentication based on QR code(VSSA-QR).Both the reconstructed secret QR code and shares can be verified whether they are forged by attackers.The above-mentioned operations conveniently are performed on low-power QR scanning devices.Not only does the proposed scheme prevent some dishonest participants or attackers from cheating,but also prevent all participants from conspiring.In addition,the payload is the QR code itself,which is higher than other schemes.Theoretical analysis and experiments prove that the proposed scheme is effective.

A Construction of Multi-Sender Authentication Codes from Eigenvalues and Eigenvectors of the Matrix Over Finite Fields

We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.

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 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.

香港第三方资助仲裁制度及其对《仲裁法》修订的启示

香港《2017年仲裁及调解(第三方资助)(修订)条例》的颁布为第三方资助仲裁的合法化扫除了障碍,《第三方资助仲裁实务守则》则详细规定了出资第三方所需遵从的常规和标准。对于第三方资助仲裁,香港地区依循的是轻度规管的路线。从内容上来看,相关规定较为全面,更好地保护了受资助方的利益,保障了第三方资助仲裁的健康发展,有利于提高香港地区作为国际仲裁中心的竞争力。与此同时,立法者也为第三方资助仲裁的未来发展预留了充分的空间。这些都对中国内地具有借鉴与启示作用。鉴于已出现第三方资助仲裁的实践,在《仲裁法》的修订中应当借鉴香港地区分阶段规管的思路,在立法上明确承认其合法地位,日后通过司法解释和仲裁规则对其予以具体化和制度化。

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.

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.

智能车载网络中匿名认证与密钥交换协议

智能车载网络是实现智能交通系统的核心,近年来受到学术界越来越多的关注,但车载网络固有的开放性、脆弱性导致其面临许多安全问题。为解决智能车辆与附近RSU之间双向认证和会话密钥的交换以及智能车辆的身份匿名性问题,提出智能车载网络中匿名认证与密钥交换协议。协议中设计了基于身份的数字签名算法,使得智能车辆以身份完全匿名的方式向附近的路边基站单元发送认证信息。当路边基站单元通过认证之后,计算一个消息认证码作为响应信息发送给请求认证的智能车辆,以实现双向认证。此外,在匿名认证的同时还能进行会话密钥的协商,用于后续的安全保密通信。协议是基于身份密码系统设计的,不需要复杂的证书管理。性能评估表明,所提协议能够有效部署在智能车载应用场景。

一种基于动态二维码的图书馆安全身份认证方案

图书馆正进入智能化发展阶段,传统的刷卡、密码等身份认证方式存在被恶意攻击和伪造的问题。基于此,文章构建了一种基于动态二维码的图书馆安全身份认证方案。在总体设计思路和系统架构设计的基础上,深入研究了动态二维码的生成与解析、用户信息解析以及消息管理与传递等关键应用。为了验证了该方案在实际应用中的有效性和可靠性,对方案进行了用户体验测试和系统安全性能测试。经测试,该方案具有高效性、安全性和易用性等显著优势。同时,针对测试中发现的问题,提出了相应的改进措施,为图书馆安全身份认证领域提供了一种有价值的解决方案。

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.

Authentication masking code against DoS of T-MAC protocol

Security vulnerability of denial of service (DoS) in time out-medium access control (T-MAC) protocol was discussed and analysis of power consumption at each stage of T-MAC protocol was carried out. For power efficient authentication scheme which can provide reliability, efficiency, and security for a general T-MAC communication, a novel synchronization and authentication scheme using authentication masking code was proposed. Authentication data were repeated and masked by PN sequence. The simulation results show that the proposed approach can provide synchronization and authentication simultaneously for nodes in wireless sensor network (WSN). 63 bits AMC code gives above 99.97% synchronization detection and 93.98% authentication data detection probability in BER 0.031 7.

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.

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.