A real world application of secure multi-party computations (transcript of discussion)

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Johnson, M. (2011). A real world application of secure multi-party computations (transcript of discussion). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6615 LNCS, pp. 191–197). https://doi.org/10.1007/978-3-642-22137-8_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free