| dc.contributor.advisor | Silvio Micali | en_US |
| dc.contributor.author | Lepinski, Matt | en_US |
| dc.contributor.author | Micali, Silvio | en_US |
| dc.contributor.author | Izmalkov, Sergei | en_US |
| dc.contributor.other | Theory of Computation | en_US |
| dc.date.accessioned | 2007-12-05T18:15:10Z | |
| dc.date.available | 2007-12-05T18:15:10Z | |
| dc.date.issued | 2007-12-05 | |
| dc.identifier.other | MIT-CSAIL-TR-2007-056 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/39659 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 29 p. | en_US |
| dc.relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.relation | | en_US |
| dc.subject | interdependent functions | en_US |
| dc.subject | correlated equilibrium | en_US |
| dc.subject | Implementation | en_US |
| dc.subject | interdependent mechanisms | en_US |
| dc.title | Verifiably Secure Devices | en_US |
