Related papers: A new efficient k-out-of-n Oblivious Transfer prot…
We propose a schematic setup of quantum key distribution (QKD) with an improved secret key rate based on high-dimensional quantum states. Two degrees-of-freedom of a single photon, orbital angular momentum modes, and multi-path modes, are…
This letter proposes a novel hybrid key distribution architecture that jointly exploits quantum key distribution (QKD) and Kirchhoff-law-Johnson-noise (KLJN) statistical-physical key exchange. In the proposed system, an optical BB84-type…
Motivated by privacy preservation for outsourced data, data-oblivious external memory is a computational framework where a client performs computations on data stored at a semi-trusted server in a way that does not reveal her data to the…
We present a protocol for transfer of an unknown quantum state. The protocol is based on a two-mode cavity interacting dispersively in a sequential manner with three-level atoms in $\Lambda$ configuration. We propose a scheme for quantum…
This paper develops a novel framework for sharing secret keys using the well-known Automatic Repeat reQuest (ARQ) protocol. The proposed key sharing protocol does not assume any prior knowledge about the channel state information (CSI),…
XOR oblivious transfer is a universal cryptographic primitive that can be related to linear polynomial evaluation. We firstly introduce some bipartite quantum protocols for XOR oblivious transfer, which are not secure if one party cheats,…
We propose a method for extracting an errorless secret key in a continuous-variable quantum key distribution protocol, which is based on Gaussian modulation of coherent states and homodyne detection. The crucial feature is an…
Recently a new quantum key distribution protocol using coherent and thermal states was proposed. In this work this kind of two-layer QKD protocol is formalized and its security against the most common attacks, including external control and…
Quantum key distribution (QKD) seeks to provide a method of generating cryptographically-secure keys between remote parties while guaranteeing unconditional security. Implementations of high-dimensional QKD using dispersive-optics (DO-QKD)…
A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping,…
The round-robin differential phase-shift quantum key distribution protocol provides a secure way to exchange private information without monitoring conventional disturbances and still maintains a high tolerance of noise, making it desirable…
In one-out-of-$m$ spacetime-constrained oblivious transfer (SCOT), Alice and Bob agree on $m$ pairwise spacelike separated output spacetime regions $R_0,R_1,\ldots, R_{m-1}$ in an agreed reference frame in a spacetime that is Minkowski, or…
The decoy-state high-dimensional quantum key distribution provides a practical secure way to share more private information with high photon-information efficiency. In this paper, based on detector-decoy method, we propose a detector-decoy…
This paper introduces a new attack against the Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchange scheme. The attack is based on the nonlinearity of the noise generators. We explore the effect of total distortion (TD) at the second…
This paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF…
We propose a scheme for performing quantum key distribution (QKD) which has the potential to beat schemes based on the direct transmission of photons between the communicating parties. In our proposal, the communicating parties exchange…
In a 2005 IACR report, Wang published an efficient identity-based key agreement protocol (IDAK) suitable for resource constrained devices. The author shows that the IDAK key agreement protocol is secure in the Bellare-Rogaway model with…
We construct deletion error-correcting codes in the oblivious model, where errors are adversarial but oblivious to the encoder's randomness. Oblivious errors bridge the gap between the adversarial and random error models, and are motivated…
In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible. We consider this problem in single-hop multi- channel networks of n nodes, and…
Due to the commonly known impossibility results, information theoretic security is considered impossible for oblivious transfer (OT) in both the classical and the quantum world. In this paper, we proposed a weak version of the…