6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Secure Key from Bound Entanglement

      Read this article at

      ScienceOpenPublisherPubMed
      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 characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states that have less distillable private keys than the entanglement cost of the state. In general, the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of states which have Bell states correlated to separable hiding states. We also describe a technique for finding states exhibiting irreversibility in entanglement distillation.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          Computable measure of entanglement

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Mixed-state entanglement and quantum error correction

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Simple Proof of Security of the BB84 Quantum Key Distribution Protocol

              We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement purification based protocol uses Calderbank-Shor-Steane codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol.
                Bookmark

                Author and article information

                Journal
                PRLTAO
                Physical Review Letters
                Phys. Rev. Lett.
                American Physical Society (APS)
                0031-9007
                1079-7114
                April 2005
                April 26 2005
                : 94
                : 16
                Article
                10.1103/PhysRevLett.94.160502
                15904201
                c4350d72-c0ca-4053-9d3a-76f453b4fd39
                © 2005

                http://link.aps.org/licenses/aps-default-license

                History

                Comments

                Comment on this article