Noisy channels are valuable resources for cryptography, enabling information-theoretically secure protocols for cryptographic primitives like bit commitment and oblivious transfer. While existing work has primarily considered memoryless channels, we consider more flexible channel resources that a dishonest player can configure arbitrarily within some constraints on their min-entropy. We present a protocol for string commitment over such channels that is complete, hiding, and binding, and derive its achievable commitment rate, demonstrating the possibility of string commitment in noisy channels with a stronger adversarial model. The asymptotic commitment rate coincides with previous results when the adversarial channels are the same binary symmetric channel as in the honest case.
View on arXiv