D. L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol.24, issue.2, pp.84-90, 1981.
DOI : 10.1145/358549.358563
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.8210

D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988.
DOI : 10.1007/BF00206326

D. M. Goldschlag, M. G. Reed, and P. F. Syverson, Hiding Routing information, In: Information Hiding, pp.137-150, 1996.
DOI : 10.1007/3-540-61996-8_37

M. K. Reiter and A. D. Rubin, Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol.1, issue.1, pp.66-92, 1998.
DOI : 10.1145/290163.290168
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.864

A. Pfitzmann and M. Hansen, A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management, pp.0-34, 2010.

H. Kikuchi, Sender and recipient anonymous communication without public key cryptography, CSEC, 1998.

G. Danezis, R. Dingledine, and N. Mathewson, Mixminion: design of a type III anonymous remailer protocol, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405), pp.2-15, 2003.
DOI : 10.1109/SECPRI.2003.1199323

P. F. Syverson, D. M. Goldschlag, and M. G. Reed, Anonymous connections and onion routing, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.44-54, 1997.
DOI : 10.1109/SECPRI.1997.601314
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.3883

M. G. Reed, P. F. Syverson, and D. M. Goldschlag, Anonymous connections and onion routing, IEEE Journal on Selected Areas in Communications, vol.16, issue.4, pp.482-494, 1998.
DOI : 10.1109/49.668972

P. Syverson, G. Tsudik, M. Reed, and C. Landwehr, Towards an Analysis of Onion Routing Security, In: Designing Privacy Enhancing Technologies, pp.96-114, 2001.
DOI : 10.1007/3-540-44702-4_6

R. Dingledine, N. Mathewson, and P. Syverson, Tor: The second-generation onion router, 2004.

A. Mislove, G. Oberoi, A. Post, C. Reis, P. Druschel et al., AP3, Proceedings of the 11th workshop on ACM SIGOPS European workshop: beyond the PC , EW11, p.30, 2004.
DOI : 10.1145/1133572.1133578

M. J. Freedman and R. Morris, Tarzan, Proceedings of the 9th ACM conference on Computer and communications security , CCS '02, pp.193-206, 2002.
DOI : 10.1145/586110.586137

M. Rennhard and B. Plattner, Introducing MorphMix, Proceeding of the ACM workshop on Privacy in the Electronic Society , WPES '02, pp.91-102, 2002.
DOI : 10.1145/644527.644537

C. Gentry, Computing arbitrary functions of encrypted data, Communications of the ACM, vol.53, issue.3, pp.97-105, 2010.
DOI : 10.1145/1666420.1666444

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Advances in cryptology ? Eurocrypt'99, pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16

I. Damgård and M. Jurik, A generalisation, a simpli. cation and some applications of paillier's probabilistic public-key system, pp.119-136, 2001.

G. Danezis and R. Clayton, Introducing traffic analysis, 2007.

R. Pries, W. Yu, X. Fu, and W. Zhao, A New Replay Attack Against Anonymous Communication Networks, 2008 IEEE International Conference on Communications, pp.1578-1582, 2008.
DOI : 10.1109/ICC.2008.305
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.904

J. R. Douceur, The Sybil Attack, pp.251-260, 2002.
DOI : 10.1007/3-540-45748-8_24

D. Kedogan, D. Agrawal, and S. Penz, Limits of Anonymity in Open Environments, In: Information Hiding, pp.53-69, 2003.
DOI : 10.1007/3-540-36415-3_4

G. Danezis, Statistical Disclosure Attacks, pp.421-426, 2003.
DOI : 10.1007/978-0-387-35691-4_40

C. Diaz, S. Seys, J. Claessens, and B. Preneel, Towards Measuring Anonymity, In: Privacy Enhancing Technologies, pp.54-68, 2003.
DOI : 10.1007/3-540-36467-6_5

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord, ACM SIGCOMM Computer Communication Review, vol.31, issue.4, pp.149-160, 2001.
DOI : 10.1145/964723.383071

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, pp.329-350, 2001.
DOI : 10.1007/3-540-45518-3_18
URL : http://admis.fudan.edu.cn/member/yztang/Papers/P2P/overlay/Pastry Scalable, decentralized object location and routing for large scale p2p systems.pdf