L. Alvisi, A. Clement, and M. Dahlin, Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults, NSDI'09, 2009.

J. Benaloh, Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, CRYPTO'86, pp.251-260, 1986.

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert, Secretive Birds: Privacy in Population Protocols, OPODIS'07, pp.329-342, 2007.
DOI : 10.1007/978-3-540-77096-1_24
URL : https://hal.archives-ouvertes.fr/hal-00175536

D. Dutta, A. Goel, R. Govindan, and H. Zhang, The Design of a Distributed Rating Scheme for Peer-to-Peer Systems, Workshop on Economics of Peer-to-Peer Systems, 2003.

I. Gupta, K. Birman, P. Linga, A. Demers, and R. Van-renesse, Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead, IPTPS'03, pp.160-169, 2003.
DOI : 10.1007/978-3-540-45172-3_15

M. Gupta, P. Judge, and M. Ammar, A reputation system for peer-to-peer networks, Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video , NOSSDAV '03, pp.144-152, 2003.
DOI : 10.1145/776322.776346

A. Haeberlen, P. Kouznetsov, and P. Druschel, PeerReview: Practical Accountability for Distributed Systems, SOSP'07, pp.175-188, 2007.

H. Johansen, A. Allavena, and R. Van-renesse, Fireflies, ACM SIGOPS Operating Systems Review, vol.40, issue.4, pp.3-13, 2006.
DOI : 10.1145/1218063.1217937

D. Malkhi, O. Margo, and E. Pavlov, E-voting without ???Cryptography???, FC'02, pp.1-15, 2002.
DOI : 10.1007/3-540-36504-4_1

D. Malkhi and E. Pavlov, Anonymity without ???Cryptography???, FC'01, pp.108-126, 2001.
DOI : 10.1007/3-540-46088-8_12

T. Rabin and M. Ben-or, Verifiable secret sharing and multiparty protocols with honest majority, Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC '89, pp.73-85, 1989.
DOI : 10.1145/73007.73014

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, A Scalable Content-Addressable Network, SIGCOMM'01, pp.161-172, 2001.

R. Rivest, A. Shamir, and Y. Tauman, How to Share a Secret, Communications of the ACM, vol.22, pp.612-613, 1979.

M. Rodriguez-perez, O. Esparza, and J. L. Muñoz, Analysis of Peer-to-peer Distributed Reputation Schemes, 2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing, pp.1-6, 2005.
DOI : 10.1109/COLCOM.2005.1651237

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Middleware'01, pp.329-350, 2001.
DOI : 10.1007/3-540-45518-3_18

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, SIGCOMM'01, pp.149-160, 2001.

D. Weitzner, H. Abelson, T. Berners-lee, J. Feigenbaum, J. Hendler et al., Information accountability, Communications of the ACM, vol.51, issue.6, pp.82-87, 2008.
DOI : 10.1145/1349026.1349043

H. Yu, P. Gibbons, M. Kaminsky, and F. Xiao, SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks, SP'08, pp.3-17, 2008.

H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman, SybilGuard: Defending Against Sybil Attacks via Social Networks, IEEE/ACM Transactions on Networking, vol.16, issue.3, pp.576-589, 2008.
DOI : 10.1109/TNET.2008.923723