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

Communications in Theoretical Physics

Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding*

Hong Lai, Ming-Xing 明星 Luo 罗, Josef Pieprzyk, Tao Li, Zhiming Liu, Mehmet Ali Orgun

Published Nov 1, 2016• 5 citations
Publisher

Abstract

Abstract In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.

DOI
10.1088/0253-6102/66/5/501

Related papers

High-capacity three-party quantum secret sharing with superdense coding

Bin Gu, Li Chuan-Qi, Xu Fei +1 more

This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein–Podolsky–Rosen pairs in d -dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lb d bits of information, and almost all the pairs can be used for carrying useful information.

Chinese Physics B•Nov 1, 2009•35 citations

Fast and simple high-capacity quantum cryptography with error detection

Hong Lai, Ming‐Xing Luo, Josef Pieprzyk +4 more

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

Scientific Reports•Apr 13, 2017•8 citations

A Quantum Secret Sharing Scheme Using Orbital Angular Momentum onto Multiple Spin States Based on Fibonacci Compression Encoding*

Hong Lai, Ming-Xing 明星 Luo 罗, Yong-Jian 永健 Xu 徐 +4 more

Abstract Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.

Communications in Theoretical Physics•Oct 1, 2018•6 citations

High-capacity quantum Fibonacci coding for key distribution

David S. Simon, Nate Lawrence, Jacob Trevino +2 more

Quantum cryptography and quantum key distribution (QKD) have been the most successful applications of quantum information processing, highlighting the unique capability of quantum mechanics, through the no-cloning theorem, to securely share encryption keys between two parties. Here, we present an approach to high-capacity, high-efficiency QKD by exploiting cross-disciplinary ideas from quantum information theory and the theory of light scattering of aperiodic photonic media. We propose a unique type of entangled-photon source, as well as a physical mechanism for efficiently sharing keys. The key-sharing protocol combines entanglement with the mathematical properties of a recursive sequence to allow a realization of the physical conditions necessary for implementation of the no-cloning principle for QKD, while the source produces entangled photons whose orbital angular momenta (OAM) are in a superposition of Fibonacci numbers. The source is used to implement a particular physical realization of the protocol by randomly encoding the Fibonacci sequence onto entangled OAM states, allowing secure generation of long keys from few photons. Unlike in polarization-based protocols, reference frame alignment is unnecessary, while the required experimental setup is simpler than other OAM-based protocols capable of achieving the same capacity and its complexity grows less rapidly with increasing range of OAM used.

Physical Review A•Mar 11, 2013•38 citations

Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding

Hong Lai, Jun Zhang, Ming‐Xing Luo +4 more

With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.

Scientific Reports•Aug 12, 2016•808 citations

Improved quantum key distribution based on Lucas-valued orbital angular momentum states

Chengji Liu, Changhua Zhu, Min Nie +2 more

We propose an improved quantum key distribution (QKD) protocol based on orbital angular momentum (OAM) entangled states. Three Lucas-valued OAM entangled photons are generated by two cascaded spontaneous parameter down-conversion processes. Two photons are detained and detected by Alice, while the other is transmitted to Bob and then detected. A new scheme is designed to sift the original key bits. Compared to existing protocols, we believe our protocol greatly improves coding efficiency and is verifiable. The analysis results show that our protocol is immune to the photon-number-splitting attack, the intercept-resend attack and the classical information leakage. This work provides an efficient path to high-dimensional QKD systems.

Journal of the Optical Society of America B•Jan 28, 2020•8 citations
Abstract In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.
This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein–Podolsky–Rosen pairs in d -dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lb d bits of information, and almost all the pairs can be used for carrying useful information.
Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.
Abstract Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.
Quantum cryptography and quantum key distribution (QKD) have been the most successful applications of quantum information processing, highlighting the unique capability of quantum mechanics, through the no-cloning theorem, to securely share encryption keys between two parties. Here, we present an approach to high-capacity, high-efficiency QKD by exploiting cross-disciplinary ideas from quantum information theory and the theory of light scattering of aperiodic photonic media. We propose a unique type of entangled-photon source, as well as a physical mechanism for efficiently sharing keys. The key-sharing protocol combines entanglement with the mathematical properties of a recursive sequence to allow a realization of the physical conditions necessary for implementation of the no-cloning principle for QKD, while the source produces entangled photons whose orbital angular momenta (OAM) are in a superposition of Fibonacci numbers. The source is used to implement a particular physical realization of the protocol by randomly encoding the Fibonacci sequence onto entangled OAM states, allowing secure generation of long keys from few photons. Unlike in polarization-based protocols, reference frame alignment is unnecessary, while the required experimental setup is simpler than other OAM-based protocols capable of achieving the same capacity and its complexity grows less rapidly with increasing range of OAM used.
With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.
We propose an improved quantum key distribution (QKD) protocol based on orbital angular momentum (OAM) entangled states. Three Lucas-valued OAM entangled photons are generated by two cascaded spontaneous parameter down-conversion processes. Two photons are detained and detected by Alice, while the other is transmitted to Bob and then detected. A new scheme is designed to sift the original key bits. Compared to existing protocols, we believe our protocol greatly improves coding efficiency and is verifiable. The analysis results show that our protocol is immune to the photon-number-splitting attack, the intercept-resend attack and the classical information leakage. This work provides an efficient path to high-dimensional QKD systems.