Access the full text.
Sign up today, get DeepDyve free for 14 days.
D Bouwmeester, J-W Pan, K Mattle, M Eibl, H Weinfurter, A Zeilinger (1997)
Experimental quantum teleportationNature, 390
R Cleve, D Gottesman, H-K Lo (1999)
How to share a quantum secretPhys. Rev. Lett., 83
S Sazim, I Chakrabarty (2013)
A study of teleportation and super dense coding capacity in remote entanglement distributionEur. Phys. J. D, 67
Su-Juan Qin, Fei Gao, Qiao-Yan Wen, Fu-Chen Zhu (2007)
Cryptanalysis of the Hillery-Buek-Berthiaume quantum secret-sharing protocolPhys. Rev. A, 76
C Schmid, P Trojek, S Gaertner, M Bourennane, C Kurtsiefer, M Zukowski, H Weinfurter (2006)
Experimental quantum secret sharingFortschritte der Physik, 54
Tian-Yin Wang, Yan-Ping Li (2013)
Cryptanalysis of dynamic quantum secret sharingQuantum Inf. Process., 12
CH Bennett, G Brassard, C Crepeau, R Jozsa, A Peres, WK Wootters (1993)
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channelsPhys. Rev. Lett., 70
D Markham, BC Sanders (2008)
Graph states for quantum secret sharingPhys. Rev. A, 78
AM Lance, T Symul, WP Bowen, BC Sanders, PK Lam (2004)
Tripartite quantum state sharingPhys. Rev. Lett., 92
S Bagherinezhad, V Karimipour (2003)
Quantum secret sharing based on reusable Greenberger-Horne-Zeilinger states as secure carriersPhys. Rev. A, 67
SB Zheng (2006)
Splitting quantum information via W statesPhys. Rev. A, 74
M Hillery, V Buzek, A Berthiaume (1999)
Quantum secret sharingPhys. Rev. A, 59
S Adhikari, I Chakrabarty, P Agrawal (2012)
Probabilistic secret sharing through noise quantum channelQuantum Inf. Comput., 12
S Bandyopadhyay (2000)
Teleportation and secret sharing with pure entangled statesPhys. Rev. A, 62
A Keet, B Fortescue, D Markham, BC Sanders (2010)
Quantum secret sharing with qudit graph statesPhys. Rev. A, 82
W Tittel, H Zbinden, N Gisin (2001)
Experimental demonstration of quantum secret sharingPhys. Rev. A, 63
Q Li, WH Chan, D-Y Long (2010)
Semiquantum secret sharing using entangled statesPhys. Rev. A, 82
A Karlsson, M Koashi, N Imoto (1999)
Quantum entanglement for secret sharing and secret splittingPhys. Rev. A, 59
Tian-Yin Wang, Qiao-Yan Wen (2011)
Security of a kind of quantum secret sharing with single photonsQuantum Inf. Comput., 11
K Lemr, K Bartkiewicz, A Cernoch, J Soubusta (2013)
Resource-efficient linear-optical quantum routerPhys. Rev. A, 87
K Lemr, A Cernoch (2013)
Linear-optical programmable quantum routerOpt. Commun., 300
N Gisin, G Ribordy, W Tittel, H Zbinden (2002)
Quantum cryptographyRev. Mod. Phys., 74
C Schmid, P Trojek, M Bourennane, C Kurtsiefer, M Zukowski, H Weinfurter (2005)
Experimental single qubit quantum secret sharingPhys. Rev. Lett., 95
A Einstein, B Podolsky, N Rosen (1935)
Can quantum-mechanical description of physical reality be considered complete?Phys. Rev., 47
G Gordon, G Rigolin (2006)
Generalized quantum-state sharingPhys. Rev. A, 73
GD Paparo, M Mueller, F Comellas, MA Martin-Delgado (2013)
Quantum Google in a complex networkSci. Rep., 3
J Bogdanski, N Rafiei, M Bourennane (2008)
Experimental quantum secret sharing using telecommunication fiberPhys. Rev. A, 78
In extant quantum secret sharing protocols, once the secret is shared in a quantum network (qnet) it cannot be retrieved, even if the dealer wishes that his/her secret no longer be available in the network. For instance, if the dealer is part of the two qnets, say $${\mathcal {Q}}_1$$ Q 1 and $${\mathcal {Q}}_2$$ Q 2 and he/she subsequently finds that $${\mathcal {Q}}_2$$ Q 2 is more reliable than $${\mathcal {Q}}_1$$ Q 1 , he/she may wish to transfer all her secrets from $${\mathcal {Q}}_1$$ Q 1 to $${\mathcal {Q}}_2$$ Q 2 . Known protocols are inadequate to address such a revocation. In this work we address this problem by designing a protocol that enables the source/dealer to bring back the information shared in the network, if desired. Unlike classical revocation, the no-cloning theorem automatically ensures that the secret is no longer shared in the network. The implications of our results are multi-fold. One interesting implication of our technique is the possibility of routing qubits in asynchronous qnets. By asynchrony we mean that the requisite data/resources are intermittently available (but not necessarily simultaneously) in the qnet. For example, we show that a source S can send quantum information to a destination R even though (a) S and R share no quantum resource, (b) R’s identity is unknown to S at the time of sending the message, but is subsequently decided, (c) S herself can be R at a later date and/or in a different location to bequeath her information (‘backed-up’ in the qnet) and (d) importantly, the path chosen for routing the secret may hit a dead end due to resource constraints, congestion, etc., (therefore the information needs to be back-tracked and sent along an alternate path). Another implication of our technique is the possibility of using insecure resources. For instance, if the quantum memory within an organization is insufficient, it may safely store (using our protocol) its private information with a neighboring organization without (a) revealing critical data to the host and (b) losing control over retrieving the data. Putting the two implications together, namely routing and secure storage, it is possible to envision applications like quantum mail (qmail) as an outsourced service.
Quantum Information Processing – Springer Journals
Published: Sep 14, 2015
Access the full text.
Sign up today, get DeepDyve free for 14 days.