Is there a studied notion of "party independent transfer"?
You can get active security in cryptographic setting, but it seems that you also need broadcast.


Bob and Charlie both create an asymmetric key.
Bob commits to his public key a broadcasts the commitment.
Bob sends its public key to Charlie and opens the commitment to him. If these do not match, Charlie complains.
Charlie broadcasts both keys (in random order). If Bob's isn't one of them, he complains by opening the commitment.
Alice picks one key at random, encrypts the message, and broadcasts the result. Only one of them is able to decrypt, and Alice doesn't know who.


Note that the message space should be large, otherwise Bob can just try to encrypt all possible messages with Charlie's key and see which one was broadcast. To remedy this, apply some random padding to the message.

Also note that in step 3, the accusation does not lead to identification of the culprit.