]. K. Abrahamson, A. Adler, R. Gelbart, L. Higham, and D. Kirkpatrick, The Bit Complexity of Randomized Leader Election on a Ring, SIAM Journal on Computing, vol.18, issue.1, pp.12-29, 1989.
DOI : 10.1137/0218002

M. Kawazoe, A. , and S. Toueg, A simple bivalency proof that t-resilient consensus requires t + 1 rounds, Inf. Process. Lett, vol.71, pp.3-4155, 1999.

D. Angluin, Local and global properties in networks of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing , STOC '80, pp.82-93, 1980.
DOI : 10.1145/800141.804655

S. Arévalo, A. F. Anta, D. Imbs, E. Jiménez, and M. Raynal, Failure detectors in homonymous distributed systems (with an application to consensus), ICDCS, pp.275-284, 2012.

J. Aspnes, F. E. Fich, and E. Ruppert, Relationships between broadcast and shared memory in reliable anonymous distributed systems, Distributed Computing, vol.34, issue.3, pp.209-219, 2006.
DOI : 10.1007/s00446-005-0145-4

H. Attiya, A. Gorbach, and S. Moran, Computing in Totally Anonymous Asynchronous Shared Memory Systems, Information and Computation, vol.173, issue.2, pp.162-183, 2002.
DOI : 10.1006/inco.2001.3119

H. Attiya and J. Welch, Distributed Computing: fundamentals, simulations and advanced topics, 2004.
DOI : 10.1002/0471478210

P. Bansal, P. Gopal, A. Gupta, K. Srinathan, and P. K. Vasishta, Byzantine Agreement Using Partial Authentication, DISC, pp.389-403, 2011.
DOI : 10.1007/BF01667080

O. Berthold, H. Federrath, and M. Köhntopp, Project ?Äú anonymity and unobservability in the internet ?Äù, Proceedings of the tenth conference on Computers, freedom and privacy: challenging the assumptions, CFP '00, pp.57-65, 2000.

P. Boldi and S. Vigna, Computing anonymously with arbitrary knowledge, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.181-188, 1999.
DOI : 10.1145/301308.301355

P. Boldi and S. Vigna, An Effective Characterization of Computability in Anonymous Networks, DISC, pp.33-47, 2001.
DOI : 10.1007/3-540-45414-4_3

F. Bonnet and M. Raynal, The Price of Anonymity, ACM Transactions on Autonomous and Adaptive Systems, vol.6, issue.4, p.23, 2011.
DOI : 10.1145/2019591.2019592
URL : https://hal.archives-ouvertes.fr/inria-00348302

C. Stephen, C. A. Bono, F. Soghoian, and . Monrose, Mantis: A lightweight, server-anonymity preserving, searchable p2p network, INFORMATION SECURITY INSTITUTE, 2004.

H. Buhrman, A. Panconesi, R. Silvestri, and P. M. Vitányi, On the importance of having an identity or, is consensus really universal? Distributed Computing, pp.167-176, 2006.

J. E. Burns and J. K. Pachl, Uniform self-stabilizing rings, ACM Trans. Program

T. Deepak, C. , and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.

B. Charron-bost and A. Schiper, Uniform consensus is harder than consensus, Journal of Algorithms, vol.51, issue.1, pp.15-37, 2004.
DOI : 10.1016/j.jalgor.2003.11.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.8980

D. Chaum and E. Van-heyst, Group Signatures, Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques , EUROCRYPT'91, pp.257-265, 1991.
DOI : 10.1007/3-540-46416-6_22

D. Chaum and E. Van-heyst, Group Signatures, EUROCRYPT, pp.257-265, 1991.
DOI : 10.1007/3-540-46416-6_22

C. Delporte, -. Gallet, and H. Fauconnier, Two Consensus Algorithms with Atomic Registers and Failure Detector ??, Lecture Notes in Computer Science, vol.73, issue.5-6, pp.251-262, 2009.
DOI : 10.1016/S0020-0190(00)00027-2

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, A. Kermarrec, E. Ruppert et al., Byzantine agreement with homonyms, PODC, pp.21-30, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00580133

C. Delporte-gallet, H. Fauconnier, and A. Tielmann, Fault-Tolerant Consensus in Unknown and Anonymous Networks, 2009 29th IEEE International Conference on Distributed Computing Systems, pp.368-375, 2009.
DOI : 10.1109/ICDCS.2009.36
URL : https://hal.archives-ouvertes.fr/hal-00369280

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Commun

D. Dolev, C. Dwork, and L. Stockmeyer, On the minimal synchronism needed for distributed consensus, Journal of the ACM, vol.34, issue.1, pp.77-97, 1987.
DOI : 10.1145/7531.7533

D. Dolev, M. J. Fischer, R. J. Fowler, N. A. Lynch, and H. R. Strong, An efficient algorithm for byzantine agreement without authentication, Information and Control, vol.52, issue.3, pp.257-274, 1982.
DOI : 10.1016/S0019-9958(82)90776-8

D. Dolev, R. Reischuk, and H. R. Strong, Early stopping in Byzantine agreement, Journal of the ACM, vol.37, issue.4, pp.720-741, 1990.
DOI : 10.1145/96559.96565

D. Dolev and H. R. Strong, Polynomial algorithms for multiple processor agreement, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.401-407, 1982.
DOI : 10.1145/800070.802215

D. Dolev and H. R. Strong, Authenticated Algorithms for Byzantine Agreement, SIAM Journal on Computing, vol.12, issue.4, pp.656-666, 1983.
DOI : 10.1137/0212045

R. John and . Douceur, The sybil attack, IPTPS, pp.251-260, 2002.

C. Dwork, N. A. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988.
DOI : 10.1145/42282.42283

C. Dwork and Y. Moses, Knowledge and common knowledge in a Byzantine environment: Crash failures, Information and Computation, vol.88, issue.2, pp.156-186, 1990.
DOI : 10.1016/0890-5401(90)90014-9

M. J. Fischer, N. A. Lynch, and N. A. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, vol.14, issue.4, pp.183-186, 1981.
DOI : 10.1016/0020-0190(82)90033-3

M. J. Fischer, N. A. Lynch, and M. Merritt, Easy impossibility proofs for distributed consensus problems, Proceedings of the fourth annual ACM symposium on Principles of distributed computing , PODC '85, pp.26-39, 1986.
DOI : 10.1145/323596.323602

S. , D. Gordon, J. Katz, R. Kumaresan, and A. Yerukhimovich, Authenticated broadcast with a partially compromised public-key infrastructure, SSS, pp.144-158, 2010.

R. Guerraoui, Revisiting the relation between non-blocking atommic commitment and consensus

R. Guerraoui, P. Kouznetsov, and B. Pochon, A Note on Set Agreement with Omission Failures1 1This work is partially supported by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322., Electronic Notes in Theoretical Computer Science, vol.81, pp.48-58, 2003.
DOI : 10.1016/S1571-0661(04)80835-1

R. Guerraoui and E. Ruppert, Anonymous and fault-tolerant shared-memory computing, Distributed Computing, pp.165-177, 2007.
DOI : 10.1007/s00446-007-0042-0

A. Gupta, P. Gopal, P. Bansal, and K. Srinathan, Authenticated Byzantine Generals in Dual Failure Model, ICDCN, pp.79-91, 2010.
DOI : 10.1007/978-3-642-11322-2_12

. Shing-tsaan and . Huang, Leader election in uniform rings, ACM Trans. Program. Lang. Syst, vol.15, issue.3, pp.563-573, 1993.

P. Jayanti and S. Toueg, Wakeup under read/write atomicity, Proc. 4th International Workshop on Distributed Algorithms, pp.277-288, 1990.
DOI : 10.1007/3-540-54099-7_19

V. King and J. Saia, Scalable byzantine computation, ACM SIGACT News, vol.41, issue.3, pp.89-104, 2010.
DOI : 10.1145/1855118.1855136

V. Garg and . Kumar, Elements of Distributed Computing, 2002.

S. Kutten, G. Pandurangan, D. Peleg, P. Robinson, and A. Trehan, Sublinear bounds for randomized leader election, ICDCN, pp.348-362, 2013.

L. Lamport, Using Time Instead of Timeout for Fault-Tolerant Distributed Systems., ACM Transactions on Programming Languages and Systems, vol.6, issue.2, pp.254-280, 1984.
DOI : 10.1145/2993.2994

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1697

M. C. Loui and H. H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, 1987.

N. A. Lynch, Distributed Algorithms, 1996.

O. Michail, I. Chatzigiannakis, and P. G. Spirakis, Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks, Lecture Notes in Computer Science, vol.7611, pp.437-438
DOI : 10.1007/978-3-642-33651-5_46

C. Mohan, R. Strong, and S. Finkelstein, Methods for distributed transaction commit and recovery using Byzantine agreement within clusters of processors, pp.89-103

G. Neiger and S. Toueg, Automatically increasing the fault-tolerance of distributed algorithms, Journal of Algorithms, vol.11, issue.3, pp.374-419, 1990.
DOI : 10.1016/0196-6774(90)90019-B

J. Newsome, E. Shi, D. X. Song, and A. Perrig, The sybil attack in sensor networks, Proceedings of the third international symposium on Information processing in sensor networks , IPSN'04, pp.259-268, 2004.
DOI : 10.1145/984622.984660

M. Okun, Agreement Among Unacquainted Byzantine Generals, Lecture Notes in Computer Science, vol.3724, pp.499-500
DOI : 10.1007/11561927_40

P. Raipin, P. , and M. Raynal, Uniform agreement despite process omission failures, IPDPS, page 212, 2003.

P. Raipin, P. , and M. Raynal, Optimal early stopping uniform consensus in synchronous systems with process omission failures, SPAA, pp.302-310, 2004.

M. Pease, R. Shostak, and L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980.
DOI : 10.1145/322186.322188

J. Kenneth, S. Perry, and . Toueg, Distributed agreement in the presence of processor and communication faults, IEEE Trans. Software Eng, vol.12, issue.3, pp.477-482, 1986.

M. Raynal, Consensus in synchronous systems: a concise guided tour, 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings., pp.221-228, 2002.
DOI : 10.1109/PRDC.2002.1185641

K. Michael, A. D. Reiter, and . Rubin, Crowds: anonymity for web transactions

I. T. Antony, P. Rowstron, and . Druschel, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Middleware, pp.329-350, 2001.

T. K. Srikanth and S. Toueg, Simulating authenticated broadcasts to derive simple fault-tolerant algorithms, Distributed Computing, pp.80-94, 1987.
DOI : 10.1007/BF01667080

M. Steiner, T. En-najjary, and E. W. Biersack, Exploiting KAD, ACM SIGCOMM Computer Communication Review, vol.37, issue.5, pp.65-70, 2007.
DOI : 10.1145/1290168.1290176

I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, ACM SIGCOMM, pp.149-160, 2001.

S. Toueg, K. J. Perry, and T. K. Srikanth, Fast Distributed Agreement, SIAM Journal on Computing, vol.16, issue.3, pp.445-457, 1987.
DOI : 10.1137/0216031

X. Wang and H. Yu, How to Break MD5 and Other Hash Functions, EUROCRYPT, pp.19-35, 2005.
DOI : 10.1007/11426639_2

Z. Xu and P. K. Srimani, SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE, IPDPS. IEEE Computer Society, 2005.
DOI : 10.1142/S0129054106003851

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568