Physics – Quantum Physics
Scientific paper
2005-04-11
Phys. Rev. A 78, 022316 (2008)
Physics
Quantum Physics
10 pages, RevTex, 2 figure. v2: title change, cheat-sensitivity added
Scientific paper
10.1103/PhysRevA.78.022316
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we introduce a framework for quantum schemes where Alice commits a string of n bits to Bob in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are two-fold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4log n+O(1) and b=4, which is impossible classically. We furthermore present a cheat-sensitive quantum bit string commitment protocol for which we give an explicit tradeoff between Bob's ability to gain information about the committed string, and the probability of him being detected cheating.
Buhrman Harry
Christandl Matthias
Hayden Patrick
Lo Hoi-Kwong
Wehner Stephanie
No associations
LandOfFree
Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment 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 Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-21361