Secret Sharing with a Single d-level Quantum System

January 22, 2015 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Armin Tavakoli, Isabelle Herbauts, Marek Zukowski, Mohamed Bourennane arXiv ID 1501.05582 Category quant-ph: Quantum Computing Cross-listed cs.CR Citations 11 Venue arXiv.org Last Checked 5 months ago
Abstract
We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multi-partite GHZ entanglement. We present a multiparty secret sharing protocol which requires only sequential communication of a single quantum d-level system (for any prime d). It has huge advantages in scalabilility and can be realized with the state of the art technology. n be realized with the state of the art technology.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted