Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Proceedings of the 11th ACM conference on Computer and communications security
Survey on anonymous communications in computer networks
Computer Communications
Proceedings of the second ACM conference on Data and Application Security and Privacy
Provable anonymity for networks of mixes
IH'05 Proceedings of the 7th international conference on Information Hiding
An analysis of parallel mixing with attacker-controlled inputs
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
| Hi-index | 0.00 |
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 Kn 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.