Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum cryptography”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Impossibility of secure two-party classical computation

We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal bounded-error strategies for projective measurements in nonorthogonal-state discrimination

Research in nonorthogonal-state discrimination has given rise to two conventional optimal strategies: unambiguous discrimination (UD) and minimum error discrimination. We explore the experimentally relevant range of measurement strategies between the two, where the rate of inconclusive results is minimized for a bounded-error rate. We first provide some constraints on the problem that apply to generalized measurements [positive-operator-valued measurements (POVMs)]. We then provide the theory for the optimal projective measurement in this range. Through analytical and numerical results we investigate this family of projective, bounded-error strategies and compare it to the POVM family as well as to experimental implementation of UD using POVMs. We also discuss a possible application of these bounded-error strategies to quantum key distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiparty quantum-key-distribution protocol without use of entanglement

We propose a quantum-key-distribution protocol that enables three parties to agree at once on a shared common random bit string in the presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cryptanalysis of the Hillery-Buzek-Berthiaume quantum secret-sharing protocol

The participant attack is the most serious threat for quantum secret-sharing protocols. We present a method to analyze the security of quantum secret-sharing protocols against this kind of attack taking the scheme of Hillery, Buzek, and Berthiaume (HBB) [Phys. Rev. A 59, 1829 (1999)] as an example. By distinguishing between two mixed states, we derive the necessary and sufficient conditions under which a dishonest participant can attain all the information without introducing any error, which shows that the HBB protocol is insecure against dishonest participants. It is easy to verify that the attack scheme of Karlsson, Koashi, and Imoto [Phys. Rev. A 59, 162 (1999)] is a special example of our results. To demonstrate our results further, we construct an explicit attack scheme according to the necessary and sufficient conditions. Our work completes the security analysis of the HBB protocol, and the method presented may be useful for the analysis of other similar protocols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-way quantum key distribution at telecommunication wavelength

We report on a quantum key distribution effected with a two-way deterministic protocol over a standard telecommunication fiber. Despite the common belief of a prohibitive loss rate for such a scheme, our results show its feasibility on distances of few tenths of kilometers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-variable quantum key distribution with noisy coherent states

An excess noise in coherent-state preparation can prevent secure key distribution through lossy channel. The feasible single-copy and multicopy linear optical methods are proposed to purify the prepared state. The single-copy method always sufficiently reduces the excess noise to obtain the key secure against both the individual and collective attacks even through any lossy channel. To increase the secure key rate, two feasible applications of the multicopy linear optical purification are proposed. As a result, maximal secure key rate achievable through a given lossy channel can be approached.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three criteria for quantum random-number generators based on beam splitters

We propose three criteria for the generation of random digital strings from quantum beam splitters: (i) three or more mutually exclusive outcomes corresponding to the invocation of three- and higher-dimensional Hilbert spaces, (ii) the mandatory use of pure states in conjugated bases for preparation and detection, and (iii) the use of entangled singlet (unique) states for elimination of bias.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Arbitrated quantum signature scheme using Bell states

In an arbitrated quantum signature scheme, the signatory signs the message and the receiver verifies the signature's validity with the assistance of the arbitrator. We present an arbitrated quantum signature scheme using two-particle entangled Bell states similar to the previous scheme using three-particle entangled Greenberger-Horne-Zeilinger states [G. H. Zeng and C. H. Keitel, Phys. Rev. A 65, 042312 (2002)]. The proposed scheme can preserve the merits in the original scheme while providing a higher efficiency in transmission and reducing the complexity of implementation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relationship between quantum repeating devices and quantum seals

It is revealed that quantum repeating devices and quantum seals have a very close relationship, thus the theory in one field can be applied to the other. Consequently, it is shown that the fidelity bounds and optimality of quantum repeating devices for decoding quantum information can be violated when they are used for decoding classical information from quantum states and the security bounds for protocols sealing quantum data exist.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Semi-device-independent security of one-way quantum key distribution

By testing nonlocality, the security of entanglement-based quantum key distribution (QKD) can be enhanced to being ''device-independent.'' Here we ask whether such a strong form of security could also be established for one-way (prepare and measure) QKD. While fully device-independent security is impossible, we show that security can be guaranteed against individual attacks in a semi-device-independent scenario. In the latter, the devices used by the trusted parties are noncharacterized, but the dimensionality of the quantum systems used in the protocol is assumed to be bounded. Our security proof relies on the analogies between one-way QKD, dimension witnesses, and random-access codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weaker entanglement between two parties guarantees stronger entanglement with a third party

The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are weakly entangled, then either of them is generally strongly entangled with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is an effective way to this longstanding problem compared to the means by stochastic local operations and classical communications. We also systematically indicate the structure of the classified states and generate them.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints

We define the task of quantum tagging, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is unbounded. We define simple security models for this task and briefly discuss alternatives. We illustrate the pitfalls of naive quantum cryptographic reasoning in this context by describing several protocols which at first sight appear unconditionally secure but which, as we show, can in fact be broken by teleportation-based attacks. We also describe some protocols which cannot be broken by these specific attacks, but do not prove they are unconditionally secure. We review the history of quantum tagging protocols, and show that protocols previously proposed by Malaney and Chandran et al. are provably insecure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cryptanalysis of the arbitrated quantum signature protocols

As a new model for signing quantum messages, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver, Bob, can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender, Alice, can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics on AQS protocols that can be studied in future.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cloning of a quantum measurement

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1{yields}2 learning of the measurement, otherwise the task is called 1{yields}2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension d of the Hilbert space. For 1{yields}2 cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for 1{yields}2 learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long-distance continuous-variable quantum key distribution with a Gaussian modulation

We designed high-efficiency error correcting codes allowing us to extract an errorless secret key in a continuous-variable quantum key distribution (CVQKD) protocol using a Gaussian modulation of coherent states and a homodyne detection. These codes are available for a wide range of signal-to-noise ratios on an additive white Gaussian noise channel with a binary modulation and can be combined with a multidimensional reconciliation method proven secure against arbitrary collective attacks. This improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about 10{sup -3} bit per pulse at a distance of 120 km for reasonable physical parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design of additive quantum codes via the code-word-stabilized framework

We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or nonadditive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cyclic stabilizer codes. We present several families of simple stabilizer codes with relatively good parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement-assisted codeword stabilized quantum codes

Entangled qubits can increase the capacity of quantum error-correcting codes based on stabilizer codes. In addition, by using entanglement quantum stabilizer codes can be construct from classical linear codes that do not satisfy the dual-containing constraint. We show that it is possible to construct both additive and nonadditive quantum codes using the codeword stabilized quantum code framework. Nonadditive codes may offer improved performance over the more common stabilizer codes. Like other entanglement-assisted codes, the encoding procedure acts only on the qubits on Alice's side, and only these qubits are assumed to pass through the channel. However, errors in the codeword stabilized quantum code framework give rise to effective Z errors on Bob's side. We use this scheme to construct entanglement-assisted nonadditive quantum codes, in particular, ((5,16,2;1)) and ((7,4,5;4)) codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗