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 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 1 Enable the secure evaluation of multiple interdependent functions. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Izmalkov, S., Lepinski, M., & Micali, S. (2008). Verifiably secure devices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4948 LNCS, pp. 273–301). https://doi.org/10.1007/978-3-540-78524-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
