Commitment over Gaussian Unfair Noisy Channels
Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj, Kumar Yadav

TL;DR
This paper investigates the limits of cryptographic commitment over unreliable Gaussian noisy channels, revealing that unlike classical Gaussian channels, their commitment capacity can be finite or zero, depending on channel properties.
Contribution
It provides the first analysis of commitment capacity for Gaussian UNCs, establishing bounds, conditions for infinite capacity, and the impact of channel elasticity.
Findings
Gaussian UNCs can have finite or zero commitment capacity.
Infinite capacity occurs when channel elasticity is zero.
Threshold for positive capacity depends on channel elasticity at high power.
Abstract
Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes, however, their imprecise statistical characterization can severely impair such schemes, especially their security guarantees. Keeping our focus on channel unreliability in this work, we study commitment over unreliable continuous alphabet channels called the Gaussian unfair noisy channels or Gaussian UNCs. We present the first results on the optimal throughput or commitment capacity of Gaussian UNCs. It is known that classical Gaussian channels have infinite commitment capacity, even under finite transmit power constraints. For unreliable Gaussian UNCs, we prove the surprising result that their commitment capacity may be finite, and in some cases, zero. When commitment is possible, we present achievable rate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cryptography and Data Security · Cooperative Communication and Network Coding
