10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Delayed choice relativistic quantum bit commitment with arbitrarily long commitment time

      Preprint

      Read this article at

      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

          We propose here a two-round relativistic bit commitment scheme where committer commits in the first round and then confirms his/her commitment in the second round. The scheme offers indefinite commitment time where both committer and receiver extract non-locally correlated measurement outcomes during the scheme that can be stored and revealed after arbitrarily long time. We show that the proposed scheme turns out to be a multiparty bit commitment scheme where both parties commit and reveal simultaneously. The multiparty generalization would have applications in business and secure multiparty computations such as managing joint bank account, holding joint shares in stock exchange and blind bidding. The same bit commitment scheme can also be used for the commitment of arbitrarily long classical bit strings. The scheme can be applied efficiently with existing technologies; entanglement is required only for time t=x/c where x is the special distance, can be as small as possible, between the committer and receiver.

          Related collections

          Most cited references14

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

          Unconditionally secure quantum bit commitment is impossible

          The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Is Quantum Bit Commitment Really Possible?

            , (1997)
            We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen type of attack and delaying her measurement until she opens her commitment.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Insecurity of Quantum Secure Computations

              It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller machines from learning the PIN (Personal Identification Number) from the customers' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the so-called quantum bit commitment, the security of quantum two-party computation itself remains unaddressed. Here I answer this question directly by showing that all ``one-sided'' two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure. As corollaries to my results, quantum one-way oblivious password identification and the so-called quantum one-out-of-two oblivious transfer are impossible. I also construct a class of functions that cannot be computed securely in any ``two-sided'' two-party computation. Nevertheless, quantum cryptography remains useful in key distribution and can still provide partial security in ``quantum money'' proposed by Wiesner.
                Bookmark

                Author and article information

                Journal
                13 April 2015
                Article
                1504.03316
                4327dbb8-a358-456e-963f-7333cdcc7997

                http://creativecommons.org/licenses/by-nc-sa/3.0/

                History
                Custom metadata
                11 pages, 2 figures
                quant-ph

                Quantum physics & Field theory
                Quantum physics & Field theory

                Comments

                Comment on this article