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

International Journal of Theoretical Physics

Controlled Quantum Secure Direct Communication Protocol Based on Huffman Compression Coding

Zhengwen Cao, Yan Li, Jinye Peng, Geng Chai, Guang Wei Zhao

Published Sep 24, 2018• 19 citations
Publisher
DOI
10.1007/s10773-018-3876-2

Related papers

Efficient Quantum Secure Direct Communication Protocol Based on Quantum Channel Compression

Georgi Bebrov, Rozalina Dimova

International Journal of Theoretical Physics•Dec 14, 2019•19 citations

A Comparative Study of Lossless Compression Technique in Quantum Secure Direct Communication

NUR ZIADAH HARUN

This is a comparative study to explore the performance of three lossless compression techniques, namely Run Length Encoding (RLE), Shannon-Fano Coding (SFC), and Huffman Coding (HC) in the context of a Hybrid M-Ary in Braided Single Stage (HMBSS) protocol communication scheme. The previous study on HMBSS using HC found that HC’s compression technique has drawbacks, i.e., it is sensitive to errors and noise in the transmission channel and limited to certain data types. These drawbacks did affect the value of the compression rate limit. In this study, we evaluate the effectiveness of RLE, SFC, and HC in terms of data size reduction, coding efficiency, and data transmission time by comparing their results arising from the simulation experiments using Python coding in Jupiter Notebook and developed based on the HMBSS protocol algorithm. This simulation experiment starts with an initial six randomly generated datasets. Each dataset is tested using three compression techniques, which resulted in 18 different datasets. The results from the experiments reveal that SFC and HC consistently achieved a higher compression ratio and coding efficiency than RLE. These two compression techniques’ algorithms effectively reduce the data size while preserving the original information. In our study, we also find that the data transmission time is increased with larger text sizes for all three compression techniques. This indicates that the larger the data size, the more transmission time is required with regard to what the compression technique’s algorithm is.

•Mar 1, 2025•0 citations

Efficient Controlled Quantum Secure Direct Communication Protocols

Siddharth Patwardhan, Subhayan Roy Moulick, Prasanta K. Panigrahi

arXiv:1509.05882•International Journal of Theoretical Physics•Mar 14, 2016•11 citations

A Comparative Study of Lossless Compression Technique in Quantum Secure Direct Communication

Izlin Zuriani Ishak, Liew Seow Wooi, Nur Ziadah Harun +3 more

This is a comparative study to explore the performance of three lossless compression techniques, namely Run Length Encoding (RLE), Shannon-Fano Coding (SFC), and Huffman Coding (HC) in the context of a Hybrid M-Ary in Braided Single Stage (HMBSS) protocol communication scheme. The previous study on HMBSS using HC found that HC's compression technique has drawbacks, i.e., it is sensitive to errors and noise in the transmission channel and limited to certain data types. These drawbacks did affect the value of the compression rate limit. In this study, we evaluate the effectiveness of RLE, SFC, and HC in terms of data size reduction, coding efficiency, and data transmission time by comparing their results arising from the simulation experiments using Python coding in Jupiter Notebook and developed based on the HMBSS protocol algorithm. This simulation experiment starts with an initial six randomly generated datasets. Each dataset is tested using three compression techniques, which resulted in 18 different datasets. The results from the experiments reveal that SFC and HC consistently achieved a higher compression ratio and coding efficiency than RLE. These two compression techniques' algorithms effectively reduce the data size while preserving the original information. In our study, we also find that the data transmission time is increased with larger text sizes for all three compression techniques. This indicates that the larger the data size, the more transmission time is required with regard to what the compression technique's algorithm is.

International Conference on Cyber Security and Computing (CyberComp)•Nov 6, 2024•0 citations

Multi-Party Controlled Semi-Quantum Dialogue Protocol Based on Hyperentangled Bell States

Meng-Na Zhao, Ri‐Gui Zhou, Yinqi Feng

To solve the fundamental problem of excessive consumption of classical resources and the simultaneous security vulnerabilities in semi-quantum dialogue systems, a multi-party controlled semi-quantum dialogue protocol based on hyperentangled Bell states is proposed. A single controlling party is vulnerable to information compromise due to tampering or betrayal; the multi-party controlled mechanism (Charlie1 to Charlien) in this protocol establishes a distributed trust model. It mandates collective authorization from all controlling parties, significantly enhancing its robust resilience against untrustworthy controllers or collusion attacks. The classical participant Bob uses an adaptive Huffman compression algorithm to provide a framework for information transmission. This encoding mechanism assigns values to each character by constructing a Huffman tree, generating optimal prefix codes that significantly optimize the storage space complexity for the classical participant. By integrating the “immediate measurement and transmission” mechanism into the multi-party controlled semi-quantum dialogue protocol and coupling it with Huffman compression coding technology, this framework enables classical parties to execute encoding and decoding operations. The security of this protocol is rigorously proven through information-theoretic analysis and shows that it is resistant to common attacks. Furthermore, even in the presence of malicious controlling parties, this protocol robustly safeguards secret information against theft. The efficiency analysis shows that the proposed protocol provides benefits such as high communication efficiency and lower resource consumption for classical participants.

Entropy•Jun 21, 2025•4 citations

A Novel Practical Quantum Secure Direct Communication Protocol

Lu Yin-Ju

International Journal of Theoretical Physics•Feb 21, 2021•8 citations
This is a comparative study to explore the performance of three lossless compression techniques, namely Run Length Encoding (RLE), Shannon-Fano Coding (SFC), and Huffman Coding (HC) in the context of a Hybrid M-Ary in Braided Single Stage (HMBSS) protocol communication scheme. The previous study on HMBSS using HC found that HC’s compression technique has drawbacks, i.e., it is sensitive to errors and noise in the transmission channel and limited to certain data types. These drawbacks did affect the value of the compression rate limit. In this study, we evaluate the effectiveness of RLE, SFC, and HC in terms of data size reduction, coding efficiency, and data transmission time by comparing their results arising from the simulation experiments using Python coding in Jupiter Notebook and developed based on the HMBSS protocol algorithm. This simulation experiment starts with an initial six randomly generated datasets. Each dataset is tested using three compression techniques, which resulted in 18 different datasets. The results from the experiments reveal that SFC and HC consistently achieved a higher compression ratio and coding efficiency than RLE. These two compression techniques’ algorithms effectively reduce the data size while preserving the original information. In our study, we also find that the data transmission time is increased with larger text sizes for all three compression techniques. This indicates that the larger the data size, the more transmission time is required with regard to what the compression technique’s algorithm is.
This is a comparative study to explore the performance of three lossless compression techniques, namely Run Length Encoding (RLE), Shannon-Fano Coding (SFC), and Huffman Coding (HC) in the context of a Hybrid M-Ary in Braided Single Stage (HMBSS) protocol communication scheme. The previous study on HMBSS using HC found that HC's compression technique has drawbacks, i.e., it is sensitive to errors and noise in the transmission channel and limited to certain data types. These drawbacks did affect the value of the compression rate limit. In this study, we evaluate the effectiveness of RLE, SFC, and HC in terms of data size reduction, coding efficiency, and data transmission time by comparing their results arising from the simulation experiments using Python coding in Jupiter Notebook and developed based on the HMBSS protocol algorithm. This simulation experiment starts with an initial six randomly generated datasets. Each dataset is tested using three compression techniques, which resulted in 18 different datasets. The results from the experiments reveal that SFC and HC consistently achieved a higher compression ratio and coding efficiency than RLE. These two compression techniques' algorithms effectively reduce the data size while preserving the original information. In our study, we also find that the data transmission time is increased with larger text sizes for all three compression techniques. This indicates that the larger the data size, the more transmission time is required with regard to what the compression technique's algorithm is.
To solve the fundamental problem of excessive consumption of classical resources and the simultaneous security vulnerabilities in semi-quantum dialogue systems, a multi-party controlled semi-quantum dialogue protocol based on hyperentangled Bell states is proposed. A single controlling party is vulnerable to information compromise due to tampering or betrayal; the multi-party controlled mechanism (Charlie1 to Charlien) in this protocol establishes a distributed trust model. It mandates collective authorization from all controlling parties, significantly enhancing its robust resilience against untrustworthy controllers or collusion attacks. The classical participant Bob uses an adaptive Huffman compression algorithm to provide a framework for information transmission. This encoding mechanism assigns values to each character by constructing a Huffman tree, generating optimal prefix codes that significantly optimize the storage space complexity for the classical participant. By integrating the “immediate measurement and transmission” mechanism into the multi-party controlled semi-quantum dialogue protocol and coupling it with Huffman compression coding technology, this framework enables classical parties to execute encoding and decoding operations. The security of this protocol is rigorously proven through information-theoretic analysis and shows that it is resistant to common attacks. Furthermore, even in the presence of malicious controlling parties, this protocol robustly safeguards secret information against theft. The efficiency analysis shows that the proposed protocol provides benefits such as high communication efficiency and lower resource consumption for classical participants.