Network Oblivious Transfer via Noisy Channels: Limits and Capacities

• URL: http://arxiv.org/abs/2501.17021v2
• Date: Thu, 30 Oct 2025 09:35:57 GMT
• Title: Network Oblivious Transfer via Noisy Channels: Limits and Capacities
• Authors: Hadi Aghaee, Bahareh Akhbari, Christian Deppe,
• Abstract summary: We study the information-theoretical limits of oblivious transfer between two parties.<n>We propose a multiparty protocol for honest-but-curious parties.
• Score: 13.819068627708473
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we aim to study the information-theoretical limits of oblivious transfer. This work also investigates the problem of oblivious transfer over a noisy multiple access channel involving two non-colluding senders and a single receiver. The channel model is characterized by correlations among the parties, with the parties assumed to be either honest-but-curious or, in the receiver's case, potentially malicious. At first, we study the information-theoretical limits of oblivious transfer between two parties and extend it to the multiple access channel model. We propose a multiparty protocol for honest-but-curious parties where the general multiple access channel is reduced to a certain correlation. In scenarios where the receiver is malicious, the protocol achieves an achievable rate region.

Related papers

• On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations [45.59862974645558]
  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.
  arXiv  Detail & Related papers  (2026-02-03T11:45:43Z)
• Carrier-Assisted Entanglement Purification [7.610551500789847]
  Entanglement distillation enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication.<n>We present an entanglement purification protocol via quantum communication, namely a carrier-assisted entanglement purification protocol.<n>We show that the protocol, when single-qubit transmission is noiseless, can purify a noisy entangled state shared by parties.
  arXiv  Detail & Related papers  (2025-09-09T08:51:17Z)
• String commitment from unstructured noisy channels [53.04878543623513]
  Noisy channels are valuable resources for cryptography, enabling primitives like bit commitment and oblivious transfer. We present a protocol for string commitment over such channels that is complete, hiding, and binding, and derive its achievable commitment rate. The commitment rate coincides with previous results when the adversarial channels are the same binary symmetric channel as in the honest case.
  arXiv  Detail & Related papers  (2024-12-31T05:28:05Z)
• 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)
• Verifying the security of a continuous variable quantum communication protocol via quantum metrology [1.6632263048576381]
  Quantum mechanics offers the possibility of unconditionally secure communication between multiple remote parties. Security proofs for such protocols typically rely on bounding the capacity of the quantum channel in use. In this work we establish a connection between these two areas.
  arXiv  Detail & Related papers  (2023-11-09T14:15:42Z)
• Non-Local and Quantum Advantages in Network Coding for Multiple Access Channels [1.6114012813668934]
  We study entanglement-assisted communication over classical network channels. We develop a framework for n-senders and 1-receiver multiple access channels based on nonlocal games.
  arXiv  Detail & Related papers  (2023-04-21T07:54:52Z)
• 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)
• DYST (Did You See That?): An Amplified Covert Channel That Points To Previously Seen Data [0.0]
  We introduce a new class of covert channels that we call history covert channels. History covert channels can communicate by pointing to unaltered legitimate traffic created by regular network nodes.
  arXiv  Detail & Related papers  (2022-12-22T16:34:52Z)
• 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)
• Quantum Random Access Code in Noisy Channels [0.0]
  In this work we build upon works that have previously proven quantum random access code (QRAC) We investigate the effects of noisy channel on QRAC performance and how the losses can be mitigated by using the see-saw method optimized by semi-definite programming when the noisy channel is known.
  arXiv  Detail & Related papers  (2022-04-20T14:33:51Z)
• The Quantum Multiple-Access Channel with Cribbing Encoders [78.7611537027573]
  Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered. Based on the no-cloning theorem, perfect cribbing is impossible. A partial decode-forward region is derived for a quantum MAC with non-robust cribbing.
  arXiv  Detail & Related papers  (2021-11-30T17:31:48Z)
• Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods [2.2469167925905777]
  Non-quantum communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all inputs. We here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping.
  arXiv  Detail & Related papers  (2021-06-17T07:04:54Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
  Communication over a quantum broadcast channel with cooperation between the receivers is considered. We develop lower and upper bounds on the capacity region in each setting.
  arXiv  Detail & Related papers  (2020-11-18T11:58:48Z)
• 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)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)
• Noise reduction caused by eavesdropping on six-state quantum key distribution over collective-noise channel [0.0]
  We show that there are instances where eavesdropping causes noise reduction for a quantum key distribution protocol. In this paper, we investigate a fault-tolerant six-state QKD protocol over a collective unitary noise channel.
  arXiv  Detail & Related papers  (2019-11-30T12:57:18Z)

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.