Classical versus Quantum Graph-based Secret Sharing

Details Classical versus Quantum Graph-based Secret Sharing Classical versus Quantum Graph-based Secret Sharing

2011-09-22

arxiv.org/abs/1109.4731v1

Physics

Quantum Physics

8 pages, 1 figure

Scientific paper

We study a simple graph-based classical secret sharing scheme: every player's share consists of a random key together with the encryption of the secret with the keys of his neighbours. A characterisation of the authorised and forbidden sets of players is given. Moreover, we show that this protocol is equivalent to the graph state quantum secret sharing (GS-QSS) schemes when the secret is classical. When the secret is an arbitrary quantum state, a set of players is authorised for a GS-QSS scheme if and only if, for the corresponding simple classical graph-based protocol, the set is authorised and its complement set is not.

Affiliated with

Also associated with

No associations

Rating

Classical versus Quantum Graph-based Secret Sharing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classical versus Quantum Graph-based Secret Sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical versus Quantum Graph-based Secret Sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262484