A min-entropy uncertainty relation for finite size cryptography

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for BB84 and six-state encodings. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove a new uncertainty relation in terms of the smooth min-entropy that is only marginally less strong, but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Renyi entropies that may be of independent interest.Comment: 5+6 pages, 1 figure, revtex. new version changed author's name from Huei Ying Nelly Ng to Nelly Huei Ying Ng, for consistency with other publication

Brief Announcement: The Fault-Tolerant Cluster-Sending Problem

The development of fault-tolerant distributed systems that can tolerate Byzantine behavior has traditionally been focused on consensus protocols, which support fully-replicated designs. For the development of more sophisticated high-performance Byzantine distributed systems, more specialized fault-tolerant communication primitives are necessary, however. In this brief announcement, we identify the cluster-sending problem - the problem of sending a message from one Byzantine cluster to another Byzantine cluster in a reliable manner - as such an essential communication primitive. We not only formalize this fundamental problem, but also establish lower bounds on the complexity of this problem under crash failures and Byzantine failures. Furthermore, we develop practical cluster-sending protocols that meet these lower bounds and, hence, have optimal complexity. As such, our work provides a strong foundation for the further exploration of novel designs that address challenges encountered in fault-tolerant distributed systems

A New Cryptosystem Based On Hidden Order Groups

Let $G_1$ be a cyclic multiplicative group of order $n$. It is known that the Diffie-Hellman problem is random self-reducible in $G_1$ with respect to a fixed generator $g$ if $\phi(n)$ is known. That is, given $g, g^x\in G_1$ and having oracle access to a `Diffie-Hellman Problem' solver with fixed generator $g$, it is possible to compute $g^{1/x} \in G_1$ in polynomial time (see theorem 3.2). On the other hand, it is not known if such a reduction exists when $\phi(n)$ is unknown (see conjuncture 3.1). We exploit this ``gap'' to construct a cryptosystem based on hidden order groups and present a practical implementation of a novel cryptographic primitive called an \emph{Oracle Strong Associative One-Way Function} (O-SAOWF). O-SAOWFs have applications in multiparty protocols. We demonstrate this by presenting a key agreement protocol for dynamic ad-hoc groups.Comment: removed examples for multiparty key agreement and join protocols, since they are redundan

Hysteresis of nanocylinders with Dzyaloshinskii-Moriya interaction

The potential for application of magnetic skyrmions in high density storage devices provides a strong drive to investigate and exploit their stability and manipulability. Through a three-dimensional micromagnetic hysteresis study, we investigate the question of existence of skyrmions in cylindrical nanostructures of variable thickness. We quantify the applied field and thickness dependence of skyrmion states, and show that these states can be accessed through relevant practical hysteresis loop measurement protocols. As skyrmionic states have yet to be observed experimentally in confined helimagnetic geometries, our work opens prospects for developing viable hysteresis process-based methodologies to access and observe skyrmionic states.Comment: 4 pages, 2 figure

Rapid-purification protocols for optical homodyning

We present a number of rapid-purification feedback protocols for optical homodyne detection of a single optical qubit. We derive first a protocol that speeds up the rate of increase of the average purity of the system, and find that like the equivalent protocol for a non-disspative measurement, this generates a deterministic evolution for the purity in the limit of strong feedback. We also consider two analogues of the Wiseman-Ralph rapid-purification protocol in this setting, and show that like that protocol they speed up the average time taken to reach a fixed level of purity. We also examine how the performance of these algorithms changes with detection efficiency, being an important practical consideration.Comment: 6 pages, revtex4, 3 eps figure

Cryptography in the Bounded-Quantum-Storage Model

This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is required for honest players, whereas the protocols can only be broken by an adversary controlling a large amount of quantum memory. The protocols are efficient, non-interactive and can be implemented with today's technology. On the theoretical side, new entropic uncertainty relations involving min-entropy are established and used to prove the security of protocols according to new strong security definitions. For instance, in the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers, the uncertainty relation allows to prove the security of QKD protocols while tolerating considerably higher error rates compared to the standard model with unbounded adversaries.Comment: PhD Thesis, BRICS, University of Aarhus, Denmark, 128 page