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

The European Physical Journal Special Topics

Verifiable quantum secret sharing protocol based on the privacy-preserving computation

Yu Tao Du, Xiang Wang, Wan Su Bao

Published Oct 16, 2025• 1 citation
Publisher
DOI
10.1140/epjs/s11734-025-01971-8

Related papers

A Verifiable Dynamic (t,n) Threshold Quantum Secret Sharing Protocol with Authentication

J. -C. Li, Ming‐Ming Wang

Abstract Quantum secret sharing (QSS) plays a crucial role in quantum cryptography as a privacy preserving scheme. Designing an efficient QSS protocol requires addressing three key challenges: 1) dynamic agent membership (handling agents joining or leaving during execution), 2) adversarial resilience (ensuring robustness against dishonest agents), and 3) practical optimization (improving computational and communication efficiency while minimizing implementation cost). In this paper, a verifiable dynamic threshold QSS (VDQSS) protocol with authentication capability is proposed. The protocol employs single particles for both authentication and share distribution, combining homogeneous linear recursion (HLR) with mutually unbiased bases (MUBs) to reconstruct multiple secrets. This approach significantly enhances security while reducing protocol complexity. The correctness and practicality of the protocol are validated through experimental simulations. Analytical results demonstrate its robustness against common attacks, providing reliable security guarantees for quantum communications. Compared to existing QSS protocols, the protocol offers enhanced simplicity and practical applicability.

Advanced Quantum Technologies•Sep 4, 2025•3 citations

Verifiable Quantum Secret Sharing Protocols Based on Four-Qubit Entangled States

Weifeng Cao, Yu‐Guang Yang

International Journal of Theoretical Physics•Jan 31, 2019•21 citations

Efficient Privacy-Preserving Computation Based on Additive Secret Sharing

Lizhi Xiong, Wenhao Zhou, Zhihua Xia +2 more

The emergence of cloud computing provides a new computing paradigm for users -- massive and complex computing tasks can be outsourced to cloud servers. However, the privacy issues also follow. Fully homomorphic encryption shows great potential in privacy-preserving computation, yet it is not ready for practice. At present, secure multiparty computation (MPC) remains mainly approach to deal with sensitive data. In this paper, following the secret sharing based MPC paradigm, we propose a secure 2-party computation scheme, in which cloud servers can securely evaluate functions with high efficiency. We first propose the multiplicative secret sharing (MSS) based on typical additive secret sharing (ASS). Then, we design protocols to switch shared secret between MSS and ASS, based on which a series of protocols for comparison and nearly all of the elementary functions are proposed. We prove that all the proposed protocols are Universally Composable secure in the honest-but-curious model. Finally, we will show the remarkable progress of our protocols on both communication efficiency and functionality completeness.

arXiv:2009.05356•Sep 11, 2020•12 citations

A quantum secret sharing scheme with verifiable function

Li-Juan Liu, Zhi-Hui Li, Zhao-Wei Han +1 more

arXiv:2003.04309•The European Physical Journal D•Jul 1, 2020•18 citations

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Chen‐Ming Bai, Yanan Feng, Sujuan Zhang +1 more

International Journal of Theoretical Physics•Jan 5, 2024•10 citations

Quantum Key Distribution Based Privacy Computation Protocol

Jincheng Zhang

This paper presents a novel privacy computation protocol leveraging Quantum Key Distribution (QKD) for enhanced data privacy. The core idea is to utilize the principles of QKD to generate a shared secret key, which is then employed to perform computations on encrypted data, ensuring the confidentiality of the results. This approach addresses the fundamental challenge of traditional computation, where data is vulnerable to interception and manipulation during processing. The protocol details the key management process, the encryption/decryption scheme based on QKD, and the computation steps undertaken using the shared key. The proposed system offers a significant advancement in privacy-preserving computation, particularly in scenarios where data sensitivity is paramount. The design focuses on minimizing the computational overhead associated with QKD while maximizing the level of privacy protection. This work lays the groundwork for future research and development in privacy-preserving quantum computing and communication.

•Aug 31, 2026•0 citations
Abstract Quantum secret sharing (QSS) plays a crucial role in quantum cryptography as a privacy preserving scheme. Designing an efficient QSS protocol requires addressing three key challenges: 1) dynamic agent membership (handling agents joining or leaving during execution), 2) adversarial resilience (ensuring robustness against dishonest agents), and 3) practical optimization (improving computational and communication efficiency while minimizing implementation cost). In this paper, a verifiable dynamic threshold QSS (VDQSS) protocol with authentication capability is proposed. The protocol employs single particles for both authentication and share distribution, combining homogeneous linear recursion (HLR) with mutually unbiased bases (MUBs) to reconstruct multiple secrets. This approach significantly enhances security while reducing protocol complexity. The correctness and practicality of the protocol are validated through experimental simulations. Analytical results demonstrate its robustness against common attacks, providing reliable security guarantees for quantum communications. Compared to existing QSS protocols, the protocol offers enhanced simplicity and practical applicability.
The emergence of cloud computing provides a new computing paradigm for users -- massive and complex computing tasks can be outsourced to cloud servers. However, the privacy issues also follow. Fully homomorphic encryption shows great potential in privacy-preserving computation, yet it is not ready for practice. At present, secure multiparty computation (MPC) remains mainly approach to deal with sensitive data. In this paper, following the secret sharing based MPC paradigm, we propose a secure 2-party computation scheme, in which cloud servers can securely evaluate functions with high efficiency. We first propose the multiplicative secret sharing (MSS) based on typical additive secret sharing (ASS). Then, we design protocols to switch shared secret between MSS and ASS, based on which a series of protocols for comparison and nearly all of the elementary functions are proposed. We prove that all the proposed protocols are Universally Composable secure in the honest-but-curious model. Finally, we will show the remarkable progress of our protocols on both communication efficiency and functionality completeness.
This paper presents a novel privacy computation protocol leveraging Quantum Key Distribution (QKD) for enhanced data privacy. The core idea is to utilize the principles of QKD to generate a shared secret key, which is then employed to perform computations on encrypted data, ensuring the confidentiality of the results. This approach addresses the fundamental challenge of traditional computation, where data is vulnerable to interception and manipulation during processing. The protocol details the key management process, the encryption/decryption scheme based on QKD, and the computation steps undertaken using the shared key. The proposed system offers a significant advancement in privacy-preserving computation, particularly in scenarios where data sensitivity is paramount. The design focuses on minimizing the computational overhead associated with QKD while maximizing the level of privacy protection. This work lays the groundwork for future research and development in privacy-preserving quantum computing and communication.