  This paper presents a random coding scheme with which two nodes can exchange
information with guaranteed integrity over a two-way Byzantine relay. This
coding scheme is employed to obtain an inner bound on the capacity region with
guaranteed information integrity. No pre-shared secret or secret transmission
is needed for the proposed scheme. Hence the inner bound obtained is generally
larger than those achieved based on secret transmission schemes. This approach
advocates the separation of supporting information integrity and secrecy.
