arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0909.3658cs.CRcs.ITmath.IT
收藏

具有可证明安全性保证的高效隐写

Efficient Steganography with Provable Security Guarantees

Aggelos Kiayias, Yona Raekow, Alexander Russell, Narasimha Shashidhar

摘要:

我们提供了一个新的可证明安全的隐写加密协议,被证明是安全的,在复杂性理论框架的Hopper等人。我们的隐写加密协议的基本组成部分是一个“一次性隐写系统”,允许双方传输的消息长度短于共享密钥与信息理论的安全保证。伪随机发生器(PRG)的使用允许以与这样的发生器允许对长于对称加密中的密钥的消息使用一次性密码本加密相同的方式安全地传输较长的消息。与Hopper等人的结构相比,它避免使用伪随机函数族,而是(直接)依赖于伪随机发生器,其方式是在每个发送比特的基础单向置换的应用数量上提供线性改进。这种有利的折衷是通过用在去随机化中广泛使用的适当的组合构造(即几乎t-方向独立的函数族)替换在先前构造中采用的伪随机函数族来实现的。

英文摘要:

We provide a new provably-secure steganographic encryption protocol that is proven secure in the complexity-theoretic framework of Hopper et al. The fundamental building block of our steganographic encryption protocol is a "one-time stegosystem" that allows two parties to transmit messages of length shorter than the shared key with information-theoretic security guarantees. The employment of a pseudorandom generator (PRG) permits secure transmission of longer messages in the same way that such a generator allows the use of one-time pad encryption for messages longer than the key in symmetric encryption. The advantage of our construction, compared to that of Hopper et al., is that it avoids the use of a pseudorandom function family and instead relies (directly) on a pseudorandom generator in a way that provides linear improvement in the number of applications of the underlying one-way permutation per transmitted bit. This advantageous trade-off is achieved by substituting the pseudorandom function family employed in the previous construction with an appropriate combinatorial construction that has been used extensively in derandomization, namely almost t-wise independent function families.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑