Generalized multiple access channels with confidential messages

A discrete memoryless generalized multiple access Channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. This channel generalizes the multiple access channel (MAC) In that the two users also receive channel outputs. It is assumed that each user views the other user as a wiretapper, and wishes to keep its confidential information as secret as possible from the other user. The level of secrecy of the confidential information Is measured by the equivocation rate. The performance measure of interest is the rale-equivocation tuple that includes the common rate, two private rates and two equivocation raies as componenis. The set that includes all achievable rate-equivocation tuples is referred to as the capacityequivocation region. For the CMAC with one confidential message set, where only one user (user 1) has private (confidential) information for the destination, inner and outer bounds on the capacity-equivocation region are derived. The outer bound provides a tight converse to the secrecy capacity region, which is the set of all achievable rates with user 2 being perfectly ignorant of confidential messages of user 1, thus establishing the secrecy capacity region. Furthermore, the degraded GMAC with one confidential message set is further studied, and the capacity-equivocation region and the secrecy capacity region are established. For the CMAC with two confidential message sets, where both users have confidential messages for the destination, an inner bound on the capacity-equivocation region is obtained. The secrecy rate region is derived, where each user's confidential information is perfectly hidden from the other user.