Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0601157 · IEEE Information Theory Workshop (ITW)

Oblivious Transfer and Quantum Channels

Nicolas Gisin, S. Popescutt, Valerio Scarani, Stefan Wolf, Jürg Wullschleger

Published May 25, 2006• 5 citations
arXivHTMLPDF

Abstract

We show that oblivious transfer can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are for maximally entangled qubits.
DOI
10.1109/itw.2006.1633774

Related papers

Nonequivalence of two flavors of oblivious transfer at the quantum level

Guang Ping He, Z. D. Wang

Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that a protocol built upon secure quantum all-or-nothing oblivious transfer cannot satisfy the rigorous definition of quantum one-out-of-two oblivious transfer due to the nature of quantum cryptography. Thus the securities of the two oblivious transfer protocols are not equivalent at the quantum level.

arXiv:quant-ph/0504170•Physical Review A•Apr 26, 2006•17 citations

Quantum Channels that cannot Transmit Quantum Correlations can Generate Quantum Entanglement from Classical Correlation

László Gyöngyösi, Sándor Imre

Bulletin of the American Physical Society•Jun 7, 2013•0 citations

On (Im)possibility of Oblivious Transfer via Noisy Multiple Access Channels and Non-Signaling Correlations

Hadi Aghaee, Christian Deppe, Holger Boche

We investigate the feasibility of oblivious transfer over discrete memoryless multiple-access channels assisted by tripartite non-signaling correlations among honest-but-curious parties. Modeling the shared resource as an arbitrary non-signaling box provides a unified framework encompassing both channel behavior and induced correlations, including quantum and super-quantum resources. Our main result establishes an impossibility: oblivious transfer cannot be achieved, as any nontrivial non-signaling correlation used as resources inevitably causes receiver’s observation to depend on both senders’ inputs, violating sender-privacy. Consequently, no tripartite non-signaling assistance, including entanglement or PR-box–type correlations, can enable or enhance network oblivious transfer over noisy multiple-access channels.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

Classical capacity of quantum channels, coherent quantum information and quantum privacy

B. Schjumacher, Michael D. Westmorland

We derive a relation between a quantum channel's capacity to convey classical information and its ability to convey quantum information. This relation is applied to the analysis of the privacy of a quantum channel.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•0 citations

Non-Local Box Complexity and Secure Function Evaluation

Marc Kaplan, Iordanis Kerenidis, Sophie Laplante +1 more

A non-local box is an abstract device into which Alice and Bob input bits $x$ and $y$ respectively and receive outputs $a$ and $b$ respectively, where $a,b$ are uniformly distributed and $a \oplus b = x \wedge y$. Such boxes have been central to the study of quantum or generalized non-locality as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function $f$. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and randomized case. We show that non-local box complexity has interesting applications to classical cryptography, in particular to secure function evaluation, and study the question posed by Beimel and Malkin \cite{BM} of how many Oblivious Transfer calls Alice and Bob need in order to securely compute a function $f$. We show that this question is related to the non-local box complexity of the function and conclude by greatly improving their bounds. Finally, another consequence of our results is that traceless two-outcome measurements on maximally entangled states can be simulated with 3 \nlbs, while no finite bound was previously known.

Leibniz international proceedings in informatics•Jan 1, 2009•0 citations

Quantum Privacy and Quantum Coherence

Benjamin W. Schumacher, Michael D. Westmoreland

We derive a simple relation between a quantum channel's capacity to convey coherent (quantum) information and its usefulness for quantum cryptography.

arXiv:quant-ph/9709058•Physical Review Letters•Jun 22, 1998•95 citations
We investigate the feasibility of oblivious transfer over discrete memoryless multiple-access channels assisted by tripartite non-signaling correlations among honest-but-curious parties. Modeling the shared resource as an arbitrary non-signaling box provides a unified framework encompassing both channel behavior and induced correlations, including quantum and super-quantum resources. Our main result establishes an impossibility: oblivious transfer cannot be achieved, as any nontrivial non-signaling correlation used as resources inevitably causes receiver’s observation to depend on both senders’ inputs, violating sender-privacy. Consequently, no tripartite non-signaling assistance, including entanglement or PR-box–type correlations, can enable or enhance network oblivious transfer over noisy multiple-access channels.
A non-local box is an abstract device into which Alice and Bob input bits xxx and yyy respectively and receive outputs aaa and bbb respectively, where a,ba,ba,b are uniformly distributed and a⊕b=x∧ya \oplus b = x \wedge ya⊕b=x∧y. Such boxes have been central to the study of quantum or generalized non-locality as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function fff. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and randomized case. We show that non-local box complexity has interesting applications to classical cryptography, in particular to secure function evaluation, and study the question posed by Beimel and Malkin \cite{BM} of how many Oblivious Transfer calls Alice and Bob need in order to securely compute a function fff. We show that this question is related to the non-local box complexity of the function and conclude by greatly improving their bounds. Finally, another consequence of our results is that traceless two-outcome measurements on maximally entangled states can be simulated with 3 \nlbs, while no finite bound was previously known.