A Simple Model of Secure Public Communication

Public communication is secure if a hostile third-party cannot decode the messages exchanged by the communicating parties. In Nash equilibrium, communication by computationally unbounded players cannot be secure. We assume complexity averse players, and show that a simple, secure, and costless communication protocol becomes available as the marginal complexity cost tends to zero.