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

Quantum Information Processing

Secure quantum network coding based on quantum homomorphic message authentication

Zhenzhen Li, Gang Xu, Xiu‐Bo Chen, Yixian Yang

Published Nov 23, 2018• 12 citations
Publisher
DOI
10.1007/s11128-018-2127-z

Related papers

Quantum Network Coding with Message Authentication

Tao Shang, Jianwei Liu

Springer eBooks•Jan 1, 2020•0 citations

A Secure Quantum Network Coding Scheme with Identity Authentication

Xiaojie Zhao, Tao Shang, Jiao Li +2 more

Sensor Letters•Feb 1, 2014•2 citations

Quantum homomorphic signature using coherent states

Qing-bin Luo, Guowu Yang, Kun She +2 more

In this paper, a novel scheme for quantum homomorphic signature based on coherent states is proposed, which is an effective approach to identity authentication for multiple streams to enhance the security of quantum networks. The state used for signature are arbitrarily close in trace distance to states of O(log2n), if the length of the nodes' messages is n-bit. The scheme analysis shows that the scheme is a quantum group homomorphic signature scheme and the signature is unforgeable.

IEEE International Conference on Computer and Communications (ICCC)•Oct 1, 2016•1 citation

Streaming authentication and multi-level security for communications networks using quantum cryptography

Richard Hughes

Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.

•Dec 6, 2023•0 citations

Quantum Network Coding Against Pollution Attacks

Tao Shang, Zhuang Pei, Xiaojie Zhao +1 more

Quantum network coding is vulnerable to pollution attacks, especially when using classical channel as auxiliary resource. On this basis, this letter proposes a secure quantum network coding scheme against pollution attacks. The scheme uses quantum homomorphic signature for the efficient authentication of different data sources so as to detect pollution attacks in the butterfly network. Furthermore, with the help of trusted intermediate nodes, it can locate a corrupt data source. Analysis results show that the proposed quantum network coding scheme can defend against pollution attacks with high fidelity, fewer resource consumption, and lower rate region.

IEEE Communications Letters•Jan 1, 2016•15 citations

Measurement-based quantum network coding with quantum homomorphic encryption

Zhenzhen Li, Wen-Ling Yang, Ming-Kui Liu +1 more

•Jan 1, 2026•0 citations
Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.
Quantum network coding is vulnerable to pollution attacks, especially when using classical channel as auxiliary resource. On this basis, this letter proposes a secure quantum network coding scheme against pollution attacks. The scheme uses quantum homomorphic signature for the efficient authentication of different data sources so as to detect pollution attacks in the butterfly network. Furthermore, with the help of trusted intermediate nodes, it can locate a corrupt data source. Analysis results show that the proposed quantum network coding scheme can defend against pollution attacks with high fidelity, fewer resource consumption, and lower rate region.