For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
17
views
5
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      297
      similar
       All similar
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment

      Preprint
      Author(s):
      Publication date Created:

      Read this article at

      ScienceOpenPublisherArXiv
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Quantum protocols for coin-flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in the bias (or bit-commitment protocols with linear cheat detection) because these can be composed to produce strong coin-flipping with arbitrarily small bias. On the other hand, it appears that quadratic cheat detection cannot be composed in series to obtain even weak coin-flipping with arbitrarily small bias.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Degrees of concealment and bindingness in quantum bit commitment protocols

          T Rudolph, R. Spekkens (2001)
          Although it is impossible for a bit commitment protocol to be both arbitrarily concealing and arbitrarily binding, it is possible for it to be both partially concealing and partially binding. This means that Bob cannot, prior to the beginning of the unveiling phase, find out everything about the bit committed, and Alice cannot, through actions taken after the end of the commitment phase, unveil whatever bit she desires. We determine upper bounds on the degrees of concealment and bindingness that can be achieved simultaneously in any bit commitment protocol, although it is unknown whether these can be saturated. We do, however, determine the maxima of these quantities in a restricted class of bit commitment protocols, namely those wherein all the systems that play a role in the commitment phase are supplied by Alice. We show that these maxima can be achieved using a protocol that requires Alice to prepare a pair of systems in an entangled state, submit one of the pair to Bob at the commitment phase, and the other at the unveiling phase. Finally, we determine the form of the trade-off that exists between the degree of concealment and the degree of bindingness given various assumptions about the purity and dimensionality of the states used in the protocol.
          Article 0 comments Cited 32 times – based on 0 reviews
          Preprint
               Review now
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible

            H. Chau, H. Lo (1997)
            There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy generally requires a quantum computer. We emphasize the generality of this ``no-go theorem'': Unconditionally secure bit commitment schemes based on quantum mechanics---fully quantum, classical or quantum but with measurements---are all ruled out by this result. Since bit commitment is a useful primitive for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called ``post-cold-war'' applications. We also show that ideal quantum coin tossing is impossible because of the EPR attack. This no-go theorem for ideal quantum coin tossing may help to shed some lights on the possibility of non-ideal protocols.
            Article 0 comments Cited 32 times – based on 0 reviews
            Preprint
                 Review now
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Cheat Sensitive Quantum Bit Commitment

              Lucien Hardy, Adrian Kent (1999)
              We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We give an example of an unconditionally secure cheat sensitive non-relativistic bit commitment protocol which uses quantum information to implement a task which is classically impossible; we also describe a simple relativistic protocol.
              Article 0 comments Cited 13 times – based on 0 reviews
              Preprint
                   Review now
                Bookmark
                All references

                Author and article information

                Journal
                Publication date Created: 24 November 2003
                Publication date Updated: 2004-10-02
                Article
                DOI: 10.1103/PhysRevA.70.032312
                ArXiV ID: quant-ph/0311165
                SO-VID: 9e5aeb7a-6ec9-45ae-829b-62c83094bd86
                History
                Custom metadata
                Report No CALT-68-2464
                Journal reference Phys. Rev. A 70, 032312 (2004)
                Comments 7 pages, REVTeX 4 (minor corrections in v2)
                Categories quant-ph

                Data availability:

                Comments

                Comment on this article