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.展开更多
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.展开更多
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.展开更多
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 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.展开更多
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.
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.展开更多
Group key management technique is a fundamental building block for secure and reliable group communication systems.In order to successfully achieve this goal, group session key needs to be generated and distributed to...Group key management technique is a fundamental building block for secure and reliable group communication systems.In order to successfully achieve this goal, group session key needs to be generated and distributed to all group members in a secure and authenticated manner.The most commonly used method is based on Lagrange interpolating polynomial over the prime field F p={0,1,2,…, p-1}. A novel approach to group key transfer protocol based on a category of algebraic-geometry code is presented over the infinite field GF(2 m). The attractive advantages are obvious. Especially, the non-repeatability, confidentiality, and authentication of group key transfer protocols are obtained easily. Besides, a more generalized and simple mathematical construction model is proposed which also can be applied perfectly to related fields of information security.展开更多
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...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 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 o...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.展开更多
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 me...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.展开更多
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 cod...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.展开更多
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.展开更多
基金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.
文摘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.
文摘In this paper, two new constructions of Cartesian authentication codes from symplectic geometry are presented and their size parameters are computed.
文摘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.
基金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.
文摘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 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.
文摘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.
文摘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.
基金Supported by the National Natural Science Foundation of China(No.61501064)Sichuan Technology Support Program(No.2015GZ0088)
文摘Group key management technique is a fundamental building block for secure and reliable group communication systems.In order to successfully achieve this goal, group session key needs to be generated and distributed to all group members in a secure and authenticated manner.The most commonly used method is based on Lagrange interpolating polynomial over the prime field F p={0,1,2,…, p-1}. A novel approach to group key transfer protocol based on a category of algebraic-geometry code is presented over the infinite field GF(2 m). The attractive advantages are obvious. Especially, the non-repeatability, confidentiality, and authentication of group key transfer protocols are obtained easily. Besides, a more generalized and simple mathematical construction model is proposed which also can be applied perfectly to related fields of information security.
基金supported in part by the Joint Foundation of National Natural Science Committee of China and Civil Aviation Administration of China under Grant U1933108in part by the Scientific Research Project of Tianjin Municipal Education Commission under Grant 2019KJ117.
文摘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.
基金Supported bythe National Natural Science Foundationof China (60175001)
文摘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.
基金supported by the National Natural Science Foundation of China (Grant Nos 60873191 and 60821001)the Specialized Research Fund for the Doctoral Program of Higher Education (Grant No 200800131016)+5 种基金Beijing Nova Program (Grant No2008B51)Key Project of the Chinese Ministry of Education (Grant No 109014)the Natural Science Foundation of Beijing (Grant No 4072020)the National Laboratory for Modern Communications Science Foundation of China (Grant No 9140C1101010601)the Natural Science Foundation of Education Bureau of Henan Province (Grant No 2008B120005)the Youth Foundation of Luoyang Normal University
文摘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.
文摘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.
文摘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.
