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

General secret sharing based on quantum Fourier transform

Samaneh Mashhadi

Published Mar 4, 2019• 50 citations
Publisher
DOI
10.1007/s11128-019-2233-6

Related papers

Secret sharing based on quantum Fourier transform

Wei Yang, Liusheng Huang, Runhua Shi +1 more

Quantum Information Processing•Feb 21, 2013•46 citations

Hierarchical Quantum Secret Sharing Based On Quantum Fourier Transform

Keqin Chen, Bin‐Bin Cai, Song Lin +1 more

International Journal of Theoretical Physics•Dec 20, 2024•4 citations

Hierarchical multi-secret quantum secret sharing via quantum Fourier transform and linear homogeneous recurrence relations

Chaonan Wang, Peng Guo, Ningning Xu +2 more

Quantum Information Processing•May 25, 2026•0 citations

Multi-dimensional quantum state sharing based on quantum Fourier transform

Huawang Qin, Raylin Tso, Yuewei Dai

Quantum Information Processing•Jan 24, 2018•53 citations

(t, n) Threshold d-Level Quantum Secret Sharing

Xiuli Song, Yanbing Liu, Hongyao Deng +1 more

Abstract Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.

Scientific Reports•Jul 19, 2017•61 citations

Quantum secret sharing based on quantum information masking

Chen‐Ming Bai, Sujuan Zhang, Lu Liu

Quantum Information Processing•Nov 11, 2022•17 citations
Abstract Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.