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 < n cards at a time and shuffles them in a private buffer “behind your back,” which we call buffer shuffling. The problem arises naturally in the context of parallel mixnet servers as well as other security applications. Our analysis is based on related analyses of load-balancing processes. We include extensions to variations that involve corrupted servers and adversarially injected messages, which correspond to an opponent who can peek at some shuffles in the buffer and who can mark some number of the cards. In addition, our analysis makes novel use of a sum-of-squares metric for anonymity, which leads to improved performance bounds for parallel mixnets and can also be used to bound well-known existing anonymity measures.
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.
References
Aldous, D., Diaconis, P.: Shuffling cards and stopping times. Amer. Math. Monthly 93(5), 333–348 (1986)
Borisov, N.: An Analysis of Parallel Mixing with Attacker-Controlled Inputs. In: Danezis, G., Martin, D. (eds.) PET 2005. LNCS, vol. 3856, pp. 12–25. Springer, Heidelberg (2006)
Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84–90 (1981)
Diaconis, P., Fill, J.A., Pitman, J.: Analysis of top to random shuffles. Combinatorics, Probability and Computing 1(02), 135–155 (1992)
Ghosh, B., Muthukrishnan, S.: Dynamic load balancing in parallel and distributed networks by random matchings. In: 6th ACM Symp. Par. Alg. & Arch. (SPAA), pp. 226–235 (1994)
Golle, P., Juels, A.: Parallel mixing. In: 11th ACM Conf. on Comp. and Comm. Security (CCS), pp. 220–226 (2004)
Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Practical oblivious storage. In: 2nd ACM Conf. on Data and App. Sec. & Priv. (CODASPY), pp. 1–10 (2011)
Goodrich, M., Mitzenmacher, M.: Anonymous card shuffling and its applications to parallel mixnets. Arxiv preprint (2012)
Klonowski, M., Kutyłowski, M.: Provable Anonymity for Networks of Mixes. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 26–38. Springer, Heidelberg (2005)
Knuth, D.E.: Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley (1997)
Li, N., Li, T., Venkatasubramanian, S.: t-closeness: Privacy beyond k-anonymity and l-diversity. In: 23rd IEEE Int. Conf. on Data Engineering (ICDE), pp. 106–115 (2007)
Ren, J., Wu, J.: Survey on anonymous communications in computer networks. Computer Communications 33(4), 420–431 (2010)
Sampigethaya, K., Poovendran, R.: A survey on mix networks and their secure applications. Proc. of the IEEE 94(12), 2142–2181 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goodrich, M.T., Mitzenmacher, M. (2012). Anonymous Card Shuffling and Its Applications to Parallel Mixnets. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-31585-5_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31584-8
Online ISBN: 978-3-642-31585-5
eBook Packages: Computer ScienceComputer Science (R0)