Abstract-The problem of embedding a covert information flow in independent renewal cover traffic is considered. Such embedding provides maximum anonymity against traffic analysis. The maximum embedding efficiency is characterized, and an accurate approximation is obtained by formulating the problem as a Riemann-Hilbert boundary value problem.