Strong secrecy for interference channels from channel resolvability

The achievable rate region is studied for interference channels with confidential messages under strong secrecy constraints. The problem is investigated based on the framework of the channel resolvability theory. The information-spectrum method introduced by Han and Verdu is first generalized to an arbitrary interference channel to obtain a direct channel resolvability result. The derived resolvability results are then shown to be the achievable strong secrecy rates for the stationary and memoryless interference channel. Our results provide further evidence that channel resolvability can be a powerful and general framework for strong secrecy analysis in multiuser networks.