6,581 research outputs found
Key Distillation and the Secret-Bit Fraction
We consider distillation of secret bits from partially secret noisy
correlations P_ABE, shared between two honest parties and an eavesdropper. The
most studied distillation scenario consists of joint operations on a large
number of copies of the distribution (P_ABE)^N, assisted with public
communication. Here we consider distillation with only one copy of the
distribution, and instead of rates, the 'quality' of the distilled secret bits
is optimized, where the 'quality' is quantified by the secret-bit fraction of
the result. The secret-bit fraction of a binary distribution is the proportion
which constitutes a secret bit between Alice and Bob. With local operations and
public communication the maximal extractable secret-bit fraction from a
distribution P_ABE is found, and is denoted by Lambda[P_ABE]. This quantity is
shown to be nonincreasing under local operations and public communication, and
nondecreasing under eavesdropper's local operations: it is a secrecy monotone.
It is shown that if Lambda[P_ABE]>1/2 then P_ABE is distillable, thus providing
a sufficient condition for distillability. A simple expression for
Lambda[P_ABE] is found when the eavesdropper is decoupled, and when the honest
parties' information is binary and the local operations are reversible.
Intriguingly, for general distributions the (optimal) operation requires local
degradation of the data.Comment: 12 page
Round Complexity in the Local Transformations of Quantum and Classical States
A natural operational paradigm for distributed quantum and classical
information processing involves local operations coordinated by multiple rounds
of public communication. In this paper we consider the minimum number of
communication rounds needed to perform the locality-constrained task of
entanglement transformation and the analogous classical task of secrecy
manipulation. Specifically we address whether bipartite mixed entanglement can
always be converted into pure entanglement or whether unsecure classical
correlations can always be transformed into secret shared randomness using
local operations and a bounded number of communication exchanges. Our main
contribution in this paper is an explicit construction of quantum and classical
state transformations which, for any given , can be achieved using
rounds of classical communication exchanges but no fewer. Our results reveal
that highly complex communication protocols are indeed necessary to fully
harness the information-theoretic resources contained in general quantum and
classical states. The major technical contribution of this manuscript lies in
proving lower bounds for the required number of communication exchanges using
the notion of common information and various lemmas built upon it. We propose a
classical analog to the Schmidt rank of a bipartite quantum state which we call
the secrecy rank, and we show that it is a monotone under stochastic local
classical operations.Comment: Submitted to QIP 2017. Proof strategies have been streamlined and
differ from the submitted versio
Device-independent quantum key distribution with single-photon sources
Device-independent quantum key distribution protocols allow two honest users
to establish a secret key with minimal levels of trust on the provider, as
security is proven without any assumption on the inner working of the devices
used for the distribution. Unfortunately, the implementation of these protocols
is challenging, as it requires the observation of a large Bell-inequality
violation between the two distant users. Here, we introduce novel photonic
protocols for device-independent quantum key distribution exploiting
single-photon sources and heralding-type architectures. The heralding process
is designed so that transmission losses become irrelevant for security. We then
show how the use of single-photon sources for entanglement distribution in
these architectures, instead of standard entangled-pair generation schemes,
provides significant improvements on the attainable key rates and distances
over previous proposals. Given the current progress in single-photon sources,
our work opens up a promising avenue for device-independent quantum key
distribution implementations.Comment: 20 pages (9 + appendices and bibliography), 5 figures, 1 tabl
Reexamination of Quantum Bit Commitment: the Possible and the Impossible
Bit commitment protocols whose security is based on the laws of quantum
mechanics alone are generally held to be impossible. In this paper we give a
strengthened and explicit proof of this result. We extend its scope to a much
larger variety of protocols, which may have an arbitrary number of rounds, in
which both classical and quantum information is exchanged, and which may
include aborts and resets. Moreover, we do not consider the receiver to be
bound to a fixed "honest" strategy, so that "anonymous state protocols", which
were recently suggested as a possible way to beat the known no-go results are
also covered. We show that any concealing protocol allows the sender to find a
cheating strategy, which is universal in the sense that it works against any
strategy of the receiver. Moreover, if the concealing property holds only
approximately, the cheat goes undetected with a high probability, which we
explicitly estimate. The proof uses an explicit formalization of general two
party protocols, which is applicable to more general situations, and a new
estimate about the continuity of the Stinespring dilation of a general quantum
channel. The result also provides a natural characterization of protocols that
fall outside the standard setting of unlimited available technology, and thus
may allow secure bit commitment. We present a new such protocol whose security,
perhaps surprisingly, relies on decoherence in the receiver's lab.Comment: v1: 26 pages, 4 eps figures. v2: 31 pages, 5 eps figures; replaced
with published version; title changed to comply with puzzling Phys. Rev.
regulations; impossibility proof extended to protocols with infinitely many
rounds or a continuous communication tree; security proof of decoherence
monster protocol expanded; presentation clarifie
Isogeny-based post-quantum key exchange protocols
The goal of this project is to understand and analyze the supersingular isogeny Diffie Hellman (SIDH), a post-quantum key exchange protocol which security lies on the isogeny-finding problem between supersingular elliptic curves. In order to do so, we first introduce the reader to cryptography focusing on key agreement protocols and motivate the rise of post-quantum cryptography as a necessity with the existence of the model of quantum computation. We review some of the known attacks on the SIDH and finally study some algorithmic aspects to understand how the protocol can be implemented
- …