Commitment over Gaussian Unfair Noisy Channels

by   Amitalok J. Budkuley, et al.

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 lower bounds by constructing positive - throughput protocols under given input power constraint, and (two-sided) channel elasticity at committer Alice and receiver Bob. Our achievability results establish an interesting fact - Gaussian UNCs with zero elasticity have infinite commitment capacity - which brings a completely new perspective to why classic Gaussian channels, i.e., Gaussian UNCs with zero elasticity, have infinite capacity. Finally, we precisely characterize the positive commitment capacity threshold for a Gaussian UNC in terms of the channel elasticity, when the transmit power tends to infinity.


page 1

page 2

page 3

page 4


On Reverse Elastic Channels and the Asymmetry of Commitment Capacity under Channel Elasticity

Commitment is an important cryptographic primitive. It is well known tha...

On the Commitment Capacity of Unfair Noisy Channels

Noisy channels are a valuable resource from a cryptographic point of vie...

On Capacity-Achieving Distributions Over Complex AWGN Channels Under Nonlinear Power Constraints and their Applications to SWIPT

The capacity of deterministic, complex and discrete time memoryless Addi...

The Value of Information and Efficient Switching in Channel Selection

We consider a collection of statistically identical two-state continuous...

Constructing Privacy Channels from Information Channels

Data privacy protection studies how to query a dataset while preserving ...

Computability of the Zero-Error Capacity of Noisy Channels

Zero-error capacity plays an important role in a whole range of operatio...

On the Interactive Capacity of Finite-State Protocols

The interactive capacity of a noisy channel is the highest possible rate...

Please sign up or login with your details

Forgot password? Click here to reset