Verifiably Secure Devices
Author(s)Lepinski, Matt; Micali, Silvio; Izmalkov, Sergei
Theory of Computation
MetadataShow full item record
We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices1. Provide a perfect solution to the problem of achieving correlated equilibrium, an important and extensively investigated problem at the intersection of game theory, cryptography and efficient algorithms; and2. Enable the secure evaluation of multiple interdependent functions.
interdependent functions, correlated equilibrium, Implementation, interdependent mechanisms