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

IEEE Transactions on Communications

Oblivious Transfer Over Wireless Channels

Jithin Ravi, Bikash Kumar Dey, Emanuele Viterbo

Published Jan 8, 2016• 3 citations
Publisher

Abstract

We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme for honest-but-curious parties that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.

DOI
10.1109/tcomm.2016.2515593

Related papers

Oblivious Transfer over Wireless Channels

Jithin Ravi, Bikash Kumar Dey, Emanuele Viterbo

We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.

arXiv:1508.00664•Aug 4, 2015•0 citations

Oblivious transfer over OFDM and MIMO channels

Jithin Ravi, Bikash Kumar Dey, Emanuele Viterbo

We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that enables the transmitter to send obliviously one-of-two files, i.e, without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.

IEEE Information Theory Workshop (ITW)•Apr 1, 2015•0 citations

Network Oblivious Transfer via Noisy Channels: Limits and Capacities

Hadi Aghaee, Akhbari, Bahareh, Deppe, Christian

In this paper, we study the information-theoretic limits of oblivious transfer via noisy channels. We also investigate oblivious transfer over a noisy multiple-access channel with two non-colluding senders and a single receiver. The channel is modeled through correlations among the parties, who may be honest-but-curious or, in the case of the receiver, potentially malicious. We first revisit the information-theoretic limits of two-party oblivious transfer and then extend these results to the multiple-access setting. For honest-but-curious participants, we introduce a multiparty protocol that reduces a general multiple access channel to a suitable correlation model. In scenarios with a malicious receiver, we characterize an achievable oblivious transfer rate region.

arXiv:2501.17021•Jan 28, 2025•0 citations

On the Oblivious-Transfer Capacity of Noisy Resources

Anderson C. A. Nascimento, Andreas Winter

In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT. We also introduce the problem of computing the oblivious-transfer capacity of a noisy resource, which measures the optimal way of implementing OT from a noisy channel/distribution. We show that for honest-but-curious sender, the oblivious-transfer capacity of noisy resources is strictly positive. Several open questions are raised.

IEEE Transactions on Information Theory•May 29, 2008•70 citations

A quantum oblivious transfer protocol

Abhishek Parakh

We propose a quantum protocol for 1-out-of-2, 1-out-of-n and k-out-of-n oblivious transfer. Oblivious transfer is a counter-intuitive cryptographic primitive in which the receiver receives only the information he is authorized for, while the sender does not know what information receiver received. In 1-out-of-2 oblivious transfer, Alice sends two bits to Bob who can choose only one of them to read, while Alice does not know which bit Bob read. k-out-of-n oblivious transfer is an extension of this idea. The proposed protocols do not require any classical communication, are practical, secure and can be implemented using current technology.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 1, 2013•2 citations

Pairwise Oblivious Transfer

Rémi A. Chou

We consider oblivious transfer between one client and two non-colluding servers that store independent contents. The client requests one file from each server such that (i) the servers do not learn the file selection of the client, and (ii) the client does not learn information about the non-selected files. We show under the honest-but-curious assumption that oblivious transfer with non-zero rates can be achieved with a multiuser protocol between the client and the servers. This contrasts with the case where the client engages in independent protocols with each of the two servers, for which it is known that oblivious transfer with information-theoretic security is impossible in the absence of additional resources. Furthermore, we derive a capacity result for the proposed setting.

IEEE Information Theory Workshop (ITW)•Apr 11, 2021•11 citations
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme for honest-but-curious parties that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that enables the transmitter to send obliviously one-of-two files, i.e, without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.
In this paper, we study the information-theoretic limits of oblivious transfer via noisy channels. We also investigate oblivious transfer over a noisy multiple-access channel with two non-colluding senders and a single receiver. The channel is modeled through correlations among the parties, who may be honest-but-curious or, in the case of the receiver, potentially malicious. We first revisit the information-theoretic limits of two-party oblivious transfer and then extend these results to the multiple-access setting. For honest-but-curious participants, we introduce a multiparty protocol that reduces a general multiple access channel to a suitable correlation model. In scenarios with a malicious receiver, we characterize an achievable oblivious transfer rate region.
In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT. We also introduce the problem of computing the oblivious-transfer capacity of a noisy resource, which measures the optimal way of implementing OT from a noisy channel/distribution. We show that for honest-but-curious sender, the oblivious-transfer capacity of noisy resources is strictly positive. Several open questions are raised.
We propose a quantum protocol for 1-out-of-2, 1-out-of-n and k-out-of-n oblivious transfer. Oblivious transfer is a counter-intuitive cryptographic primitive in which the receiver receives only the information he is authorized for, while the sender does not know what information receiver received. In 1-out-of-2 oblivious transfer, Alice sends two bits to Bob who can choose only one of them to read, while Alice does not know which bit Bob read. k-out-of-n oblivious transfer is an extension of this idea. The proposed protocols do not require any classical communication, are practical, secure and can be implemented using current technology.
We consider oblivious transfer between one client and two non-colluding servers that store independent contents. The client requests one file from each server such that (i) the servers do not learn the file selection of the client, and (ii) the client does not learn information about the non-selected files. We show under the honest-but-curious assumption that oblivious transfer with non-zero rates can be achieved with a multiuser protocol between the client and the servers. This contrasts with the case where the client engages in independent protocols with each of the two servers, for which it is known that oblivious transfer with information-theoretic security is impossible in the absence of additional resources. Furthermore, we derive a capacity result for the proposed setting.