Computer Science – Cryptography and Security
Scientific paper
2009-09-20
Computer Science
Cryptography and Security
12 pages
Scientific paper
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.
Kiayias Aggelos
Raekow Yona
Russell Alexander
Shashidhar Narasimha
No associations
LandOfFree
Efficient Steganography with Provable Security Guarantees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient Steganography with Provable Security Guarantees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Steganography with Provable Security Guarantees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-431933