|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Policing Online Games -- Defining A Strong, Mutually Verifiable Reality in Virtual Games
If you have a question about this talk, please contact Joseph Bonneau.
Ronald Reagan was fond of saying “trust but verify”. Alas, the modern virtual world of games gives users no basis for trust and no mechanism for verification. Foolish people wager real money on a hand of cards dealt to them by an offshore server. Some of the virtual worlds have been rocked by scandals where sys admins take bribes to add special features like unbeatable armor to favored players.
The good news is that we can build strong, virtual worlds that give users the basis for trust and the ability to verify the fairness of a game. The algorithms are well-known and tested, to some extent, by time. This talk will revue a number of the classic results designed for playing poker or distributing digital cash, and explore how they can be used to stop some of the most blatant cheating affecting the more sophisticated online world.
This talk is part of the Computer Laboratory Security Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsGeometry, Integrability and Twistor Theory Cambridge Science Summer School 2012 Cambridge Drosophila Seminar Series
Other talksProduction Processes Group Seminar - Project BiognostiX: Inkjet printing biosensors and microfluidic controls Title: TBA (Prof. Thomas F. Krauss FRSE, University of York) Sequential Monte Carlo methods for applications in Data Assimilation Embedded correlation within strongly correlated materials 'Coping with cellular stress: the mitochondrial way' Jerrold Levinson on 'Ain't that a Shame: Shame in General, and Shame in Music'.