31,696 research outputs found
High Entropy Random Selection Protocols
In this paper, we construct protocols for two parties that do not trust each other,
to generate random variables with high Shannon entropy.
We improve known bounds for the trade off between the number of rounds, length of communication and the entropy of the outcome
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a common string among all the strings of length n. We want the protocol to have the property that the output distribution has high Shannon entropy or high min entropy, even when one of the two parties is dishonest and deviates from the protocol. We develop protocols that achieve high, close to n, Shannon entropy and simultaneously min entropy close to n/2. In the literature the randomness guarantee is usually expressed in terms of “resilience”. The notion of Shannon entropy is not directly comparable to that of resilience, but we establish a connection between the two that allows us to compare our protocols with the existing ones. We construct an explicit protocol that yields Shannon entropy n- O(1) and has O(log ∗n) rounds, improving over the protocol of Goldreich et al. (SIAM J Comput 27: 506–544, 1998) that also achieves this entropy but needs O(n) rounds. Both these protocols need O(n2) bits of communication. Next we reduce the number of rounds and the length of communication in our protocols. We show the existence, non-explicitly, of a protocol that has 6 rounds, O(n) bits of communication and yields Shannon entropy n- O(log n) and min entropy n/ 2 - O(log n). Our protocol achieves the same Shannon entropy bound as, also non-explicit, protocol of Gradwohl et al. (in: Dwork (ed) Advances in Cryptology—CRYPTO ‘06, 409–426, Technical Report , 2006), however achieves much higher min entropy: n/ 2 - O(log n) versus O(log n). Finally we exhibit a very simple 3-round explicit “geometric” protocol with communication length O(n). We connect the security parameter of this protocol with the well studied Kakey
A Generic Security Proof for Quantum Key Distribution
Quantum key distribution allows two parties, traditionally known as Alice and
Bob, to establish a secure random cryptographic key if, firstly, they have
access to a quantum communication channel, and secondly, they can exchange
classical public messages which can be monitored but not altered by an
eavesdropper, Eve. Quantum key distribution provides perfect security because,
unlike its classical counterpart, it relies on the laws of physics rather than
on ensuring that successful eavesdropping would require excessive computational
effort. However, security proofs of quantum key distribution are not trivial
and are usually restricted in their applicability to specific protocols. In
contrast, we present a general and conceptually simple proof which can be
applied to a number of different protocols. It relies on the fact that a
cryptographic procedure called privacy amplification is equally secure when an
adversary's memory for data storage is quantum rather than classical.Comment: Analysis of B92 protocol adde
The influence of feature selection methods on accuracy, stability and interpretability of molecular signatures
Motivation: Biomarker discovery from high-dimensional data is a crucial
problem with enormous applications in biology and medicine. It is also
extremely challenging from a statistical viewpoint, but surprisingly few
studies have investigated the relative strengths and weaknesses of the plethora
of existing feature selection methods. Methods: We compare 32 feature selection
methods on 4 public gene expression datasets for breast cancer prognosis, in
terms of predictive performance, stability and functional interpretability of
the signatures they produce. Results: We observe that the feature selection
method has a significant influence on the accuracy, stability and
interpretability of signatures. Simple filter methods generally outperform more
complex embedded or wrapper methods, and ensemble feature selection has
generally no positive effect. Overall a simple Student's t-test seems to
provide the best results. Availability: Code and data are publicly available at
http://cbio.ensmp.fr/~ahaury/
Trusted Noise in Continuous-Variable Quantum Key Distribution: a Threat and a Defense
We address the role of the phase-insensitive trusted preparation and
detection noise in the security of a continuous-variable quantum key
distribution, considering the Gaussian protocols on the basis of coherent and
squeezed states and studying them in the conditions of Gaussian lossy and noisy
channels. The influence of such a noise on the security of Gaussian quantum
cryptography can be crucial, even despite the fact that a noise is trusted, due
to a strongly nonlinear behavior of the quantum entropies involved in the
security analysis. We recapitulate the known effect of the preparation noise in
both direct and reverse-reconciliation protocols, as well as the detection
noise in the reverse-reconciliation scenario. As a new result, we show the
negative role of the trusted detection noise in the direct-reconciliation
scheme. We also describe the role of the trusted preparation or detection noise
added at the reference side of the protocols in improving the robustness of the
protocols to the channel noise, confirming the positive effect for the
coherent-state reverse-reconciliation protocol. Finally, we address the
combined effect of trusted noise added both in the source and the detector.Comment: 25 pages, 9 figure
Distributing Secret Keys with Quantum Continuous Variables: Principle, Security and Implementations
The ability to distribute secret keys between two parties with
information-theoretic security, that is, regardless of the capacities of a
malevolent eavesdropper, is one of the most celebrated results in the field of
quantum information processing and communication. Indeed, quantum key
distribution illustrates the power of encoding information on the quantum
properties of light and has far reaching implications in high-security
applications. Today, quantum key distribution systems operate in real-world
conditions and are commercially available. As with most quantum information
protocols, quantum key distribution was first designed for qubits, the
individual quanta of information. However, the use of quantum continuous
variables for this task presents important advantages with respect to qubit
based protocols, in particular from a practical point of view, since it allows
for simple implementations that require only standard telecommunication
technology. In this review article, we describe the principle of
continuous-variable quantum key distribution, focusing in particular on
protocols based on coherent states. We discuss the security of these protocols
and report on the state-of-the-art in experimental implementations, including
the issue of side-channel attacks. We conclude with promising perspectives in
this research field.Comment: 21 pages, 2 figures, 1 tabl
Web-Scale Training for Face Identification
Scaling machine learning methods to very large datasets has attracted
considerable attention in recent years, thanks to easy access to ubiquitous
sensing and data from the web. We study face recognition and show that three
distinct properties have surprising effects on the transferability of deep
convolutional networks (CNN): (1) The bottleneck of the network serves as an
important transfer learning regularizer, and (2) in contrast to the common
wisdom, performance saturation may exist in CNN's (as the number of training
samples grows); we propose a solution for alleviating this by replacing the
naive random subsampling of the training set with a bootstrapping process.
Moreover, (3) we find a link between the representation norm and the ability to
discriminate in a target domain, which sheds lights on how such networks
represent faces. Based on these discoveries, we are able to improve face
recognition accuracy on the widely used LFW benchmark, both in the verification
(1:1) and identification (1:N) protocols, and directly compare, for the first
time, with the state of the art Commercially-Off-The-Shelf system and show a
sizable leap in performance
- …