We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information and determine the secrecy capacity of the compound classical-quantum wiretap channel with channel state information at the transmitter. We use this result to derive a proof for a lower bound on the entanglement generating capacity of the compound quantum channel. We also derive a proof for the formula for entanglement generating capacity of the compound quantum channel with channel state information at the encoder which was given in additional information [Bjelakovi\ifmmode \acute{c}\else \'{c}\fi{}, Boche, and N\"otzel, in Proceedings of International Symposium on Information Theory ISIT, Korea, 2009 (IEEE, New York, 2009), pp. 1889--1893].
The classic wiretap channel (WTC) problem is concerned with a transmitter (Alice) that wants to send a messageWto the intended receiver (Bob) while keeping it secret from a passive eavesdropper (Eve). However, under certain communication scenarios, the user may not be interested in hiding the entire message from the eavesdropper, but rather in hiding its most sensitive attributes. While classic wiretap coding is capable of hiding these salient message attributes, it may be too stringent and better communication rates may be achievable. Motivated by the above, in this paper, we introduce and study the latent variable wiretap channel (LV-WTC) problem. Under this setting, the transmitter is interested in sending the messageWto the intended receiver while keeping a correlated latent variableS(which models privacy sensitive attributes) secret from the eavesdropper. We present a message splitting based achievable scheme for the LV-WTC problem, which adapts to the structure of the conditional distribution PS|Wto achieve higher rates compared to the classical WTC. Several open problems and future directions that originate from this new communication problem are also discussed.