Pool-based anonymous communication framework for high-performance computing
- 65 Downloads
We propose and analyze in details the revised model of XPROB, an infinite family of pool-based anonymous communication systems that can be used in various applications including high performance computing environments. XPROB overcomes the limitations of APROB Channel that only resists a global delaying adversary (GDA). Each instance of XPROB uses a pool mix as its core component to provide resistance against a global active adversary (GAA), a stronger yet more practical opponent than a GDA. For XPROB, a GAA can drop messages from users but cannot break the anonymity of the senders of messages. Analysis and experimental evaluations show that each instance of XPROB provides greater anonymity than APROB Channel for the same traffic load and user behaviors (rate and number of messages sent). In XPROB, any message can be delivered with high probability within a few rounds after its arrival into the system; thus, an opponent cannot be certain when a message will be delivered. Furthermore, users can choose their own preference balance between anonymity and delay. Through the evaluation, we prove that XPROB can provide anonymity for users in high-performance computing environments.
KeywordsAnonymity system XPROB Pool-based anonymous communication framework Probabilistic real-time Global active adversary
Unable to display preview. Download preview PDF.
- 3.Danezis G (2002) Forward secure mixes. In: 7th Nordic workshop on secure IT systems, pp 195–207 Google Scholar
- 5.Dingledine R, Mathewson N, Syverson P (2004) Tor: the second-generation onion router. In: 13th USENIX security symposium, USENIX Association, pp 303–320 Google Scholar
- 7.Moeller U, Cottrell L, Palfrader P, Sassaman L (2002) Mixmaster protocol Google Scholar
- 9.Tran MT, Nguyen TT, Echizen I (2008) Pool-based APROB channel to provide resistance against global active adversary under probabilistic real-time condition. In: 2008 IEEE/IFIP international symposium on trust, security and privacy for pervasive applications (TSP-08). IEEE Computer Society, Los Alamitos, pp 257–263 Google Scholar
- 13.Danezis G, Dingledine R, Mathewson N (2003) Mixminion: design of a type III anonymous remailer protocol. In: Proceedings of the 2003 IEEE symposium on security and privacy. IEEE Computer Society, Los Alamitos, pp 2–15 Google Scholar
- 18.Diaz C (2004) Anonymity and privacy in electronic services. PhD thesis, KU Leuven Google Scholar
- 19.Serjantov A, Danezis G (2002) Towards an information theoretic metric for anonymity. In: Privacy enhancing technologies (PET, 2002). LNCS, vol 2482. Springer, Berlin, pp 259–263 Google Scholar
- 20.Diaz C, Seys S, Claessens J, Preneel B (2002) Towards measuring anonymity. In: Privacy enhancing technologies (PET, 2002). LNCS, vol 2482. Springer, Berlin, pp 184–188 Google Scholar
- 22.Serjantov A (2004) On the anonymity of anonymity systems. PhD thesis, University of Cambridge Google Scholar