In this paper, we consider secure broadcasting over fast fading channels. Assuming imperfect main channel state information (CSI) at the transmitter, we first provide an upper and a lower bounds on the ergodic secrecy capacity when a common message is broadcasted to multiple legitimate receivers in the presence of one eavesdropper. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link. Then, we present an expression for the achievable secrecy sum-rate when each legitimate receiver is interested in an independent message. The special cases of high SNR, perfect and no-main CSI are also analyzed. Numerical results are presented to illustrate the obtained results for the case of independent but not necessarily identically distributed Rayleigh fading channels.

We consider a wiretap channel consisting of a source with multiple antennas, a legitimate receiver and an eavesdropper with a single antenna each. The channels between the source and the receivers undergo fast fading. We assume that the transmitter, in addition to the statistics of both channels, is only aware of a noisy version of the CSI to the legitimate receiver referred to as main channel. The legitimate receiver is aware of both its instantaneous channel gain and the transmitter's estimate of the main channel. On the other hand, the eavesdropper's receiver, in addition to its instantaneous channel realization, is aware of the actual main CSI and the transmitter's estimate as well. While the capacity of this channel is still open even with perfect CSI at the transmitter, we provide in this paper upper and lower bounds on the secrecy capacity. The upper bound is tighter than the one corresponding to perfect main CSI and the gap between the two upper bounds is characterized in function of the channel estimation error variance, at high-SNR. Furthermore, we show that our upper and lower bounds coincide in the case of no main CSI providing a trivial secrecy capacity.