Abstract
We start with a deck of cards, which is sorted in order, in suits. Two dealers each get given a key, and these numbers here represent a series of piles, and the order into which they deal the cards into the piles. The sequence is randomly generated by the computer in advance. For the second dealer, there’s another permutation that looks the same. This is also random, although it is actually a mapping between the intermediate state and the desired hand we need at the end. But since those are both randomly generated, it’s also random. Each dealer only sees one of the keys.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnson, M. (2011). A Real World Application of Secure Multi-party Computations (Transcript of Discussion). In: Christianson, B., Malcolm, J.A., Matyas, V., Roe, M. (eds) Security Protocols XVI. Security Protocols 2008. Lecture Notes in Computer Science, vol 6615. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22137-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-22137-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22136-1
Online ISBN: 978-3-642-22137-8
eBook Packages: Computer ScienceComputer Science (R0)