Conference Key Agreement and Quantum Sharing of Classical Secrets with Noisy GHZ States

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, to appear in Proc. 2005 IEEE International Symposium on Information Theory (ISIT 2005, Adelaide, Australia)

Scientific paper

10.1109/ISIT.2005.1523616

We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph states. We then consider the applications of our distillation schemes for two cryptographic tasks--namely, (a) conference key agreement and (b) quantum sharing of classical secrets. In particular, we construct ``prepare-and-measure'' protocols. Also we study the yield of those protocols and the threshold value of the fidelity above which the protocols can function securely. Surprisingly, our protocols will function securely even when the initial state does not violate the standard Bell-inequalities for GHZ states. Experimental realization involving only bi-partite entanglement is also suggested.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Conference Key Agreement and Quantum Sharing of Classical Secrets with Noisy GHZ States 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 Conference Key Agreement and Quantum Sharing of Classical Secrets with Noisy GHZ States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conference Key Agreement and Quantum Sharing of Classical Secrets with Noisy GHZ States will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-462311

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.