University of Cambridge > > Computer Laboratory Security Group meeting presentations > Cyberdice 2: Peer-to-peer gambling in presence of cheaters

Cyberdice 2: Peer-to-peer gambling in presence of cheaters

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Markus Kuhn.

A bunch of participants play a game where each one pays an equal share in order to play and then one of them is selected at random and gets all the money on the table. Except there’s no table: it’s all done just with bit strings over an unreliable, non-confidential, non-authentic, non-anything network, where any message can be overheard, intercepted, delayed, rewritten or deleted (imagine playing this over USENET news). And all the other participants may well be crooks. Third parties (such as banks or more precisely escrow agents) may help convert between money and bit strings but only according to strictly deterministic criteria—they won’t act as casinos and do the random selection of the winner for you. And some players may not trust some of these third parties.

Cyberdice is a game and payment protocol to address the above constraints.

This is a follow-up to last week’s talk. It’s still work in progress and you are once again most welcome to come and joyfully shoot holes in it.

This talk is part of the Computer Laboratory Security Group meeting presentations series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity