Anonymous card shuffling and its applications to parallel mixnets

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

Abstract

We study the question of how to shuffle n cards when faced with an opponent who knows the initial position of all the cards and can track every card when permuted, except when one takes K∈

Cite

CITATION STYLE

APA

Goodrich, M. T., & Mitzenmacher, M. (2012). Anonymous card shuffling and its applications to parallel mixnets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7392 LNCS, pp. 549–560). Springer Verlag. https://doi.org/10.1007/978-3-642-31585-5_49

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