4,612 research outputs found
Field test of a practical secure communication network with decoy-state quantum cryptography
We present a secure network communication system that operated with
decoy-state quantum cryptography in a real-world application scenario. The full
key exchange and application protocols were performed in real time among three
nodes, in which two adjacent nodes were connected by approximate 20 km of
commercial telecom optical fiber. The generated quantum keys were immediately
employed and demonstrated for communication applications, including unbreakable
real-time voice telephone between any two of the three communication nodes, or
a broadcast from one node to the other two nodes by using one-time pad
encryption.Comment: 10 pages, 2 figures, 2 tables, typos correcte
Random Numbers Certified by Bell's Theorem
Randomness is a fundamental feature in nature and a valuable resource for
applications ranging from cryptography and gambling to numerical simulation of
physical and biological systems. Random numbers, however, are difficult to
characterize mathematically, and their generation must rely on an unpredictable
physical process. Inaccuracies in the theoretical modelling of such processes
or failures of the devices, possibly due to adversarial attacks, limit the
reliability of random number generators in ways that are difficult to control
and detect. Here, inspired by earlier work on nonlocality based and device
independent quantum information processing, we show that the nonlocal
correlations of entangled quantum particles can be used to certify the presence
of genuine randomness. It is thereby possible to design of a new type of
cryptographically secure random number generator which does not require any
assumption on the internal working of the devices. This strong form of
randomness generation is impossible classically and possible in quantum systems
only if certified by a Bell inequality violation. We carry out a
proof-of-concept demonstration of this proposal in a system of two entangled
atoms separated by approximately 1 meter. The observed Bell inequality
violation, featuring near-perfect detection efficiency, guarantees that 42 new
random numbers are generated with 99% confidence. Our results lay the
groundwork for future device-independent quantum information experiments and
for addressing fundamental issues raised by the intrinsic randomness of quantum
theory.Comment: 10 pages, 3 figures, 16 page appendix. Version as close as possible
to the published version following the terms of the journa
General Impossibility of Group Homomorphic Encryption in the Quantum World
Group homomorphic encryption represents one of the most important building
blocks in modern cryptography. It forms the basis of widely-used, more
sophisticated primitives, such as CCA2-secure encryption or secure multiparty
computation. Unfortunately, recent advances in quantum computation show that
many of the existing schemes completely break down once quantum computers reach
maturity (mainly due to Shor's algorithm). This leads to the challenge of
constructing quantum-resistant group homomorphic cryptosystems.
In this work, we prove the general impossibility of (abelian) group
homomorphic encryption in the presence of quantum adversaries, when assuming
the IND-CPA security notion as the minimal security requirement. To this end,
we prove a new result on the probability of sampling generating sets of finite
(sub-)groups if sampling is done with respect to an arbitrary, unknown
distribution. Finally, we provide a sufficient condition on homomorphic
encryption schemes for our quantum attack to work and discuss its
satisfiability in non-group homomorphic cases. The impact of our results on
recent fully homomorphic encryption schemes poses itself as an open question.Comment: 20 pages, 2 figures, conferenc
- …