Verifiably Secure Devices

Printer-friendly version
Article
Author/s: 
Sergei Izmalkov, Matt Lepinski, and Silvio Micali
Publisher: 
IACR
Year: 
2008
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 devices 1. 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; and 2. Enable the secure evaluation of multiple interdependent functions.
Developed by Paolo Gittoi