Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Hebei ke-ji daxue xuebao

New construction of authentication codes with arbitration from symplectic geometry

LI Zhi-mei

Published Jan 1, 2010• 2 citations
OpenAlex

Abstract

The authentication codes with arbitration protect against deceptions from the transmitters and receivers as well as those from the opponents.It can solve the problem that transmitters and receivers dispute in communication.A new construction of authentication codes with arbitration from symplectic geometry is given by new method in this paper.The parameters of the codes are computed.Assuming that the probability distribution of source state and encoding rules are uniform,the probabilities of successful attacks are also computed.

Related papers

New construction of authentication codes with arbitration form based on pseudo-symplectic geometry

Gengsheng Zhang

Unconditionally secure authentication codes with arbitration protect against deception from the transmitter or the receiver as well as against fraud from the opponents.A new construction of authentication codes with arbitration form based on pseudo-symplectic geometry is given,and their parameters are computed.Assuming that the probability distributions of source state and encoding rules are uniform,the probabilities of all successful attacks are also computed.

Journal of the University of Shanghai for Science and Technology•Jan 1, 2008•0 citations

Construction of Authentication Codes with Arbitration from Pseudo-symplectic Geometry

Xinmei Wang

A construction of authentication codes with arbitration form pseudo-symplectic geometry is given, the parameters are computed. Assuming that the probability distribution of source state and encoding rules are uniform, the probabilities of successful attacks are also computed.

•Jan 1, 2000•0 citations

Construction of Cartesian authentication code from symplectic geometry

Wang Chun-sen

Letv1,v2be a 2-dimensional totally isotropic subspace, P0 be a fixed subspace of type(m0,s0) with v1 , v2 C P0 c v1 , v2 in 2 v -dimensional symplectic space. The set of source states S is the set of subspaces of type (2s + 1 , s -1) containing v1 ,v2 and contained in P0. The set of encoding rules E is the set of the subspaces of type(3 ,l) which contain v1 ,v2 and are not orthogonal toy2. The set of massages X is the set of the subspaces of type (2s +2,s) which contain v1 ,v2 intersect P0 at a subspace of type (2s + 1 ,s -1) and are not orthogonal to v2. We construct a class of Cartesian authentication code by defining s + e as the message for any s S and e E. Its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probability of a successful impersonation attack PI and that of a successful substitution attack Ps are computed.

Ha'erbin gongye daxue xuebao•Jan 1, 2001•0 citations

Quantum Secret Authentication Code

Tong-Xuan Wei, Tzonelih Hwang, Chia‐Wei Tsai

This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on the random sample discussion, in which the probability of eavesdropper detection is depending on the number of check qubits eavesdropped by the eavesdropper. Hence, if the eavesdropper interferes only a few qubits of the transmitted quantum sequence, then the detection probability will be very low. This study attempts to propose a quantum secret authentication code to solve this problem. With the use of quantum secret authentication code, not only is the probability of eavesdropper detection guaranteed to be evenly distributed no matter how many qubits had been eavesdropped, but also can the quantum transmission efficiency be highly enhanced.

arXiv:1108.3500•Aug 17, 2011•0 citations

Arbitral Security of Signcryptions and a Securely Arbitral Signcryption Scheme

Minghui Zheng

Signcryption provides confidentiality and authenticity efficiently;it can be used to design compact communication protocol.Arbitration mechanism is used for settling disputes in signcryption,but the information that the judge gets also brings some security problems.This paper points out two problems:in some scheme,the arbitrator can decrypt all the signcryptions of a receiver while be gets some kinds of arbitration message;in another schemes,the arbitration mechanism cannot protect the integrity of plain- text.Analyze the two kinds of problems and concludes their reasons separately,we proposed a resolvent that can solve the two prob- lem by changing a secure arbitration message.Based on the attack and analysis,this paper proposes a secure arbitral signcryption (SASC)scheme and proves its IND-CCA2 security and UF-CMA security in random oracle model.Furthermore,SASC is a secure- ly arbitral signcryption scheme,it can protect the integrity of plaintexts by an arbitration message associated with plaintext;and the scheme can resist decryption attacks of arbitrator,even he gets the arbitration message.SASC does not increase computation nor communication overloads;it has no limitation to the length of plaintext,which makes SASC more convenient.Proofs and analysis show that SASC is an efficient and secure scheme.

Dianzi xuebao•Jan 1, 2007•2 citations

Design and Analysis of Information-Theoretically Secure Authentication Codes with Non-Uniformly Random Keys.

Junji Shikata

The authentication code (A-code) is the one of the most fundamental cryptographic protocols in information-theoretic cryptography, and it provides information-theoretic integrity or authenticity, i.e., preventing information from being altered or substituted by the adversary having unbounded computational powers. In addition, it has a wide range of applications such as multiparty compu-tations and quantum key distribution protocols. The traditional A-code theory states that a good A-code is characterized as an A-code which satises equality of a lower bound on size of secret-keys, i.e., an A-code satisfying |K | = ϵ−2, where |K | is cardinality of the set of secret-keys and ϵ is the success probability of attacks of the adversary. However, good A-codes imply that secret-keys must be uniformly distributed. Therefore, if a non-uniformly random key is given, we cannot realize a good A-code by using it as a secret-key. Then, a natural question about this is: what is a good A-code having non-uniformly random keys? And, how can we design such a good A-code having non-uniformly random keys? To answer the questions, in this paper, we perform analysis of A-codes having non-uniformly random keys, and show the principle that guides the design for such good A-codes.

•Jan 1, 2015•6 citations
The authentication codes with arbitration protect against deceptions from the transmitters and receivers as well as those from the opponents.It can solve the problem that transmitters and receivers dispute in communication.A new construction of authentication codes with arbitration from symplectic geometry is given by new method in this paper.The parameters of the codes are computed.Assuming that the probability distribution of source state and encoding rules are uniform,the probabilities of successful attacks are also computed.
Letv1,v2be a 2-dimensional totally isotropic subspace, P0 be a fixed subspace of type(m0,s0) with v1 , v2 C P0 c v1 , v2 in 2 v -dimensional symplectic space. The set of source states S is the set of subspaces of type (2s + 1 , s -1) containing v1 ,v2 and contained in P0. The set of encoding rules E is the set of the subspaces of type(3 ,l) which contain v1 ,v2 and are not orthogonal toy2. The set of massages X is the set of the subspaces of type (2s +2,s) which contain v1 ,v2 intersect P0 at a subspace of type (2s + 1 ,s -1) and are not orthogonal to v2. We construct a class of Cartesian authentication code by defining s + e as the message for any s S and e E. Its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probability of a successful impersonation attack PI and that of a successful substitution attack Ps are computed.
This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on the random sample discussion, in which the probability of eavesdropper detection is depending on the number of check qubits eavesdropped by the eavesdropper. Hence, if the eavesdropper interferes only a few qubits of the transmitted quantum sequence, then the detection probability will be very low. This study attempts to propose a quantum secret authentication code to solve this problem. With the use of quantum secret authentication code, not only is the probability of eavesdropper detection guaranteed to be evenly distributed no matter how many qubits had been eavesdropped, but also can the quantum transmission efficiency be highly enhanced.
Signcryption provides confidentiality and authenticity efficiently;it can be used to design compact communication protocol.Arbitration mechanism is used for settling disputes in signcryption,but the information that the judge gets also brings some security problems.This paper points out two problems:in some scheme,the arbitrator can decrypt all the signcryptions of a receiver while be gets some kinds of arbitration message;in another schemes,the arbitration mechanism cannot protect the integrity of plain- text.Analyze the two kinds of problems and concludes their reasons separately,we proposed a resolvent that can solve the two prob- lem by changing a secure arbitration message.Based on the attack and analysis,this paper proposes a secure arbitral signcryption (SASC)scheme and proves its IND-CCA2 security and UF-CMA security in random oracle model.Furthermore,SASC is a secure- ly arbitral signcryption scheme,it can protect the integrity of plaintexts by an arbitration message associated with plaintext;and the scheme can resist decryption attacks of arbitrator,even he gets the arbitration message.SASC does not increase computation nor communication overloads;it has no limitation to the length of plaintext,which makes SASC more convenient.Proofs and analysis show that SASC is an efficient and secure scheme.
The authentication code (A-code) is the one of the most fundamental cryptographic protocols in information-theoretic cryptography, and it provides information-theoretic integrity or authenticity, i.e., preventing information from being altered or substituted by the adversary having unbounded computational powers. In addition, it has a wide range of applications such as multiparty compu-tations and quantum key distribution protocols. The traditional A-code theory states that a good A-code is characterized as an A-code which satises equality of a lower bound on size of secret-keys, i.e., an A-code satisfying |K | = ϵ−2, where |K | is cardinality of the set of secret-keys and ϵ is the success probability of attacks of the adversary. However, good A-codes imply that secret-keys must be uniformly distributed. Therefore, if a non-uniformly random key is given, we cannot realize a good A-code by using it as a secret-key. Then, a natural question about this is: what is a good A-code having non-uniformly random keys? And, how can we design such a good A-code having non-uniformly random keys? To answer the questions, in this paper, we perform analysis of A-codes having non-uniformly random keys, and show the principle that guides the design for such good A-codes.