A real world application of secure multi-party computations duplicate bridge for cheapskates

Authors:
Matthew Johnson;Ralph Owen
Affiliations:
University of Cambridge;University of Cambridge
Venue:
Security'08 Proceedings of the 16th International conference on Security protocols
Year:
2008

Citing 5
Cited 0

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
Building a Fast Double-Dummy Bridge Solver

Building a Fast Double-Dummy Bridge Solver
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a use of secure multi-party computations in duplicate bridge. A two-person computation is performed by dealing cards in a specific permutation in order to create a deal which has been pre-determined by computer. Statistical analysis is used to demonstrate that little information about the resultant hands can be derived by the participants of the computation. Experimental evidence for failure-rates and time taken to perform the operation is also presented.