Show simple item record

dc.contributor.advisorSilvio Micalien_US
dc.contributor.authorLepinski, Matten_US
dc.contributor.authorMicali, Silvioen_US
dc.contributor.authorIzmalkov, Sergeien_US
dc.contributor.otherTheory of Computationen_US
dc.date.accessioned2007-12-05T18:15:10Z
dc.date.available2007-12-05T18:15:10Z
dc.date.issued2007-12-05
dc.identifier.otherMIT-CSAIL-TR-2007-056en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/39659
dc.description.abstractWe 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.extent29 p.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.subjectinterdependent functionsen_US
dc.subjectcorrelated equilibriumen_US
dc.subjectImplementationen_US
dc.subjectinterdependent mechanismsen_US
dc.titleVerifiably Secure Devicesen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record