This chapter investigates covert communication in a UAV-assisted network, where a UAV covertly disseminates data to multiple ground users while evading detection by a concealed warden. To ensure transmission fairness, our objective is to maximize the minimum throughput among users through a joint optimization of the UAV’s trajectory, transmit power, and power allocation variables, subject to UAV mobility and covertness constraints. Under the covertness constraint, we derive a closed-form expression for the maximum transmit power. Leveraging the expression and optimal successive hover-and-fly (SHF) structure, we construct a joint trajectory and power allocation design problem containing a reduced set of variables. This new problem is efficiently solved by the sequential convex programming (SCP) approach which involves iteratively constructing tight concave approximations of the original problem, enabling convergence to a high-quality solution.