English
Related papers

Related papers: Secure quantum weak oblivious transfer against ind…

200 papers

We provide a simple method to obtain an upper bound on the secret key rate that is particularly suited to analyze practical realizations of quantum key distribution protocols with imperfect devices. We consider the so-called trusted device…

Quantum Physics · Physics 2009-11-11 Tobias Moroder , Marcos Curty , Norbert Lütkenhaus

In 1-out-of-2 oblivious transfer (OT), Alice inputs numbers x_0, x_1, Bob inputs a bit b and outputs x_b. Secure OT requires that Alice and Bob learn nothing about b and x_{\bar{b}}, respectively. We define spacetime-constrained oblivious…

Quantum Physics · Physics 2016-07-04 Damián Pitalúa-García

In this study, the effect of bounded quantum memory in a primitive information protocol has been examined using the quantum Kolmogorov complexity as a measure of information. We employed a toy two-party protocol in which Bob by using a…

Quantum Physics · Physics 2011-04-15 Takayuki Miyadera

We describe efficient protocols for quantum oblivious transfer and for one-out-of-two quantum oblivious transfer. These protocols, which can be implemented with present technology, are secure against general attacks as long as the cheater…

Quantum Physics · Physics 2008-02-03 M. Ardehali

Most current research on quantum cryptography requires transmission and reception of single photons that creates severe implementation challenges and limits range. This paper argues for the development of threshold quantum cryptography…

Quantum Physics · Physics 2013-10-24 Subhash Kak

The `no communication' theorem prohibits superluminal communication by showing that any measurement by Alice on an entangled system cannot change the reduced density matrix of Bob's state, and hence the expectation value of any measurement…

Quantum Physics · Physics 2022-09-19 Amitava Datta

In this paper, we present a quantum strong coin flipping protocol. In this protocol, an EPR pair and a quantum memory storage are made use of, and losses in the quantum communication channel and quantum memory storage are all analyzed. We…

Quantum Physics · Physics 2015-03-19 Jia-Jun Ma , Fen-Zhuo Guo , Qian Yang , Yan-Bing Li , Qiao-Yan Wen

Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…

Quantum Physics · Physics 2025-03-03 Saronath Halder , Alexander Streltsov

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger…

First, I show explicitly a scheme to {\it faithfully} and {\it deterministically} teleport an arbitrary 2-qubit state from Alice to Bob. In this scheme two same Bell states are sufficient for use. Bob can recover the 2-qubit state by…

Quantum Physics · Physics 2007-05-23 Zhan-jun Zhang

The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest…

Quantum Physics · Physics 2023-09-11 Cosmo Lupo , James T. Peat , Erika Andersson , Pieter Kok

The uncertainty principle sets lower bound on the uncertainties of two incompatible observables measured on a particle. The uncertainty lower bound can be reduced by considering a particle as a quantum memory entangled with the measured…

Quantum Physics · Physics 2016-11-10 F. Adabi , S. Haseli , S. Salimi

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously…

Quantum Physics · Physics 2011-02-09 André Chailloux , Iordanis Kerenidis

Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical…

Quantum Physics · Physics 2021-05-31 Michele Ciampi , Alexandru Cojocaru , Elham Kashefi , Atul Mantri

Suppose Alice and Bob have access to two separated regions, respectively, of a system of electrons moving in the presence of a regular one-dimensional lattice of binding atoms. We consider the problem of communicating as much quantum…

Quantum Physics · Physics 2013-05-30 Hulya Yadsan-Appleby , Tobias J. Osborne

In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp,…

Information Theory · Computer Science 2022-12-14 Meghal Gupta , Venkatesan Guruswami , Rachel Yun Zhang

Security and privacy are major concerns in modern communication networks. In recent years, the information theory of covert communications, where the very presence of the communication is undetectable to a watchful and determined adversary,…

Information Theory · Computer Science 2017-11-29 Ramin Soltani , Dennis Goeckel , Don Towsley , Amir Houmansadr

The "semiquantum" key distribution protocol introduced by Zou et al. [Phys. Rev. A Vol.79, 052312 (2009)] is examined. The protocol while using two-way quantum communication requires only Bob to be fully quantum. We derive a trade-off…

Quantum Physics · Physics 2011-08-18 Takayuki Miyadera

Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally,…

Quantum Physics · Physics 2009-06-24 Oded Regev , Ben Toner

We propose the problem of wiretapped commitment, where two parties, say committer Alice and receiver Bob, engage in a commitment protocol using a noisy channel as a resource, in the presence of an eavesdropper, say Eve. Noisy versions of…

Information Theory · Computer Science 2024-06-21 Anuj Kumar Yadav , Manideep Mamindlapally , Amitalok J. Budkuley