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

Journal of the University of Shanghai for Science and Technology

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

Gengsheng Zhang

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

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.

Related papers

New construction of authentication codes with arbitration from symplectic geometry

LI Zhi-mei

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.

Hebei ke-ji daxue xuebao•Jan 1, 2010•2 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

Arbitrated Secure Authentication realized by using quantum principles

Helena Bruyninckx, Dirk Van Heule

Unconditionally secure authentication schemes with an arbiter have been proposed in the literature. We extend this idea in the context of quantum authentication. In this paper, we present an unconditionally secure authentication scheme with an arbiter by using quantum principles. Compared to other arbitrated quantum schemes, our scheme is secure against denial by the sender of having sent a message (non-repudiation property) and also secure against a malicious receiver. We consider the problem of authenticating a classical message in the presence of a semi-honest arbiter. The shared secret keys can be reused, in contrast to several other proposed arbitrated quantum schemes.

International Conference on Communications•Jun 1, 2015•0 citations

Security analysis and improvements of arbitrated quantum signature schemes

Xiangfu Zou, Daowen Qiu

A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature (AQS) schemes have been proposed. It was claimed that these AQS schemes could guarantee unconditional security. However, we show that they can be repudiated by the receiver Bob. To conquer this shortcoming, we construct an AQS scheme using a public board. The AQS scheme not only avoids being disavowed by the receiver but also preserves all merits in the existing schemes. Furthermore, we discover that entanglement is not necessary while all these existing AQS schemes depend on entanglement. Therefore, we present another AQS scheme without utilizing entangled states in the signing phase and the verifying phase. This scheme has three advantages: it does not utilize entangled states and it preserves all merits in the existing schemes; the signature can avoid being disavowed by the receiver; and it provides a higher efficiency in transmission and reduces the complexity of implementation.

Physical Review A•Oct 21, 2010•181 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
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.
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.
Unconditionally secure authentication schemes with an arbiter have been proposed in the literature. We extend this idea in the context of quantum authentication. In this paper, we present an unconditionally secure authentication scheme with an arbiter by using quantum principles. Compared to other arbitrated quantum schemes, our scheme is secure against denial by the sender of having sent a message (non-repudiation property) and also secure against a malicious receiver. We consider the problem of authenticating a classical message in the presence of a semi-honest arbiter. The shared secret keys can be reused, in contrast to several other proposed arbitrated quantum schemes.
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature (AQS) schemes have been proposed. It was claimed that these AQS schemes could guarantee unconditional security. However, we show that they can be repudiated by the receiver Bob. To conquer this shortcoming, we construct an AQS scheme using a public board. The AQS scheme not only avoids being disavowed by the receiver but also preserves all merits in the existing schemes. Furthermore, we discover that entanglement is not necessary while all these existing AQS schemes depend on entanglement. Therefore, we present another AQS scheme without utilizing entangled states in the signing phase and the verifying phase. This scheme has three advantages: it does not utilize entangled states and it preserves all merits in the existing schemes; the signature can avoid being disavowed by the receiver; and it provides a higher efficiency in transmission and reduces the complexity of implementation.
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.