  In this paper, we consider the problem of an adversary aiming to learn
information about the network topology or the executed algorithm from some
signals obtained during the algorithm's execution. The problem is defined in a
very general form. However, it is mainly motivated by multi-hop ad hoc radio
networks. In contrast to previous work concentrated on single-hop radio
networks, this model is critically more complex due to the number of possible
settings that need to be taken into account when considering different
combinations of topologies and communication models. Moreover, the definition
of the adversary is also ambiguous, and the adequate approach needs to depend
on the adversary's aims and capabilities. This preliminary report presents a
general theoretical background and some basic algorithms. We also propose some
general taxonomy as a framework for future research.
