Networks without user observability
Computers and Security
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Server unavailability reduces mean waiting time in some batch service queuing systems
Computers and Operations Research
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
A protocol for anonymous communication over the Internet
Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Web MIXes: a system for anonymous and unobservable Internet access
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
P5: A Protocol for Scalable Anonymous Communication
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
An Optimal Strategy for Anonymous Communication Protocols
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Performance evaluation of an anonymity providing protocol for wireless ad hoc networks
Performance Evaluation - Performance modelling and evaluation of wireless ad hoc and sensor networks
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
On the batch arrival batch service queue with finite buffer under server's vacation: MX/GY/1/N queue
Computers & Mathematics with Applications
Breaking the collusion detection mechanism of morphmix
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
| Hi-index | 0.00 |
Anonymous network communication protocols provide privacy for Internet-based communication. In this paper, we focus on the performance and scalability of anonymity protocols. In particular, we develop performance models for two anonymity protocols from the prior literature (Buses and Taxis), as well as our own newly proposed protocol (Motorcycles). Using a combination of experimental implementation, simulation, and analysis, we show that: (1) the message latency of the Buses protocol is O(N^2), scaling quadratically with the number of participants; (2) the message latency of the Taxis protocol is O(N), scaling linearly with the number of participants; (3) the message latency of the Motorcycles protocol is O(log^2N), scaling logarithmically with the number of participants. Motorcycles can provide scalable anonymous network communication, without compromising the strength of anonymity provided by Buses or Taxis.