Identification under Effective Secrecy

Abstract

We study the problem of identification over a DMC wiretap channel under effective secrecy. In identification, due to the fact that single messages are compared to each other, all conditions are inherently semantic, and thus we are forced to consider semantic effective secrecy. We show that even effective secrecy “comes for free” by giving an achievability theorem for stealth identification. We use two concatenated transmission codes, the first one is a resolvability transmission code. The second code is an effective-secrecy transmission code. An achievable rate is derived for the problem.