Secure message transmission in the presence of a fully generalised adversary
This work addresses secure communication problems in cryptography, but it appears incremental as it extends previous results to more general adversary models.
The paper tackles secure message transmission against a fully generalized adversary that disrupts and listens to arbitrary sets of communication wires, establishing necessary and sufficient conditions for both one-way and two-way communication.
We investigate the problem of secure message transmission in the presence of a "fully generalised" adversary, who disrupts and listens to separate sets of communication wires. We extend previous results by considering the case when these sets may have arbitrary size, providing necessary and sufficient conditions for both one-way and two-way communication.