Steganography and steganalysis: data hiding in Vorbis audio streams

The goal of the current work is to introduce ourselves in the world of steganography and steganalysis, centering our efforts in acoustic signals, a branch of steganography and steganalysis which has received much less attention than steganography and steganalysis for images. With this purpose in mind, it’s essential to get first a basic level of understanding of signal theory and the properties of the Human Auditory System, and we will dedicate ourselves to that aim during the first part of this work. Once established those basis, in the second part, we will obtain a precise image of the state of the art in steganographic and steganalytic sciences, from which we will be able to establish or deduce some good practices guides. With both previous subjects in mind, we will be able to create, design and implement a stego-system over Vorbis audio codec and, finally, as conclusion, analyze it using the principles studied during the first and second parts

An ad-hoc wireless communication system

Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2006.Includes bibliographical references (p. 77-79).This thesis studies the challenges of providing load balancing and fault-tolerant external links between ad-hoc multicast mesh networks. The work is the gateway component of a research platform called FluidVoice, a wireless audio communication system. This system consists of nodes forming a broadcast mesh based on 802.11. Some of these nodes called Stargates have the capability to communicate to the external world. The problem is that these gateways can fail or lose capacity unexpectedly. In this work we explore the ways to provide communications to the external world under unexpected gateway node failures, and variance of load. We propose and evaluate a distributed algorithm designed to form this robust and balanced interconnection. The algorithm is designed with robustness in mind, and takes into account failures in the outbound links as well as between the gateways, and it is focused to support real-time applications running over it. In this thesis we show that by adopting this algorithm, we can provide a reliable connection to the end-user even as gateways presence or capacity varies. The prototype version has about 20ms of additional transmission time in average, with an overhead of about 5% to 35% depending on the packet size, and a recovery time of 1 to 3 seconds. The redundant traffic generated in intermediate steps of the optimization problem can grow up proportionally to the number of participating gateway nodes, and reduces quickly to only the required amount of traffic.by Hector Yuen.S.M