Strong secrecy in arbitrarily varying wiretap channels

In this work the arbitrarily varying wiretap channel AVWC under the average error criterion and the strong secrecy criterion is studied. We show that in the case of a non-symmetrisable channel to the legitimate receiver the deterministic code secrecy capacity equals the random code secrecy capacity and thus we establish a result for the AVWC similar to that of Ahlswede's dichotomy for ordinary AVCs. We derive a lower bound on the random code secrecy capacity in the case of a best channel to the eavesdropper. We further prove upper bounds on the deterministic code secrecy capacity, which in special cases results in explicit expressions of the secrecy capacity.