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

• URL: http://arxiv.org/abs/2602.03421v1
• Date: Tue, 03 Feb 2026 11:45:43 GMT
• Title: On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations
• Authors: Hadi Aghaee, Christian Deppe, Holger Boche,
• Abstract summary: This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties.<n>By modeling the shared resource as an arbitrary tripartite non-signaling box, we obtain a unified perspective on both the channel behavior and the resulting correlations.
• Score: 45.59862974645558
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties when the parties have access to general tripartite non-signaling correlations. By modeling the shared resource as an arbitrary tripartite non-signaling box, we obtain a unified perspective on both the channel behavior and the resulting correlations. Our main result demonstrates that perfect oblivious transfer is impossible. In the asymptotic regime, we further show that even negligible leakage cannot be achieved, as repeated use of the resource amplifies the receiver(s)'s ability to distinguish messages that were not intended for him/them. In contrast, the receiver(s)'s own privacy is not subject to a universal impossibility limitation.

Related papers

• Enhancing Sum Capacity via Quantum and No-Signaling Cooperation Between Transmitters [15.753810550698624]
  Previous works have shown that the sum capacities of channels involving pseudo-telepathy games can be enhanced by quantum or no-signaling cooperation.<n>We propose a broader class of channels for which quantum or no-signaling cooperation increases the sum capacity.
  arXiv  Detail & Related papers  (2025-09-10T01:24:23Z)
• Network Oblivious Transfer via Noisy Channels: Limits and Capacities [13.819068627708473]
  We study the information-theoretical limits of oblivious transfer between two parties.<n>We propose a multiparty protocol for honest-but-curious parties.
  arXiv  Detail & Related papers  (2025-01-28T15:37:45Z)
• String commitment from unstructured noise [46.40786209841718]
  We introduce the unstructured noisy channel model as a generalization of the unfair noisy channel model.<n>We show that the entropic constraints in the unstructured noisy channel model can be derived from physical assumptions such as noisy quantum storage.
  arXiv  Detail & Related papers  (2024-12-31T05:28:05Z)
• Nonlocality-Assisted Enhancement of Error-Free Communication in Noisy Classical Channels [0.0]
  noisy classical channels with zero zero-error capacity can transmit one bit of information when assisted by 2-2-m nonlocal correlations.<n>We identify channels with zero zero-error capacity that can nonetheless perfectly transmit log m bits of information when assisted by corresponding extremal nonlocal correlations.
  arXiv  Detail & Related papers  (2024-12-06T05:01:47Z)
• The Interference Channel with Entangled Transmitters [9.86463469466224]
  It explores communication over a two-sender, two-receiver classical interference channel, enhanced by the availability of entanglement resources between transmitters.<n>It addresses the persistent challenge of the lack of a general capacity formula, even in the purely classical case, and highlights the striking similarities in achievable rate expressions when assessing quantum advantages.
  arXiv  Detail & Related papers  (2024-11-15T09:33:02Z)
• Rate-Distortion-Perception Theory for Semantic Communication [73.04341519955223]
  We study the achievable data rate of semantic communication under the symbol distortion and semantic perception constraints. We observe that there exists cases that the receiver can directly infer the semantic information source satisfying certain distortion and perception constraints.
  arXiv  Detail & Related papers  (2023-12-09T02:04:32Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals [98.95383921866096]
  We study the potential of data-driven deep learning methods for separation of two communication signals from an observation of their mixture. We show that capturing high-resolution temporal structures (nonstationarities) leads to substantial performance gains. We propose a domain-informed neural network (NN) design that is able to improve upon both "off-the-shelf" NNs and classical detection and interference rejection methods.
  arXiv  Detail & Related papers  (2022-09-11T14:10:37Z)
• Information Causality without concatenation [0.5043455303941253]
  Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity. We show that concatenation can be successfully replaced by limits on the communication channel capacity.
  arXiv  Detail & Related papers  (2021-01-29T18:05:40Z)
• FedRec: Federated Learning of Universal Receivers over Fading Channels [92.15358738530037]
  We propose a neural network-based symbol detection technique for downlink fading channels. Multiple users collaborate to jointly learn a universal data-driven detector, hence the name FedRec. The performance of the resulting receiver is shown to approach the MAP performance in diverse channel conditions without requiring knowledge of the fading statistics.
  arXiv  Detail & Related papers  (2020-11-14T11:29:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.