9,801 research outputs found
Reconciliation of a Quantum-Distributed Gaussian Key
Two parties, Alice and Bob, wish to distill a binary secret key out of a list
of correlated variables that they share after running a quantum key
distribution protocol based on continuous-spectrum quantum carriers. We present
a novel construction that allows the legitimate parties to get equal bit
strings out of correlated variables by using a classical channel, with as few
leaked information as possible. This opens the way to securely correcting
non-binary key elements. In particular, the construction is refined to the case
of Gaussian variables as it applies directly to recent continuous-variable
protocols for quantum key distribution.Comment: 8 pages, 4 figures. Submitted to the IEEE for possible publication.
Revised version to improve its clarit
Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity
In the wiretap channel setting, one aims to get information-theoretic privacy
of communicated data based only on the assumption that the channel from sender
to receiver is noisier than the one from sender to adversary. The secrecy
capacity is the optimal (highest possible) rate of a secure scheme, and the
existence of schemes achieving it has been shown. For thirty years the ultimate
and unreached goal has been to achieve this optimal rate with a scheme that is
polynomial-time. (This means both encryption and decryption are proven
polynomial time algorithms.) This paper finally delivers such a scheme. In fact
it does more. Our scheme not only meets the classical notion of security from
the wiretap literature, called MIS-R (mutual information security for random
messages) but achieves the strictly stronger notion of semantic security, thus
delivering more in terms of security without loss of rate
On the Construction of Polar Codes for Achieving the Capacity of Marginal Channels
Achieving security against adversaries with unlimited computational power is
of great interest in a communication scenario. Since polar codes are capacity
achieving codes with low encoding-decoding complexity and they can approach
perfect secrecy rates for binary-input degraded wiretap channels in symmetric
settings, they are investigated extensively in the literature recently. In this
paper, a polar coding scheme to achieve secrecy capacity in non-symmetric
binary input channels is proposed. The proposed scheme satisfies security and
reliability conditions. The wiretap channel is assumed to be stochastically
degraded with respect to the legitimate channel and message distribution is
uniform. The information set is sent over channels that are good for Bob and
bad for Eve. Random bits are sent over channels that are good for both Bob and
Eve. A frozen vector is chosen randomly and is sent over channels bad for both.
We prove that there exists a frozen vector for which the coding scheme
satisfies reliability and security conditions and approaches the secrecy
capacity. We further empirically show that in the proposed scheme for
non-symmetric binary-input discrete memoryless channels, the equivocation rate
achieves its upper bound in the whole capacity-equivocation region
- …