黑盒隐写术的上下界
Upper and Lower Bounds on Black-Box Steganography
摘要：
我们研究了隐写术的局限性，当发送者不使用任何属性的基础信道超出其熵和采样的能力，从it.On消极的一面，我们表明，发送者必须从信道中获得的样本数量是指数的隐写系统的速率。在积极的一面，我们提出了第一个秘密密钥隐写系统，基本上匹配这个下限，而不管底层信道的熵。此外，对于高熵信道，我们提出了第一个无状态地匹配这个下限的密钥隐写系统（即，而不需要发送者和接收者之间的同步状态）。
英文摘要：
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negative side, we show that the number of samples the sender must obtain from the channel is exponential in the rate of the stegosystem. On the positive side, we present the first secret-key stegosystem that essentially matches this lower bound regardless of the entropy of the underlying channel. Furthermore, for high-entropy channels, we present the first secret-key stegosystem that matches this lower bound statelessly (i.e., without requiring synchronized state between sender and receiver).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
