File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1103/PhysRevA.78.022316
- Scopus: eid_2-s2.0-49549102864
- WOS: WOS:000259263400052
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment
Title | Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment |
---|---|
Authors | |
Issue Date | 2008 |
Citation | Physical Review A - Atomic, Molecular, and Optical Physics, 2008, v. 78, n. 2, article no. 022316 How to Cite? |
Abstract | Unconditionally secure nonrelativistic 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 twofold: 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=4 log2 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. © 2008 The American Physical Society. |
Persistent Identifier | http://hdl.handle.net/10722/285628 |
ISSN | 2014 Impact Factor: 2.808 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Buhrman, Harry | - |
dc.contributor.author | Christandl, Matthias | - |
dc.contributor.author | Hayden, Patrick | - |
dc.contributor.author | Lo, Hoi Kwong | - |
dc.contributor.author | Wehner, Stephanie | - |
dc.date.accessioned | 2020-08-18T04:56:14Z | - |
dc.date.available | 2020-08-18T04:56:14Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Physical Review A - Atomic, Molecular, and Optical Physics, 2008, v. 78, n. 2, article no. 022316 | - |
dc.identifier.issn | 1050-2947 | - |
dc.identifier.uri | http://hdl.handle.net/10722/285628 | - |
dc.description.abstract | Unconditionally secure nonrelativistic 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 twofold: 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=4 log2 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. © 2008 The American Physical Society. | - |
dc.language | eng | - |
dc.relation.ispartof | Physical Review A - Atomic, Molecular, and Optical Physics | - |
dc.title | Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1103/PhysRevA.78.022316 | - |
dc.identifier.scopus | eid_2-s2.0-49549102864 | - |
dc.identifier.volume | 78 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | article no. 022316 | - |
dc.identifier.epage | article no. 022316 | - |
dc.identifier.eissn | 1094-1622 | - |
dc.identifier.isi | WOS:000259263400052 | - |
dc.identifier.issnl | 1050-2947 | - |