{'fraction_non_alphanumeric': 0.021963824289405683, 'fraction_numerical': 0.006459948320413436, 'mean_word_length': 5.512605042016807, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
More Efficient Provably Secure Steganography

Steganography is the science of hiding the very presenceof a secret message within a public communication channel. In Crypto 2002, Hopper, Langford, and von Ahn proposed the first complexitytheoretic definition and constructions of stegosystems. They later pointed out and corrected a flaw in one of their basic constructions. The correction, unfortunately, introduced a need for expensive errorcorrecting codes. We obtain a more efficient stegosystem by first analyzing the severity of the flaw in their original construction. As a result, for high-entropy channels, our construction is at least 5 times more efficient (in terms of rate) than their corrected version, and requires no computationally intensive error correcting.