  Steganography is the task of concealing a message within a medium such that
the presence of the hidden message cannot be detected. Though the prospect of
steganography is conceivably interesting in many contexts, and though work has
been done both towards formalizing steganographic security and providing
provably secure constructions, little work exists attempting to provide
efficient and provably secure steganographic schemes in specific, useful
domains. Beginning from the starting point of the initial definition of
steganographic security, I have engaged in an exploration which has developed
to include two primary tasks, both pointing towards the realization of
efficient and secure steganographic systems in practice: (a) investigating the
syntactic and semantic applicability of the current formalism of steganographic
security to a broader range of potentially interesting domains and (b)
constructing and implementing provably secure (symmetric-key) steganographic
schemes in domains which are well-suited to the current formalism.
