String commitment from unstructured noise

• URL: http://arxiv.org/abs/2501.00281v2
• Date: Sun, 24 Aug 2025 16:35:43 GMT
• Title: String commitment from unstructured noise
• Authors: Jiawei Wu, Masahito Hayashi, Marco Tomamichel,
• Abstract summary: 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.
• Score: 46.40786209841718
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Noisy channels are a foundational resource for constructing cryptographic primitives such as string commitment and oblivious transfer. The noisy channel model has been extended to unfair noisy channels, where adversaries can influence the parameters of a memoryless channel. In this work, we introduce the unstructured noisy channel model as a generalization of the unfair noisy channel model to allow the adversary to manipulate the channel arbitrarily subject to certain entropic constraints. We present a string commitment protocol with established security and derive its achievable commitment rate, demonstrating the feasibility of commitment against this stronger class of adversaries. Furthermore, we show that the entropic constraints in the unstructured noisy channel model can be derived from physical assumptions such as noisy quantum storage. Our work thus connects two distinct approaches to commitment, i.e., the noisy channel and physical limitations.

Related papers

• Discrete-Space Generative AI Pipeline for Semantic Transmission of Signals [0.2291770711277359]
  Discernment is a semantic communication system that transmits the meaning of physical signals (baseband radio and audio) over a technical channel using GenAI models.<n>We show that Discernment maintains semantic integrity even as channel capacity severely degrades.
  arXiv  Detail & Related papers  (2026-02-14T02:11:46Z)
• 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)
• Non-Markovian Noise Suppression Simplified through Channel Representation [0.8639941465436463]
  We introduce a channel representation for arbitrary non-Markovian quantum dynamics, termed the Choi channel.<n>This representation translates the complex dynamics of non-Markovian noise into the familiar picture of noise channels acting on ideal states.<n>We have devised new protocols using Pauli twirling, probabilistic error cancellation and virtual channel purification.
  arXiv  Detail & Related papers  (2024-12-15T15:26:07Z)
• Secure Integrated Sensing and Communication Under Correlated Rayleigh Fading [35.096935840816684]
  We consider a secure integrated sensing and communication (ISAC) scenario, in which a signal is transmitted through a state-dependent wiretap channel. We establish and illustrate an achievable secrecy-distortion region for degraded secure ISAC channels under correlated Rayleigh fading.
  arXiv  Detail & Related papers  (2024-08-30T07:16:55Z)
• Security for adversarial wiretap channels [4.383205675898942]
  We analyze information-theoretically secure coding schemes which use the inverse of an extractor and an error-correcting code. We show that this also holds for certain channel types with memory.
  arXiv  Detail & Related papers  (2024-04-02T09:22:40Z)
• Semantic Entropy Can Simultaneously Benefit Transmission Efficiency and Channel Security of Wireless Semantic Communications [55.54210451136529]
  We propose SemEntropy to explore semantics of data for both adaptive transmission and physical layer encryption.<n>We show that SemEntropy can keep the semantic accuracy remain 95% with 60% less transmission.
  arXiv  Detail & Related papers  (2024-02-05T12:25:02Z)
• Enhancing Contrastive Learning with Noise-Guided Attack: Towards Continual Relation Extraction in the Wild [57.468184469589744]
  We develop a noise-resistant contrastive framework named as textbfNoise-guided textbfattack in textbfContrative textbfLearning(NaCL) Compared to direct noise discarding or inaccessible noise relabeling, we present modifying the feature space to match the given noisy labels via attacking.
  arXiv  Detail & Related papers  (2023-05-11T18:48:18Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)
• Superiority in dense coding through non-Markovian stochasticity [0.0]
  We investigate the distributed dense coding (DC) protocol, involving multiple senders and a single or two receivers under the influence of non-Markovian noise. We compare the effects of non-Markovianity on DC both for the dephasing and depolarising channels. We report that the detrimental effect of non-Markovian depolarising channels in the DC protocol can be eliminated when randomness is added to the channel.
  arXiv  Detail & Related papers  (2022-11-23T15:53:15Z)
• 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)
• Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation [5.203329540700176]
  We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. We handle the reliability constraint via an autoencoder, and handle the secrecy constraint with hash functions. For blocklengths smaller than or equal to 16, we evaluate through simulations the probability of error at the legitimate receiver.
  arXiv  Detail & Related papers  (2022-06-07T17:52:46Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Quantifying Quantumness of Channels Without Entanglement [0.0]
  We show that quantum channels breaking entanglement, incompatibility, or nonlocality are related to tests of macrorealism. A hierarchy of quantum non-breaking channels is derived, akin to the existing hierarchy relations for temporal and spatial quantum correlations.
  arXiv  Detail & Related papers  (2021-06-30T02:48:04Z)
• Applicability of Squeezed-and Coherent-State Continuous-Variable Quantum Key Distribution over Satellite Links [0.0]
  We address the applicability of quantum key distribution with continuous-variable coherent and squeezed states over long-distance satellite-based links. We obtain tight security bounds on the untrusted excess noise on the channel output. We show that feasible amounts of optimized signal squeezing can substantially improve the applicability of the protocols.
  arXiv  Detail & Related papers  (2021-01-22T18:44:54Z)
• Operation-Aware Soft Channel Pruning using Differentiable Masks [51.04085547997066]
  We propose a data-driven algorithm, which compresses deep neural networks in a differentiable way by exploiting the characteristics of operations. We perform extensive experiments and achieve outstanding performance in terms of the accuracy of output networks.
  arXiv  Detail & Related papers  (2020-07-08T07:44:00Z)
• Harnessing Wireless Channels for Scalable and Privacy-Preserving Federated Learning [56.94644428312295]
  Wireless connectivity is instrumental in enabling federated learning (FL) Channel randomnessperturbs each worker inversions model update while multiple workers updates incur significant interference on bandwidth. In A-FADMM, all workers upload their model updates to the parameter server using a single channel via analog transmissions. This not only saves communication bandwidth, but also hides each worker's exact model update trajectory from any eavesdropper.
  arXiv  Detail & Related papers  (2020-07-03T16:31:15Z)
• 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)
• Semantic Security for Quantum Wiretap Channels [68.24747267214373]
  We consider the problem of semantic security via classical-quantum and quantum wiretap channels. We use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions.
  arXiv  Detail & Related papers  (2020-01-16T09:55:49Z)
• Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles [65.9694455739978]
  We study contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. Our analysis reveals that the optimal hypothesis can significantly deviate from the underlying realizability function, depending on the noise characteristics. This implies that classical approaches cannot guarantee a non-trivial regret bound.
  arXiv  Detail & Related papers  (2017-03-03T21:39:56Z)

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.