Elements of information theory
Elements of information theory
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Kommunikation in Verteilten Systemen, Grundlagen, Anwendungen, Betrieb, GI/ITG-Fachtagung
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Anonymous Networking Amidst Eavesdroppers
IEEE Transactions on Information Theory
Improving the efficiency of anonymous routing for MANETs
Computer Communications
| Hi-index | 0.00 |
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination nodes, and paths of information flow in the network. One way to achieve such an anonymity is to use mixers. Mixers are nodes that receive packets from multiple sources and change the timing of packets, by mixing packets at the output links, to prevent the eavesdropper from finding sources of outgoing packets. In this paper, we consider two simple but fundamental scenarios: double input-single output mixer and double input-double output mixer. For the first case, we use the information-theoretic definition of the anonymity, based on average entropy per packet, and find an optimal mixing strategy under a strict latency constraint. For the second case, perfect anonymity is considered, and a maximal throughput strategy with perfect anonymity is found that minimizes the average delay.