STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A Protocol to Achieve Independence in Constant Rounds
IEEE Transactions on Parallel and Distributed Systems
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient simultaneous broadcast
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
| Hi-index | 0.00 |
We describe a simple gambling game in which n participants each put down a fixed amount of money and one of them, selected at random, wins and takes it all. We describe how this game can be operated in cyberspace, without knowing anything about the other participants except for the bit strings they transmit. We show how the genuine winner can convert the bit strings back into money, without any other gambler or eavesdropper being able to do so before her. We also show that it is possible to have confidence in the fair running of the game even if all the other participants, including the dealer, are crooked and are prepared to manipulate the protocol to their advantage. The paper initially develops a naïve protocol for running the game, and shows various ways in which a gambler can cheat by ceasing to send messages once it is clear that she is losing. We incrementally build this up into a protocol that resists drop-outs, collusion and dishonesty from all players, by relying on the honest behaviour of some non-gambling 'issuers' whose role is to convert currency into bit strings and vice versa.