Related papers: Generating Boolean lattices by few elements and ex…

Given a graph $G=(V,E)$ with $V=\{1,\ldots,n\}$, we place on every vertex a token $T_1,\ldots,T_n$. A swap is an exchange of tokens on adjacent vertices. We consider the algorithmic question of finding a shortest sequence of swaps such that…

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

We consider the cryptographic task of bit-string generation. This is a generalisation of coin tossing in which two mistrustful parties wish to generate a string of random bits such that an honest party can be sure that the other cannot have…

Modern lattice-based cryptography, particularly the learning with errors paradigm, relies on injecting artificial noise to secure data against quantum adversaries. This study systematically examines the theoretical and physical boundaries…

Brakerski et. al [BCM+18] introduced the model of cryptographic testing of a single untrusted quantum device and gave a protocol for certifiable randomness generation. We use the leakage resilience properties of the Learning With Errors…

Optical lattices are typically created via the ac-Stark shift, which are limited by diffraction to periodicities $\ge\lambda/2$, where $\lambda$ is the wavelength of light used to create them. Lattices with smaller periodicities may be…

Woodhead [Phys. Rev. A \textbf{88}, 012331 (2013)] derived the lower bound of the secret key rate for a Bennett-Brassard (BB84) like quantum key distribution protocol under collective attacks. However, this lower bound does not always…

We consider in this paper the information-theoretic secure key distribution problem over main and wire-tap noise channels with a public discussion in presence of an active adversary. In contrast to the solution proposed by ourselves for a…

Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This…

Given partially ordered sets (posets) $(P, \leq_P)$ and $(P', \leq_{P'})$, we say that $P'$ contains a copy of $P$ if for some injective function $f: P\rightarrow P'$ and for any $X, Y\in P$, $X\leq _P Y$ if and only of $f(X)\leq_{P'}…

The security of cyber-physical systems, from self-driving cars to medical devices, depends on their underlying multi-hop wireless networks. Yet, the lack of trusted central infrastructures and limited nodes' resources make securing these…

In search of a quantum key distribution scheme that could stand up for more drastic eavesdropping attack, I discover a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power.…

We consider a family of totally asymmetric simple exclusion processes (TASEPs), consisting of particles on a lattice that require binding by a "token" in various physical configurations to advance over the lattice. Using a combination of…

Cryptographic key exchange protocols traditionally rely on computational conjectures such as the hardness of prime factorisation to provide security against eavesdropping attacks. Remarkably, quantum key distribution protocols like the one…

We report on a complete experimental implementation of a quantum key distribution protocol through a free space link using polarization-entangled photon pairs from a compact parametric down-conversion source. Over 10 hours of uninterrupted…

Quantum physics allows for unconditionally secure communication through insecure communication channels. The achievable rates of quantum-secured communication are fundamentally limited by the laws of quantum physics and in particular by the…

In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that…

We propose an efficient quantum key distribution protocol based on the photon-pair generation from parametric down-conversion (PDC). It uses the same experimental setup as the conventional protocol, but a refined data analysis enables…

Li et al. presented a protocol [Int. Journal of Quantum Information, Vol. 4, No. 6 (2006) 899-906] for quantum key distribution based on entanglement swapping. In this protocol they use random and certain bits to construct a classical key…

The LPN (Learning Parity with Noise) problem has recently proved to be of great importance in cryptology. A special and very useful case is the RING-LPN problem, which typically provides improved efficiency in the constructed cryptographic…