Related papers: Eve's forgery probability from her false acceptanc…

In order to avoid the risk of information leakage during the information mutual transmission between two authorized participants, i.e., Alice and Bob, a quantum dialogue protocol based on the entanglement swapping between any two Bell…

All incoherent as well as 2- and 3-qubit coherent eavesdropping strategies on the 6 state protocol of quantum cryptography are classified. For a disturbance of 1/6, the optimal incoherent eavesdropping strategy reduces to the universal…

We present a novel approach to secret key establishment that appears to be resistant to currently known quantum cryptanalytic algorithms. This quantum resistance arises because the security of our method does not rely on the difficulty of…

We model (interactive) resources that provide Alice with a string $X$ and a guarantee that any Eve interacting with her interface of the resource obtains a (quantum) system $E$ such that the conditional (smooth) min-entropy of $X$ given $E$…

Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players' cheating. Finding the optimal security…

Evaluating the theoretical limit of the amount of information Eve can steal from a quantum key distribution protocol under given conditions is one of the most important things that need to be done in security proof. In addition to source…

Security analyses of quantum cryptographic protocols typically rely on certain conditions; one such condition is that the sender (Alice) and receiver (Bob) have isolated devices inaccessible to third parties. If an eavesdropper (Eve) has a…

Information-theoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver (Bob) can use the noise more advantageously than an eavesdropper…

In recent years, neural networks have been used to implement symmetric cryptographic functions for secure communications. Extending this domain, the proposed approach explores the application of asymmetric cryptography within a neural…

We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is…

In the classic wiretap model, Alice wishes to reliably communicate to Bob without being overheard by Eve who is eavesdropping over a degraded channel. Systems for achieving that physical layer security often rely on an error correction code…

This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling…

In this paper we present finite-key security analysis for quantum key distribution protocol based on weak coherent (in particular phase-coded) states using a fully quantum asymptotic equipartition property technique. This work is the…

This article presents a novel method for establishing an information theoretically secure encryption key over wireless channels. It exploits the fact that data transmission over wireless links is accompanied by packet error, while noise…

In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $2P_{Alice}^{\ast }+P_{Bob}^{\ast }\geq 2$, where $P_{Alice}^{\ast…

This paper demonstrates the vulnerability of the Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchanger to compromised random number generator(s) even if these random numbers are used solely to generate the noises emulating the Johnson…

Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key…

Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…

We consider the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and Eve, to simulate a repeated action of a distributed quantum measurement using a pair of…

Quantum states cannot be cloned. I show how to extend this property to classical messages encoded using quantum states, a task I call "uncloneable encryption." An uncloneable encryption scheme has the property that an eavesdropper Eve not…