Secure Multiplex Coding with a Common Message

We determine the capacity region of the secure multiplex coding with a common message, improve the exponent of mutual information to the second receiver (eavesdropper) given by Yamamoto et al., and also evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which was not evaluated by Yamamoto et al.