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∈
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.