标题： 从无结构噪声信道的字符串承诺 显示英文标题

标题： String commitment from unstructured noisy channels

摘要： 噪声信道是密码学的宝贵资源，能够实现信息论上安全的协议，用于像比特承诺和不经意传输等密码原语。尽管现有工作主要考虑了无记忆信道，我们研究了更加灵活的信道资源，这些资源允许一个不诚实的玩家在最小熵的某些限制下任意配置。我们提出了一个在这些信道上的字符串承诺协议，该协议是完备的、隐藏的且具有约束力的，并推导出其可实现的承诺速率，证明了在具有更强对手模型的噪声信道中实现字符串承诺的可能性。当对抗性信道与诚实情况下的二进制对称信道相同时，渐近承诺速率与先前的结果一致。 显示英文摘要

摘要： 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.