We consider communication systems operating in environments where some participating users cannot be trusted. This motivates the study of Byzantine communication models, in which users may behave adversarially. In this survey, we provide a unified information-theoretic perspective on communication with adversarial users in multi-user settings. We review recent advances in Byzantine multiple access channels, including reliable communication, adversary identification, and distributed function computation. Furthermore, we discuss extensions to classical-quantum channels and highlight fundamental differences between classical and quantum models. Finally, we outline key open problems and future research directions at the intersection of communication, computation, and security.
We study how precisely a moving target can be localized on finite rectangular grids and their cylindrical counterparts. Each query asks whether the target lies in a chosen subset of vertices and receives a noiseless answer. Queries may depend on previous answers. Between successive queries, the target may stay in place or move along one horizontal or vertical edge. Accuracy is measured by the number of positions still possible immediately after the final answer, with no subsequent movement. A strategy achieves accuracy $s$ if it always terminates with at most $s$ possible positions, whatever admissible trajectory the target follows. Thus $s=1$ means exact localization. We denote by $s^*(M,N)$ the smallest value of $s$ achievable by a finite adaptive strategy on a finite grid. Our main result shows that every finite rectangular grid admits a strategy that localizes the target to at most eight positions, regardless of the grid dimensions: $s^*(M,N)\leq8$. The construction uses nine local query patterns and their vertical reflections. Its termination follows from the progress these patterns force toward the finite grid boundaries. We also prove the dimension-dependent bound $s^*(M,N)\leq\min\{M+1,N+1\}$. For finite cylindrical grids $P_M\square C_N$, where the columns are periodic but the first and last rows remain boundaries, we introduce the corresponding accuracy parameter and state the proposed dimension-independent bound $s^*_{\mathrm{cyl}}(M,N)\leq9$.