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

DEStech Transactions on Computer Science and Engineering

Message Authentication Scheme Based on Chaotic Quantum Cryptosystem

Hang Zhang, Tianyu Cai, Tian-bo WU

Published Jan 10, 2017• 0 citations
Publisher

Abstract

How to ensure the reliability of the data translated in some insecure channel has been a big problem, which influences the communication quality deeply. To solve that, the concept of message authentication is proposed which has been widely used and proved efficient. In this thesis, we proposed a message authentication scheme based on chaotic quantum cryptosystem in this scheme. And the security and reliability is analyzed which shows that this scheme could guarantee the message security validly against different kinds of attack. We hope this will do some favor to the future of communication security.

DOI
10.12783/dtcse/wcne2016/5090

Related papers

Quantum Secure Direct Communication Based on Chaos with Authentication

Dazu Huang, Zhigang Chen, Ying Guo +1 more

A quantum secure direct communication protocol based on chaos is proposed with authentication. It has an advantage over distributing the secret message directly and verifying the communicators' identities with the assistance of a trusted center. To ensure the security of the secret message and the process of verification, the initial order of the travel particles is disturbed according to a chaotic sequence generated secretly via the general Arnold map. Security analysis demonstrates that the present scheme is secure against several attack strategies, such as the man-in-the-middle attack and Trojan horse attack.

Journal of the Physical Society of Japan•Nov 26, 2007•14 citations

A Quantum Public-Key Cryptosystem and Message Authentication Scheme Based on Quantum CSS Error Correcting Codes

Pla Information

This paper presents a quantum public-key cryptosystem by using quantum Calderbank-Shor-Steane(CSS) error correcting codes and the NPC problem related with decoding general linear codes. It uses classical key to encrypt quantum message, and its security relies on the fact that NPC problem can not be solved on quantum Turing machines. Based on this public-key cryptosystem, this paper also gives a message authentication scheme and proves its security.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Jan 1, 2006•0 citations

Message origin authentication and integrity protection in chaos-based optical communication

Panagiotis Rizomiliotis, Adonis Bogris, Dimitris Syvridis

The construction of quantum computers forms the major threat against the security of modern communication systems, as anyone who can build a large quantum computer can break today's most popular cryptosystems. Given the central role of information security in the deployment of modern systems, the preparation of the cryptographic world for a future of quantum computers is imperative. In this context, several alternatives have been proposed, mainly basing their security on the laws of physics. One of the most promising technologies is the optically generated chaos-based cryptography. One of its main advantages is that it can be combined with the technology of optical communication networks in a natural way. In this paper, we propose a message authentication and integrity protection scheme based on optically generated chaos. The new scheme is coming to complete a recently introduced solution, for data confidentiality based on optical chaos.

International Conference on Communications•Jun 1, 2009•2 citations

Quantum digital signature based on quantum one-way functions

Xin Lü, Dengguo Feng

A quantum digital signature scheme based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by fundamental quantum principles. Our protocol involves a so-called arbitrator who validates and authenticates the signed message. This scheme uses public quantum keys publicized by the signatory to verify the validity of the signature and uses quantum one-time pad to ensure the security of quantum information on channel. To guarantee the authenticity of the transmitted quantum states, a family of quantum stabilizer code is employed. The proposed scheme presents a novel method to construct secure quantum signature systems for future secure communications

International Conference on Advanced Communication Technology•Jan 1, 2005•37 citations

Authentication of quantum messages

Howard Barnum, Claude Crépeau, Daniel Gottesman +2 more

Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.

arXiv:quant-ph/0205128•Annual Symposium on Foundations of Computer Science•Jun 26, 2003•293 citations

A lattice-based efficient heterogeneous signcryption scheme for secure network communications

Siqi Yu, Mengxue Shang, Fengyin Li

Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.

Journal of High Speed Networks•Aug 25, 2023•2 citations
How to ensure the reliability of the data translated in some insecure channel has been a big problem, which influences the communication quality deeply. To solve that, the concept of message authentication is proposed which has been widely used and proved efficient. In this thesis, we proposed a message authentication scheme based on chaotic quantum cryptosystem in this scheme. And the security and reliability is analyzed which shows that this scheme could guarantee the message security validly against different kinds of attack. We hope this will do some favor to the future of communication security.
A quantum secure direct communication protocol based on chaos is proposed with authentication. It has an advantage over distributing the secret message directly and verifying the communicators' identities with the assistance of a trusted center. To ensure the security of the secret message and the process of verification, the initial order of the travel particles is disturbed according to a chaotic sequence generated secretly via the general Arnold map. Security analysis demonstrates that the present scheme is secure against several attack strategies, such as the man-in-the-middle attack and Trojan horse attack.
The construction of quantum computers forms the major threat against the security of modern communication systems, as anyone who can build a large quantum computer can break today's most popular cryptosystems. Given the central role of information security in the deployment of modern systems, the preparation of the cryptographic world for a future of quantum computers is imperative. In this context, several alternatives have been proposed, mainly basing their security on the laws of physics. One of the most promising technologies is the optically generated chaos-based cryptography. One of its main advantages is that it can be combined with the technology of optical communication networks in a natural way. In this paper, we propose a message authentication and integrity protection scheme based on optically generated chaos. The new scheme is coming to complete a recently introduced solution, for data confidentiality based on optical chaos.
A quantum digital signature scheme based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by fundamental quantum principles. Our protocol involves a so-called arbitrator who validates and authenticates the signed message. This scheme uses public quantum keys publicized by the signatory to verify the validity of the signature and uses quantum one-time pad to ensure the security of quantum information on channel. To guarantee the authenticity of the transmitted quantum states, a family of quantum stabilizer code is employed. The proposed scheme presents a novel method to construct secure quantum signature systems for future secure communications
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.
Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.