Towards secure and scalable computation in peer-to-peer networks

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 87-96

  King, Valerie ^a   Saia, Jared ^b   Sanwalani, Vishal ^c   Vee, Erik ^d  

^a UNIVERSITY OF VICTORIA   (Canada)

^b University of New Mexico   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE AGREEMENT AND LEADER ELECTION; INFORMATION MODEL; MALICIOUS ADVERSARY; PEER-TO-PEER NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; PROGRAM PROCESSORS; SECURITY OF DATA;

COMPUTATION THEORY;

EID: 38049008242     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.77     Document Type: Conference Paper

References (29)

1. Z. Abrams, R. McGrew, and S. Plotkin. Keeping peers honest in eigentrust. In 2nd Workshop on the Economics of Peer-to-Peer Systems, 2004.
2. B. Awerbuch and C. Scheideler. Group spreading: A protocol for provably secure distributed name service. In Thirty-First Int. Colloquium on Automata, Languages, and Programming (ICALP), 2004.
3. M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation. In Proceedings of the Twenty-Fifth ACM Symposium on the Theory of Computing (STOC), 1993.
4. M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computations with optimal resilience. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 183-192, 1994.
5. M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in O(log n) rounds. In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC), 2006.
6. M. Ben-Or and D. Ron. Agreement in the presence of faults, on networks of bounded degree. Information Processing Letters, 1996.
7. P. Berman and J. Garay. Asymptotically optimal distributed consensus. In Proceedings ICALP 89 (16th International Colloquium on Automata, Languages and Programming), 1989.
8. P. Berman and J. Garay. Fast consensus in networks of bounded degree. In Fourth International Workshop on Distributed Algorithms, 1990.
9. J. Canny. Collaborative filtering with privacy. In IEEE Symposium on Security and Privacy, 2002.
10. J. Cooper and N. Linial. Fast perfect-information leader-election protocol with linear immunity. Combinatorica, 15:319-332, 1995.
11. S. Datta, K. Bhaduri, C. Giannella, R. Wolff, and H. Kargupta. Distributed data mining in peer-to-peer networks. In IEEE Internet Computing special issue on Distributed Data Mining, 2005.
12. D. Dolev, M. Fischer, R. Fowler, N. Lynch, and H. Strong. An efficient algorithm for byzantine agreement without authentication. Information and Control, 1982.
13. D. Dolev and R. Reischuk. Bounds on information exchange for byzantine agreement. In Proceedings of the first annual ACM symposium on Principles of distributed computing(PODC), 1982.
14. C. Dwork, D. Peleg, N. Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. SIAM Journal on Computing, 17:975-988, 1988.
15. U. Feige. Noncryptographic selection protocols. In Proceedings of 40th IEEE Foundations of Computer Science(FOCS), 1999.
16. A. Fiat and J. Saia. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms (SODA), 2002.
17. H. Garcia-Molina, F. Pittelli, and S. Davidson. Is byzantine agreement useful in a distributed database? In the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, 1984.
18. H. Garcia-Molina, F. Pittelli, and S. Davidson. Applications of byzantine agreement in database systems. ACM Transactions on Database Systems (TODS), 1986.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proceedings of the Nineteenth ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
20. K. Hildrum and J. Kubiatowicz. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In Proceedings of the 17th International Symposium on Distributed Computing, 2004.
21. S. Kamvar, M. Sclosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in p2p networks. In Proceedings of the 12th International World Wide Web Conference (WWW), 2003.
22. V. King, J. Saia, V. Sanwalani, and E. Vee. Scalable leader election. In Proceedings of 27th ACM-SIAMSymposium on Discrete Algorithms(SODA), 2006.
23. D. Malan and M. Smith. Host-based detection of worms through peer-to-peer cooperation. In Third Workshop on Rapid Malcode (WORM), 2005.
24. M. Naor and U. Wieder. A simple fault tolerant distributed hash table. In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS), 2003.
25. C. Scheideler. How to spread adversarial nodes? rotate! In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC), 2005.
26. E. Upfal. Tolerating linear number of faults in networks of bounded degree. In 10th Annual Symposium on Principles of Distributed Computing(PODC), 1992.
27. V. Vlachos, S. Androutsellis-Theotokis, and D. Spinellis. Security applications of peer-to-peer networks. Computer Networks, 45:195-205, 2004.
28. C. Website. http://cloudmark.com/.
29. A. Yao. Protocols for Secure Computations. In Proceedings of the Twenty-Third IEEE Symposium on the Foundations of Computer Science (FOCS), pages 160-164, 1982.