C. Aguilar, M. , and Y. Deswarte, pMIX : Untraceability for Small Hiding Groups, Fourth IEEE International Symposium on Network Computing and Applications, pp.29-40, 2005.

C. Aguilar, M. , and Y. Deswarte, From DC-nets to pMIXes : multiple variants for anonymous communications, Fifth IEEE International Symposium on Network Computing and Applications, pp.163-172, 2006.

A. Acquisti, R. Dingledine, and P. F. Syverson, On the Economics of Anonymity, Financial Cryptography, pp.84-102, 2003.
DOI : 10.1007/978-3-540-45126-6_7

C. Aguilar and M. , An overview of single-database private information retrieval schemes and their performances, 2006.

A. Melchor, Anonymous Communication on Local Area Networks, 2006.

A. Ambainis, Upper bound on the communication complexity of private information retrieval, ICALP, pp.401-407, 1997.
DOI : 10.1007/3-540-63165-8_196

J. Bos, . Bert, and . Boer, Detection of Disrupters in the DC Protocol, Advances in Cryptology? EUROCRYPT 89, pp.320-328, 1990.
DOI : 10.1007/3-540-46885-4_33

D. Boneh, E. Goh, and K. Nissim, Evaluating 2-DNF Formulas on Ciphertexts, TCC 2005, pp.325-341, 2005.
DOI : 10.1007/978-3-540-30576-7_18

A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond, Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002.
DOI : 10.1109/SFCS.2002.1181949

[. Back, U. Möller, and A. Stiglic, Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems, Proceedings of Information Hiding Workshop, pp.245-257, 2001.
DOI : 10.1007/3-540-45496-9_18

O. Berthold, A. Pfitzmann, and R. Standtke, The Disadvantages of Free MIX Routes and How to Overcome Them, Workshop on Design Issues in Anonymity and Unobservability, pp.30-45, 2000.
DOI : 10.1007/3-540-44702-4_3

F. Ernest, Y. Brickell, and . Yacobi, On Privacy Homomorphisms (Extended Abstract), Advances in Cryptology?EUROCRYPT, pp.117-125

A. David, K. Cooper, and . Birman, Preserving Privacy in a Network of Mobile computers, IEEE Symposium on Security and Privacy, pp.26-38, 1995.

B. Chor and N. Gilboa, Computationally private information retrieval (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.304-313, 1997.
DOI : 10.1145/258533.258609
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.2905

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private Information Retrieval, FOCS : IEEE Symposium on Foundations of Computer Science (FOCS), 1995.

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

D. Chaum, Security without identification: transaction systems to make big brother obsolete, Communications of the ACM, vol.28, issue.10, pp.1030-1044, 1985.
DOI : 10.1145/4372.4373
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.319.3690

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

Y. Chang, Single Database Private Information Retrieval with Logarithmic Communication, ACISP : Information Security and Privacy : Australasian Conference, 2004.
DOI : 10.1007/978-3-540-27800-9_5

S. Cms99-]-christian-cachin, M. Micali, and . Stadler, Computationally Private Information Retrieval with Polylogarithmic Communication, EURO- CRYPT : Advances in Cryptology : Proceedings of EUROCRYPT, 1999.

Y. Deswarte and C. A. Melchor, Technologies Actuelles et Futures Pour la Protection de la Vie Priv??e sur Internet, annals of telecommunications - annales des t??l??communications, vol.1514, issue.1, pp.399-417, 2006.
DOI : 10.1007/BF03219914

Y. Deswarte and C. A. Melchor, Protection de la vie privée sur Internet. Revue de l'Électricité et de l'Électronique (REE) à paraître en, 2006.

Y. Deswarte and C. A. Melchor, Technologies de protection de la vie privée sur Internet, dans Sécurité des systèmes d'information, Réseaux et Télécoms. Hermès-Science, pp.49-72, 2006.

G. Danezis, The Implementation of an Auction Protocol over Anonymous Networks, 2000.

G. Danezis, The Traffic Analysis of Continuous-Time Mixes, Proceedings of Privacy Enhancing Technologies workshop, 2004.
DOI : 10.1007/11423409_3

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), 2003.
DOI : 10.1109/SECPRI.2003.1199323

J. Domingo-ferrer, A new privacy homomorphism and applications, Information Processing Letters, vol.60, issue.5, pp.277-282, 1996.
DOI : 10.1016/S0020-0190(96)00170-6

W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-652, 1976.
DOI : 10.1109/TIT.1976.1055638

I. Damgård and M. Jurik, A Length-Flexible Threshold Cryptosystem with Applications, ACISP 2003, pp.350-364, 2003.

R. Dingledine, N. Mathewson, and P. F. Syverson, Tor : The Second- Generation Onion Router, USENIX Security Symposium, pp.303-320, 2004.

S. Dolev and R. Ostrovsky, Xor-Trees for Efficient Anonymous Multicast and Reception. j-TISSEC, pp.63-84, 2000.

J. Douceur, The Sybil Attack, Proceedings of the 1st International Peer To Peer Systems Workshop Mars, 2002.
DOI : 10.1007/3-540-45748-8_24

C. Díaz and B. Preneel, Taxonomy of Mixes and Dummy Traffic, International Information Security Workshops, pp.215-230, 2004.
DOI : 10.1007/1-4020-8145-6_18

C. Díaz and A. Serjantov, Generalising Mixes, Proceedings of Privacy Enhancing Technologies workshop, 2003.
DOI : 10.1007/978-3-540-40956-4_2

J. Michael, R. Freedman, and . Morris, Tarzan : a Peer-to-Peer Anonymizing Network Layer Malicious Bots Threaten Network Security, ACM Conference on Computer and Communications Security, pp.193-20618, 2002.

P. Golle and A. Juels, Dining Cryptographers Revisited, LNCS, vol.3027, pp.456-473, 2004.
DOI : 10.1007/978-3-540-24676-3_27

P. Golle and A. Juels, Parallel mixing, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, 2004.
DOI : 10.1145/1030083.1030113

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9

C. Gentry and Z. Ramzan, Single-Database Private Information Retrieval with Constant Communication Rate, ICALP : Annual International Colloquium on Automata, Languages and Programming, 2005.
DOI : 10.1007/11523468_65

M. David, M. G. Goldschlag, P. F. Reed, and . Syverson, Onion Routing, Communications ACM, vol.42, issue.2, pp.39-41, 1999.

C. Gülcü and G. Tsudik, Mixing E-mail with Babel, Proceedings of Internet Society Symposium on Network and Distributed Systems Security, pp.2-16, 1996.
DOI : 10.1109/NDSS.1996.492350

M. Jakobsson, Flash mixing, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, 1999.
DOI : 10.1145/301308.301333

J. Soulès, Téléphonie : pourquoi n'externalisez-vous pas, 01 Informatique, pp.38-41, 2006.

A. Müller, B. Pfitzmann, M. Pfitzmann, and . Waidner, Real-Time MIXes : A Bandwidth-Efficient Anonymity Protocol, IEEE Journal on Selected Areas in Communications, vol.16, issue.4, 1998.

D. Kesdogan, J. Egner, and R. Büschkes, Stop- and- Go-MIXes Providing Probabilistic Anonymity in an Open System, Proceedings of Information Hiding Workshop, 1998.
DOI : 10.1007/3-540-49380-8_7

E. Kushilevitz and R. Ostrovsky, Replication Is Not Needed : Single Database, Computationally-Private Information Retrieval (extended abstract)

H. Lipmaa, An Oblivious Transfer Protocol with Log-Squared Communication, LNCS, vol.3650, pp.314-328, 2005.
DOI : 10.1007/11556992_23

B. Neil-levine and C. Shields, Hordes: a multicast based protocol for anonymity1, Journal of Computer Security, vol.10, issue.3, pp.213-240, 2002.
DOI : 10.3233/JCS-2002-10302

E. Mann, Private Access to Distributed Information, 2004.

D. Michael and M. , Local anonymity in the Internet, 1999.

J. Steven, G. Murdoch, and . Danezis, Low-Cost Traffic Analysis of Tor, Proceedings of the 2005 IEEE Symposium on Security and Privacy. IEEE CS, 2005.

M. Mitomo and K. Kurosawa, Attack for Flash MIX, Proceedings of ASIACRYPT 2000, 1976.
DOI : 10.1007/3-540-44448-3_15

S. Micali, C. Rackoff, and B. Sloan, The Notion of Security for Probabilistic Cryptosystems, SIAM Journal on Computing, vol.17, issue.2, 1988.
DOI : 10.1137/0217025

. Nis and . Nist, Random Number Generation

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT : Advances in Cryptology : Proceedings of EUROCRYPT, 1999.
DOI : 10.1007/3-540-48910-X_16

A. Pfitzmann, How to Implement Isdns Without User Observability some Remarks, 1985.

A. Pfitzmann, Diensteintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz, 1990.
DOI : 10.1007/978-3-642-75544-6

A. Pfitzmann and M. Köhntopp, Anonymity, Unobservability, and Pseudonymity ??? A Proposal for Terminology, Designing Privacy Enhancing Technologies, pp.1-9, 2000.
DOI : 10.1007/3-540-44702-4_1

[. Pfitzmann and A. Pfitzmann, How to Break the Direct RSA-Implementation of Mixes, Proceedings of EUROCRYPT 1989, 1990.
DOI : 10.1007/3-540-46885-4_37

A. Pfitzmann, B. Pfitzmann, and M. Waidner, ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead, Proceedings of the GI/ITG Conference on Communication in Distributed Systems Fevrier 1991. [PW85] Andreas Pfitzmann and Michael Waidner. Networks without User Observability?Design Options Advances in Cryptology?EUROCRYPT 85, pp.451-463
DOI : 10.1007/978-3-642-76462-2_32

J. Raymond, Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems, Proceedings of Designing Privacy Enhancing Technologies : Workshop on Design Issues in Anonymity and Unobservability, pp.10-29, 2000.
DOI : 10.1007/3-540-44702-4_2

M. Rennhard and B. Plattner, Practical Anonymity for the Masses with MorphMix, Financial Cryptography, pp.233-250, 2004.
DOI : 10.1007/978-3-540-27809-2_24

K. Michael, A. D. Reiter, and . Rubin, Crowds : Anonymity for Web Transactions, ACM Trans. Inf. Syst. Secur, vol.1, issue.1, pp.66-92, 1998.

[. Sherwood, B. Bhattacharjee, and A. Srinivasan, P5 : A Protocol for Scalable Anonymous Communication, IEEE Symposium on Security and Privacy, p.58, 2002.

R. Steinwandt and W. Geiselmann, Cryptanalysis of Polly Cracker, IEEE Transactions on Information Theory, vol.48, issue.11, pp.2990-2991, 2002.
DOI : 10.1109/TIT.2002.804112

P. Julien and . Stern, A New Efficient All-Or-Nothing Disclosure of Secrets Protocol, ASIACRYPT, pp.357-371, 1998.

A. Luis-von-ahn, N. J. Bortz, and . Hopper, k-Anonymous Message Transmission, ACM Conference on Computer and Communications Security, pp.122-130, 2003.

M. Waidner, Unconditional Sender and Recipient Untraceability in Spite of Active Attacks, Advances in Cryptology?EUROCRYPT 89, pp.302-319, 1989.
DOI : 10.1007/3-540-46885-4_32

M. Waidner and B. Pfitzmann, The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability, Advances in Cryptology?EUROCRYPT 89, pp.690-700, 1989.
DOI : 10.1007/3-540-46885-4_69

G. Yao and D. Feng, A New k-Anonymous Message Transmission Protocol, WISA, pp.388-399, 2004.
DOI : 10.1007/978-3-540-31815-6_31