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.

翻译：本文研究了通过噪声信道实现不经意传输的信息论极限。我们还探讨了在具有两个非共谋发送方与单个接收方的噪声多址信道上的不经意传输问题。信道通过参与方之间的相关性建模，参与方可能是诚实但好奇的，或者（在接收方的情况下）可能是恶意的。我们首先重新审视两方不经意传输的信息论极限，随后将这些结果推广到多址场景。针对诚实但好奇的参与者，我们提出一种多方协议，可将通用多址信道简化为合适的相关性模型。在接收方恶意的情况下，我们刻画了可达的不经意传输速率区域。