Article Details

Title · Authors · Abstract · Keywords · DOI · References

Efficient Single-round Fair Quantum Secret Sharing

WU Xinya, ZHAI Qingying, ZHANG Jinrui

(Hefei University of Technology, Hefei 230009, China)

Section：Network and Information Security · Vol. 2026, Issue 17 · Pages：137-141,146 · 2096-4706（2026）17-0137-06 · CLC number：TP309 · Document code：A · DOI：10.19850/j.cnki.2096-4706.2026.17.024

Abstract

Fair quantum secret sharing ensures that participants with equal status obtain the secret fairly, which is of great significance in real-life scenarios. Existing fair schemes require multiple rounds of reconstruction, resulting in huge quantum resource overhead that limits their practicality. To address this issue, drawing on the latest fairness methods, this study designs more efficient quantum operations to carry and transmit secret information and proposes an efficient fair quantum secret sharing scheme. The proposed scheme requires only one round of reconstruction to recover the secret fairly. Experimental simulations demonstrate that it achieves the lowest quantum resource overhead among existing schemes (one Bell state preparation and m + 1 unitary operations), while improving the cheating detection probability by one order of magnitude compared with other schemes.

Keywords

quantum secret sharing; fairness; efficiency; Bell state; single-round reconstruction; cheating detection

References

  1. [1] Shamir A. How to Share a Secret [J].Communications of the ACM，1979，22（11）：612-613.
  2. [2] Mayers D. Unconditional Security in Quantum Cryptography [J].Journal of the ACM (JACM)，2001，48（3）：351-406.
  3. [3] Hillery M，Bužek V，Berthiaume A. Quantum Secret Sharing [J].Physical Review A，1999，59（3）：1829-1834.
  4. [4] Tompa M，Woll H. How to Share a Secret with Cheaters [J].Journal of Cryptology，1989，1（3）：133-138.
  5. [5] Liu F，Qin S J，Wen Q Y. A Quantum Secret-Sharing Protocol with Fairness [J/OL].Physica Scripta，2014，89（7）：075104.https://iopscience.iop.org/article/10.1088/0031-8949/89/7/075104.
  6. [6] Bai C M，Zhang S，Liu L. Fair Quantum Secret Sharing Based on Symmetric Bivariate Polynomial [J/OL].Physica A: Statistical Mechanics and Its Applications，2022，589：126673.https://doi.org/10.1016/j.physa.2021.126673.
  7. [7] Li F，Chen T，Zhu S. A （t，n） Threshold Quantum Secret Sharing Scheme with Fairness [J/OL].International Journal of Theoretical Physics，2023，62（6）：119.https://doi.org/10.1007/s10773-023-05383-z.
  8. [8] Gu J，Li F，Zhu S. A New and Efficient Fair Quantum Secret Sharing Scheme [J/OL].Quantum Information Processing，2025，24（12）：381.https://doi.org/10.1007/s11128-025-05006-y.
  9. [9] Li F，Gu J，Zhu S. A d-Dimensional Efficient and Verifiable Quantum Multi-Secret Sharing Scheme [J/OL].International Journal of Theoretical Physics，2025，64（6）：172.https://doi.org/10.1007/s10773-025-06040-3.
  10. [10] Kent A. Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes [J/OL].Physical Review Letters，2012，109（13）：130501.https://doi.org/10.1103/PhysRevLett.109.130501.

About the authors

Wu Xinya (1998-), female, Han ethnicity, from Hefei, Anhui, master's student, research interests include network and information security.