Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 217 records · Page 12

Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model

We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in R. Koenig, S. Wehner, and J. Wullschleger [e-print arXiv:0906.1030]. We argue that a technical tool from Koenig et al. suffices to prove security of the known protocols. Whereas the more involved protocol for oblivious transfer from Koenig et al. requires less noise in storage to achieve security, our ''canonical'' protocols have the advantage of being simpler to implement and the security error is easier control. Therefore, our protocols yield higher OT rates for many realistic noise parameters. Furthermore, a proof of security of a direct protocol for password-based identification against general noisy-quantum-storage attacks is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Security proof for cryptographic protocols based only on the monogamy of Bell's inequality violations

We show that monogamy of Bell's inequality violations, which is strictly weaker condition than the no-signaling principle is enough to prove security of quantum key distribution. We derive our results for a whole class of monogamy constraints and generalize our results to any theory that communicating parties may have access to. Some of these theories do not respect the no-signaling principle yet still allow for secure communication. This proves that no signaling is only a sufficient condition for the possibility of secure communication, but not the necessary one. We also present some new qualitative results concerning the security of existing quantum key distribution protocols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous quantum error correction through local operations

We propose local strategies to protect global quantum information. The protocols, which are quantum error-correcting codes for dissipative systems, are based on environment measurements, direct feedback control, and simple encoding of the logical qubits into physical qutrits whose decaying transitions are indistinguishable and equally probable. The simple addition of one extra level in the description of the subsystems allows for local actions to fully and deterministically protect global resources such as entanglement. We present codes for both quantum jump and quantum state diffusion measurement strategies and test them against several sources of inefficiency. The use of qutrits in information protocols suggests further characterization of qutrit-qutrit disentanglement dynamics, which we also give together with simple local environment measurement schemes able to prevent distillability sudden death and even enhance entanglement in situations in which our feedback error correction is not possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-Markovian effects on quantum-communication protocols

We show how, under the influence of non-Markovian environments, two different maximally entangled Bell states give rise to states that have equal classical correlations and the same capacities to violate the Bell-Clauser-Horne-Shimony-Holt inequality, but intriguingly differing usefulness for teleportation and dense coding. We elucidate how different entanglement measures like negativity and concurrence, and two different measures of quantum discord, could account for these behaviors. In particular, we explicitly show how the Ollivier-Zurek measure of discord directly accounts for one state being a better resource for dense coding compared to another. Our study leads to several important issues about these measures of discord.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a ''pearl-necklace'' encoder. Despite their algorithm's theoretical significance as a neat way of representing quantum convolutional codes, it is not well suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm to find a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work is an extension of our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the noncommutative paths through the pearl necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum steganography with noisy quantum channels

Steganography is the technique of hiding secret information by embedding it in a seemingly ''innocent'' message. We present protocols for hiding quantum information by disguising it as noise in a codeword of a quantum error-correcting code. The sender (Alice) swaps quantum information into the codeword and applies a random choice of unitary operation, drawing on a secret random key she shares with the receiver (Bob). Using the key, Bob can retrieve the information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We consider two types of protocols: one in which the hidden quantum information is stored locally in the codeword, and another in which it is embedded in the space of error syndromes. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for specific protocols and examples of error channels. We consider both the case where there is no actual noise in the channel (so that all errors in the codeword result from the deliberate actions of Alice), and the case where the channel is noisy and not controlled by Alice and Bob.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Min-entropy and quantum key distribution: Nonzero key rates for ''small'' numbers of signals

We calculate an achievable secret key rate for quantum key distribution with a finite number of signals by evaluating the quantum conditional min-entropy explicitly. The min-entropy for a classical random variable is the negative logarithm of the maximal value in its probability distribution. The quantum conditional min-entropy can be expressed in terms of the guessing probability, which we calculate for d-dimensional systems. We compare these key rates to previous approaches using the von Neumann entropy and find nonzero key rates for a smaller number of signals. Furthermore, we improve the secret key rates by modifying the parameter estimation step. Both improvements taken together lead to nonzero key rates for only 10{sup 4}-10{sup 5} signals. An interesting conclusion can also be drawn from the additivity of the min-entropy and its relation to the guessing probability: for a set of symmetric tensor product states, the optimal minimum-error discrimination (MED) measurement is the optimal MED measurement on each subsystem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Intrinsic quantum correlations of weak coherent states for quantum communication

Intrinsic quantum correlations of weak coherent states are observed between two parties through a novel detection scheme, which can be used as a supplement to the existence decoy-state Bennett-Brassard 1984 protocol and the differential phase-shift quantum key distribution (DPS-QKD) protocol. In a proof-of-principle experiment, we generate bipartite correlations of weak coherent states using weak local oscillator fields in two spatially separated balanced homodyne detections. We employ a nonlinearity of postmeasurement method to obtain the bipartite correlations from two single-field interferences at individual homodyne measurements. This scheme is then used to demonstrate bits correlations between two parties over a distance of 10 km through a transmission fiber. We believe that the scheme can add another physical layer of security to these protocols for quantum key distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-variable quantum-key-distribution protocols with a non-Gaussian modulation

In this paper, we consider continuous-variable quantum-key-distribution (QKD) protocols which use non-Gaussian modulations. These specific modulation schemes are compatible with very efficient error-correction procedures, hence allowing the protocols to outperform previous protocols in terms of achievable range. In their simplest implementation, these protocols are secure for any linear quantum channels (hence against Gaussian attacks). We also show how the use of decoy states makes the protocols secure against arbitrary collective attacks, which implies their unconditional security in the asymptotic limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-variable quantum key distribution in non-Markovian channels

We address continuous-variable quantum key distribution (QKD) in non-Markovian lossy channels and show how the non-Markovian features may be exploited to enhance security and/or to detect the presence and the position of an eavesdropper along the transmission line. In particular, we suggest a coherent-state QKD protocol which is secure against Gaussian individual attacks based on optimal 1{yields}2 asymmetric cloning machines for arbitrarily low values of the overall transmission line. The scheme relies on specific non-Markovian properties, and cannot be implemented in ordinary Markovian channels characterized by uniform losses. Our results give a clear indication of the potential impact of non-Markovian effects in QKD.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bounds on the information rate of quantum-secret-sharing schemes

An important metric of the performance of a quantum-secret-sharing scheme is its information rate. Beyond the fact that the information rate is upper-bounded by one, very little is known in terms of bounds on the information rate of quantum-secret-sharing schemes. Furthermore, not every scheme can be realized with rate one. In this paper we derive upper bounds for the information rates of quantum-secret-sharing schemes. We show that there exist quantum access structures on n players for which the information rate cannot be better than O((log{sub 2}n)/n). These results are the quantum analogues of the bounds for classical-secret-sharing schemes proved by Csirmaz.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Proof-of-principle experiment of a modified photon-number-splitting attack against quantum key distribution

Any imperfections in a practical quantum key distribution (QKD) system may be exploited by an eavesdropper to collect information about the key without being discovered. We propose a modified photon-number-splitting attack scheme against QKD systems based on weak laser pulses taking advantage of possible multiphoton pulses. Proof-of-principle experiments are demonstrated. The results show that the eavesdropper can get information about the key generated between the legitimate parties without being detected. Since the equivalent attenuation introduced by the eavesdropper for pulses of different average photon numbers are different, the decoy-state method is effective in fighting against this kind of attack. This has also been proven in our experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superactivation, unlockability, and secrecy distribution of bound information

Bound information, a cryptographic classical analog of bound entanglement, is defined as classical secret correlations from which no secret key can be extracted. Its existence was conjectured and shown in a multipartite case. In this work, we provide an example of bound information in a four-partite scenario. Later, using this example, we prove that bound information can be superactivated and moreover unlockable in a finite-copy scenario. We also show that bound entangled states (bound information) can be used to distribute multipartite pure-state entanglements (secret keys).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum measurements of atoms using cavity QED

Generalized quantum measurements are an important extension of projective or von Neumann measurements in that they can be used to describe any measurement that can be implemented on a quantum system. We describe how to realize two nonstandard quantum measurements using cavity QED. The first measurement optimally and unambiguously distinguishes between two nonorthogonal quantum states. The second example is a measurement that demonstrates superadditive quantum coding gain. The experimental tools used are single-atom unitary operations effected by Ramsey pulses and two-atom Tavis-Cummings interactions. We show how the superadditive quantum coding gain is affected by errors in the field-ionization detection of atoms and that even with rather high levels of experimental imperfections, a reasonable amount of superadditivity can still be seen. To date, these types of measurements have been realized only on photons. It would be of great interest to have realizations using other physical systems. This is for fundamental reasons but also since quantum coding gain in general increases with code word length, and a realization using atoms could be more easily scaled than existing realizations using photons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comment on ''Semiquantum-key distribution using less than four quantum states''

For several decades it was believed that information-secure key distribution requires both the sender and receiver to have the ability to generate and/or manipulate quantum states. Earlier, we showed that quantum key distribution in which one party is classical is possible [Boyer, Kenigsberg, and Mor, Phys. Rev. Lett. 99, 140501 (2007)]. A surprising and very nice extension of that result was suggested by Zou, Qiu, Li, Wu, and Li [Phys. Rev. A 79, 052312 (2009)]. Their paper suggests that it is sufficient for the originator of the states (the person holding the quantum technology) to generate just one state. The resulting semiquantum key distribution, which we call here 'quantum key distribution with classical Alice' is indeed completely robust against eavesdropping. However, their proof (that no eavesdropper can get information without being possibly detected) is faulty. We provide here a fully detailed and direct proof of their very important result.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗