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 ...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.展开更多
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...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.展开更多
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...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.展开更多
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 probab...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.展开更多
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.
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 ...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.展开更多
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 atta...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.展开更多
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 ch...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 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 ar...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.展开更多
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 infor...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.展开更多
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 t...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.展开更多
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 ar...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.展开更多
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 i...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.展开更多
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...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.展开更多
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...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.展开更多
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...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.展开更多
In this paper, a type of combinatorial design (called difference packing array)is proposed and used to give a construction of systematic authentication codes. Taking advantage of this construction, some new series of ...In this paper, a type of combinatorial design (called difference packing array)is proposed and used to give a construction of systematic authentication codes. Taking advantage of this construction, some new series of systematic authentication codes are obtainable in terms of existing difference packing arrays.展开更多
文摘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.
文摘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.
文摘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.
基金Foundation item:The Key Project(03060)of Chinese Ministry of Education.
文摘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.
文摘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.
文摘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.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61179026)the Fundamental Research of the Central Universities of China Civil Aviation University of Science Special(Grant No.3122016L005)
文摘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.
文摘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.
文摘In this paper, two new constructions of Cartesian authentication codes from symplectic geometry are presented and their size parameters are computed.
基金Supported by the National Natural Science Foundation of China(No.61179026,61262057)the Fundamental Research Funds of the Central Universities of China(No.ZXH2012K003,3122013K001)
文摘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.
基金supported by the National Foundation of Netherlands with SenterNovem for the ALwEN project under Grant No.PNE07007the National Natural Science Foundation of China under Grant Nos.61100201,U1135004,and 61170080+3 种基金the Universities and Colleges Pearl River Scholar Funded Scheme of Guangdong Province of China(2011)the High-Level Talents Project of Guangdong Institutions of Higher Education of China(2012)the Project on the Integration of Industry,Education and Research of Guangdong Province of China under Grant No.2012B091000035the Project of Science and Technology New Star of Guangzhou Pearl River of China(2014)
文摘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.
基金Supported by the National Natural Science Foundation of China (Grant No. 10771023)
文摘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.
基金supported by the National Natural Science Foundation of China(61179026)the Fundamental Research Funds for the Central Universities(3122016L005)
文摘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.
基金Supported by the National Natural Science Foundation of China(No.61179026)the Fundamental Research Funds For the Central Universities(No.3122013K001)
文摘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.
基金Foundation item： the National Natural Science Foundation of China （No. 60776810） the Natural Science Foundation of Tianjin City （No. 08JCYBJC13900）.
文摘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.
文摘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.
基金This work was supported in part by the Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology under Grant 2016r055in part by the Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions.
文摘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.
基金This work was supported in part by the National Natural Science Foundation of China(Grant No.13071086).
文摘In this paper, a type of combinatorial design (called difference packing array)is proposed and used to give a construction of systematic authentication codes. Taking advantage of this construction, some new series of systematic authentication codes are obtainable in terms of existing difference packing arrays.
