Device Independent Quantum Secret Sharing in Arbitrary Even Dimension

Abstract

We present a device independent quantum secret sharing scheme in arbitrary even dimension. We propose a $d$-dimensional $N$-partite linear game, utilizing a generic multipartite higher dimensional Bell inequality, a generalization of Mermin's inequality in the higher dimension. Probability to win this linear game defines the device independence test of the proposed scheme. The security is proved under causal independence of measurement devices and it is based on the polygamy property of entanglement. By defining ${\epsilon }_{cor}$-correctness and ${\epsilon }^c$-completeness for a quantum secret sharing scheme, we have also shown that the proposed scheme is ${\epsilon }_{cor}$-correct and ${\epsilon }^c$-complete.

8 pages; Some typos corrected

References in corpus (9)

• Device-independent security of quantum cryptography against collective attacks
• Device-independent quantum key distribution secure against collective attacks
• Secure device-independent quantum key distribution with causally independent measurement devices
• Quantum secret sharing with qudit graph states
• Efficient quantum key distribution secure against no-signalling eavesdroppers
• Secrecy extraction from no-signalling correlations
• Fully Distrustful Quantum Cryptography
• Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
• Multi-setting Bell inequality for qudits

Cited by in corpus (1)

• Non-Markovian quantum dynamics: What does it mean?