Graph states for quantum secret sharing
Damian Markham,Barry C. Sanders +1 more
Reads0
Chats0
TLDR
This approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players.Abstract:
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum-information processing system.read more
Citations
More filters
Journal ArticleDOI
Advances in quantum cryptography
Stefano Pirandola,Ulrik L. Andersen,Leonardo Banchi,Mario Berta,Darius Bunandar,Roger Colbeck,Dirk Englund,Tobias Gehring,Cosmo Lupo,Carlo Ottaviani,Jason Pereira,Mohsen Razavi,Jesni Shamsul Shaari,Marco Tomamichel,Vladyslav C. Usenko,Giuseppe Vallone,Paolo Villoresi,Petros Wallden +17 more
TL;DR: This review begins by reviewing protocols of quantum key distribution based on discrete variable systems, and considers aspects of device independence, satellite challenges, and high rate protocols based on continuous variable systems.
Proceedings ArticleDOI
Universal Blind Quantum Computation
TL;DR: The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.
Journal ArticleDOI
Advances in Quantum Cryptography
Stefano Pirandola,Ulrik L. Andersen,Leonardo Banchi,Mario Berta,Darius Bunandar,Roger Colbeck,Dirk Englund,Tobias Gehring,Cosmo Lupo,Carlo Ottaviani,Jason Pereira,Mohsen Razavi,Jesni Shamsul Shaari,Marco Tomamichel,Vladyslav C. Usenko,Giuseppe Vallone,Paolo Villoresi,Petros Wallden +17 more
TL;DR: Quantum cryptography is arguably the fastest growing area in quantum information science as mentioned in this paper, and many quantum key distribution protocols have been proposed, both theoretically and experimentally, over the last few decades.
Journal ArticleDOI
Unconditionally verifiable blind quantum computation
TL;DR: It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Journal ArticleDOI
Quantum cryptography based on Bell's theorem.
TL;DR: Practical application of the generalized Bells theorem in the so-called key distribution process in cryptography is reported, based on the Bohms version of the Einstein-Podolsky-Rosen gedanken experiment andBells theorem is used to test for eavesdropping.
Journal ArticleDOI
Quantum Cryptography
TL;DR: The author revealed that quantum teleportation as “Quantum one-time-pad” had changed from a “classical teleportation” to an “optical amplification, privacy amplification and quantum secret growing” situation.
Journal ArticleDOI
A one-way quantum computer.
TL;DR: A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program.
Journal ArticleDOI
Quantum secret sharing
TL;DR: This work shows how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original qubit.