1702339
submission
+- Capacity of a Steganographic Channel Calculated-> on Tuesday November 04 2008, @05:56AM KentuckyFC
background: url(//a.fsdn.com/sd/topics/topicsecurity.gif); width:59px; height:78px;
security
KentuckyFC writes "Steganography is the art of hiding a message in such a way that only the sender and receiver realize it is there. (By contrast, cryptography disguises the content of a message but makes no attempt to hide it.) The central problem for steganographers is how much data can be hidden without being detected. But the complexity of this problem has meant it has been largely ignored. Now two computer scientists (one working for Google) have made a major theoretical breakthrough by tackling the problem in the same way the the electrical engineer Claude Shannon calculated the capacity of an ordinary communications channel in the 1940s. In Shannon's theory, a transmission is considered successful if the decoder properly determines which message the encoder has sent. In the stego-channel, a transmission is successful if the decoder properly determines the sent message without anybody else detecting its presence (abstract). Studying a stego-channel in this way leads to some counter-intuitive results: for example, in certain circumstances, doubling the number of algorithms looking for hidden data can increase the capacity of the steganographic channel"
Link to Original Source
Link to Original Source
You have all the characteristics of a popular politician: a horrible voice,
bad breeding, and a vulgar manner.
-- Aristophanes
All trademarks and copyrights on this page are owned by their respective owners. Comments are owned by the Poster. The Rest © 1997-2009 Geeknet, Inc.
Capacity of a Steganographic Channel Calculated 0 Comments More Login /
Get More Comments