Papers
Topics
Authors
Recent
Search
2000 character limit reached

Secret Sharing with a Single d-level Quantum System

Published 22 Jan 2015 in quant-ph and cs.CR | (1501.05582v2)

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.

Citations (11)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.