Secret sharing based on quantum Fourier transform

Yang, Wei; Huang, Liusheng; Shi, Ronghua; He, Li-Bao

doi:10.1007/s11128-013-0534-8

Cited by 42 publications

(61 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of the transmitted particles of the proposed QSS is t − 1, and that of ref. 7 is n − 1. If t = n , the communication cost of the proposed QSS, that of ref.…”

Section: Resultsmentioning

confidence: 99%

“… 1 in 1999, based on Greenberger-Home-Zeilinger(GHZ) state. Since then, many design and analysis schemes on QSS have been proposed 2 – 20 such as circular QSSs 2 – 4 , dynamic QSSs 5 , 6 , single particle QSSs 7 – 9 , graph state QSSs 10 – 12 , verifiable QSSs 13 – 15 , and other QSSs that may be based on Calderbank–Shor–Steane codes 16 , or based on phase shift operation 17 – 19 , or based on quantum search algorithm 20 .…”

Section: Introductionmentioning

confidence: 99%

“…For the latter, the secret can be reconstructed only if at least t shares are collected. Furthermore, these QSS schemes can be fallen into two categories: 2-level QSS 2 – 6 , 10 , 12 , 17 – 20 and d -level QSS 7 – 9 , 11 depending on the dimension of Hilbert space. For the former, the quantum secret and its shares are all in 2 dimension Hilbert space.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Song

Liu

Deng

et al. 2017

Sci Rep

View full text Add to dashboard Cite

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 Bob 1 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.

show abstract

“…The number of the transmitted particles of the proposed QSS is t − 1, and that of ref. 7 is n − 1. If t = n , the communication cost of the proposed QSS, that of ref.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Song

Liu

Deng

et al. 2017

Sci Rep

View full text Add to dashboard Cite

show abstract

“…In their scheme, an X-basis measurement and classical communication are used to distinguish two orthogonal states and reconstruct the original secret. Some d-level schemes [18,33] were proposed based on Quantum Fourier Transform. The scheme in [18] disguises each share of a secret with true randomness, rather than classical pseudo randomness.…”

Section: Comparisons and Discussionmentioning

confidence: 99%

Verifiable threshold quantum secret sharing with sequential communication

Miao

Hou

et al. 2018

Quantum Inf Process

View full text Add to dashboard Cite

A (t, n) threshold quantum secret sharing (QSS) is proposed based on a single d-level quantum system. It enables the (t, n) threshold structure based on Shamir's secret sharing and simply requires sequential communication in d-level quantum system to recover secret. Besides, the scheme provides a verification mechanism which employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. Moreover, the scheme is scalable in participant number and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new (t, n) threshold QSS schemes based on d-level quantum system from other classical threshold secret sharing.

show abstract

“…The value of the bits (b13.b15) for Delay in Trans attack type of node X is the fine paid by the node and if this fine is above a threshold value the node X is removed from the network. 4. Similarly, if X forwarding rate is optimal then the b12 bit is zero and X need not pay any fine for delay in trans attack type.…”

Section: Detect the Compromised Nodesmentioning

confidence: 99%

Quantum Data Aggregation Using Secret Sharing and Genetic Algorithm

Kim

Madhavi

2020

IEEE Access

View full text Add to dashboard Cite

In the process of data aggregation, intruder nodes and compromised nodes may decrease the system performance. Hence, security plays an important role. Secret sharing is a method to find the compromised nodes. The previous researches in secure data aggregation concentrated on key authentication process and little research is done in N-party secret sharing methods. In this paper, we proposed quantum data aggregation using secret sharing and genetic algorithm, where a node forwards data to its most trusted neighbor only. In the proposed method, a node selects n 1-hop neighbors from a list of its m 1-hop neighbors, which well behaved over a period and forwards data to the most trusted amongst them. We simulated quantum teleportation using SimulaQron tool for establishing secure communication. However secured is the communication channel the compromised nodes may decrease the system performance by exposing network to malicious activities. Each node creates n shares of a secret and forwards a share on a secured quantum channel to the n 1-hop neighbors in such a way that from any t neighbors share(t

show abstract

Secret sharing based on quantum Fourier transform

Cited by 42 publications

References 19 publications

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

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

Verifiable threshold quantum secret sharing with sequential communication

Quantum Data Aggregation Using Secret Sharing and Genetic Algorithm

Contact Info

Product

Resources

About