Upper and Lower Bounds on Black-Box Steganography

Nenad Dedic; Gene Itkis; Leonid Reyzin; Scott Russell

首页> 外文期刊>Journal of Cryptology >Upper and Lower Bounds on Black-Box Steganography

【24h】

Upper and Lower Bounds on Black-Box Steganography

机译：黑匣子隐写术的上下界

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

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).

机译：当发送者没有使用基础通道的任何熵和从其采样的能力之外的隐秘技术时，我们研究隐写术的局限性。从消极的一面，我们表明发送方必须从通道中获取的样本数量与隐身系统的速率成指数关系。从积极的方面来看，我们提出了第一个基本与该下限匹配的秘密隐身系统，而与基础通道的熵无关。此外，对于高熵通道，我们提出了第一个无状态匹配该下限的秘密密钥隐秘系统（即，不需要发送者和接收者之间的同步状态）。

著录项

来源
《Journal of Cryptology》 |2009年第3期|365-394|共30页
作者
Nenad Dedic; Gene Itkis; Leonid Reyzin; Scott Russell;
展开▼
作者单位

Department of Computer Science, Boston University, 111 Cummington Street, Boston, MA 02215, USA;

Department of Computer Science, Boston University, 111 Cummington Street, Boston, MA 02215, USA;

Department of Computer Science, Boston University, 111 Cummington Street, Boston, MA 02215, USA;

Department of Computer Science, Boston University, 111 Cummington Street, Boston, MA 02215, USA;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
steganography; covert communication; rejection sampling; lower bound; pseudorandomnness; information hiding; huge random objects;

机译：隐写术秘密交流;剔除采样;下界伪随机性信息隐藏;巨大的随机物体;

相似文献

外文文献
中文文献
专利

1. Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization [J] . Stefan Droste, Thomas Jansen, Ingo Wegener Theory of computing systems . 2006,第4期

机译：黑盒优化中随机搜索启发式的上下界
2. Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds [J] . Zelda B. Zabinsky, Robert L. Smith, Birna P. Kristinsdottir Computers & operations research . 2003,第10期

机译：具有上下误差界限的单变量黑盒Lipschitz函数的最优估计
3. Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization [J] . Stefan Droste, Thomas Jansen, Ingo Wegener Electronic Colloquium on Computational Complexity . 2003,第118期

机译：黑盒优化中随机搜索启发式的上下界
4. Upper and Lower Bounds on Black-Box Steganography [C] . Nenad Dedic, Gene Itkis, Leonid Reyzin, Theory of Cryptography Conference(TCC 2005); 20050210-12; Cambridge,MA(US) . 2005

机译：黑匣子隐写术的上下界
5. Connections Between Complexity Lower Bounds and Meta-computational Upper Bounds [D] . Carmosino, Marco Leandro. 2019

机译：复杂性下限与元计算上限之间的连接
6. Maximum common subgraph: some upper bound and lower bound results [O] . Xiuzhen Huang, Jing Lai, Steven F Jennings 2006

机译：最大公共子图：一些上限和下限结果
7. Upper and Lower Bounds on Black-Box Steganography [O] . Dedić, Nenad, Itkis, Gene, Reyzin, Leonid, 2008

机译：黑盒隐写术的上下界
8. A Comparison of the Upper Bound to the Lower Bound Energy of the Doubly Ionized Carbon Ion [R] . Guercio, R. J. 1973

机译：双电离碳离子上限与下限能的比较

Upper and Lower Bounds on Black-Box Steganography

摘要

著录项

相似文献

相关主题

期刊订阅