Scalable and secure polling in dynamic distributed networks

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2012, Pages 181-190

  Gambs, Sebastien ^a   Guerraoui, Rachid ^b   Harkous, Hamza ^c   Huc, Florian ^b   Kermarrec, Anne Marie ^c  

^a UNIVERSITÉ DE RENNES 1   (France)

^b EPFL   (Switzerland)

^c INRIA   (France)

Author keywords

byzantine agreement; distributed; dynamic networks; multiparty computation; polling; privacy

Indexed keywords

BYZANTINE AGREEMENT; DISTRIBUTED; DYNAMIC NETWORK; MULTIPARTY COMPUTATION; POLLING;

COMMUNICATION; DATA PRIVACY; OPTIMIZATION; PUBLIC KEY CRYPTOGRAPHY; SURVEYS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84874299376     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SRDS.2012.63     Document Type: Conference Paper

References (43)

1. L. Lamport, R. Shostak, and M. Pease, "The byzantine generals problem", ACM Transactions on Programming Languages and Systems (TOPLAS'82), vol. 4, no. 3, pp. 382-401, 1982.
2. O. Baudron, P.A. Fouque, D. Pointcheval, J. Stern, and G. Poupard, "Practical Multi-Candidate Election System", in 20th annual ACM symposium on Principles of distributed computing (PODC'01), 2001, pp. 274-283.
3. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game", in 19th annual ACM symposium on Theory of computing (STOC'87), 1987, pp. 218-229.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation", in 20th annual ACM symposium on Theory of computing (STOC'88), 1988, pp. 1-10.
5. Z. Beerliová-Trubiniová and M. Hirt, "Perfectly-secure MPC with linear communication complexity", in 5th conference on Theory of cryptography (TCC'08), 2008, pp. 213-230.
6. D. Dolev and H. R. Strong, "Authenticated algorithms for byzantine agreement", SIAM Journal on Computing, vol. 12, no. 4, pp. 656-666, 1983.
7. Danny Dolev and Rüdiger Reischuk, "Bounds on information exchange for byzantine agreement", J. ACM, vol. 32, no. 1, pp. 191-204, Jan. 1985.
8. B. Awerbuch and C. Scheideler, "Towards a Scalable and Robust DHT", Theory of Computing Systems, vol. 45, no. 2, pp. 234-260, 2009.
9. I. Damg ard and M. Jurik, "A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System", in Public Key Cryptography (PKC'01), 2001, pp. 119-136.
10. V. King and J. Saia, "From almost everywhere to everywhere: Byzantine agreement with -o(n3/2) bits", Distributed Computing, pp. 464-478, 2009.
11. D. Holtby, B.M. Kapron, and V. King, "Lower bound for scalable byzantine agreement", Distributed Computing, vol. 21, no. 4, pp. 239-248, 2008.
12. B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar, "An integrated experimental environment for distributed systems and networks", in 5th Symposium on Operating Systems Dessign and Implementation (OSDI'02), 2002, pp. 255-270.
13. Christian Scheideler, "How to spread adversarial nodes? rotate!", in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, New York, NY, USA, 2005, STOC'05, pp. 704-713, ACM.
14. Baruch Awerbuch and Christian Scheideler, "Towards a scalable and robust dht", in Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, New York, NY, USA, 2006, SPAA'06, pp. 318-327, ACM.
15. O. Goldreich, Foundations of cryptography: Basic tools, Cambridge Univ Press, 2001.
16. B. Awerbuch and C. Scheideler, "Towards scalable and robust overlay networks", in 6th International Workshop on Peer-To-Peer Systems (IPTPS'07), 2007.
17. Matthias Baumgart, Christian Scheideler, and Stefan Schmid, "A dos-resilient information system for dynamic data management", in Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, New York, NY, USA, 2009, SPAA '09, pp. 300-309, ACM.
18. Christian Scheideler and Stefan Schmid, "A distributed and oblivious heap", in Proceedings of the 36th Internatilonal Colloquium on Automata, Languages and Programming: Part II, Berlin, Heidelberg, 2009, ICALP'09, pp. 571-582, Springer-Verlag.
19. Fabian Kuhn, Stefan Schmid, and Roger Wattenhofer, "Towards worst-case churn resistant peer-to-peer systems", Distributed Computing Journal (DC), vol. 22, no. 4, pp. 249-267, May 2010.
20. A-C. Yao, "Protocols for Secure Computations", 23rd Annual Symposium on Foundations of Computer Science (FOCS'82), pp. 160-164, 1982.
21. D. Chaum, C. Crépeau, and I. Damgard, "Multiparty Unconditionally Secure Protocols", 20th annual ACM symposium on Theory of computing (STOC'88), pp. 11-19, 1988.
22. D. Beaver, "Multiparty protocols tolerating half faulty processors", in Advances in Cryptology (CRYPTO'89), 1990, vol. 435 of Lecture Notes in Computer Science, pp. 560-572.
23. T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority", in 21rst annual ACM symposium on Theory of computing (STOC'89), 1989, pp. 73-85.
24. R. Cramer, I. Damg ard, S. Dziembowski, M. Hirt, and T. Rabin, "Efficient multiparty computations secure against an adaptive adversary", in Advances in Cryptology (Eurocrypt'99), 1999, pp. 311-326.
25. R. Cleve, "Limits on the security of coin flips when half the processors are faulty", in 18th annual ACM symposium on Theory of computing (STOC'86), 1986, pp. 364-369.
26. B. Chor and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", SIAM Journal on Discrete Mathematics, vol. 4, no. 1, pp. 36-47, 1991.
27. D. Beaver and S. Goldwasser, "Multiparty computation with faulty majority", in Advances in Cryptology (CRYPTO'89), 1990, pp. 589-590.
28. S. Goldwasser and Y. Lindell, "Secure computation without agreement", Distributed Computing, pp. 17-32, 2002.
29. Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell, and E. Petrank, "On achieving the best of both worlds in secure multiparty computation", SIAM journal on computing, vol. 40, no. 1, pp. 122-141, 2011.
30. A. Giurgiu, R. Guerraoui, K. Huguenin, and A-M. Kermarrec, "Computing in Social Networks", Lecture Notes in Computer Science, vol. 6366, pp. 332-346, 2010.
31. V. King and J. Saia, "Breaking the o(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary", in Proceeding of the 29th ACM symposium on Principles of distributed computing (PODC'10), 2010, pp. 420-429.
32. B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani, "Fast asynchronous byzantine agreement and leader election with full information", in Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA'08), 2008, pp. 1038-1047.
33. P. Paillier, "Public-key Cryptosystems based on Composite Degree Residuosity Classes", Advances in Cryptology (EUROCRYPT'99), 1999.
34. B. Awerbuch and C. Scheideler, "Robust random number generation for peer-to-peer systems", Principles of Distributed Systems, pp. 275-289, 2006.
35. S. Gambs, R. Guerraoui, H. Harkous, F. Huc, and A. Kermarrec, "Scalable and Secure Aggregation in Distributed Networks", Arxiv preprint 1107.5419, 2011.
36. M. Young, A. Kate, I. Goldberg, and M. Karsten, "Practical Robust Communication in DHTs Tolerating a Byzantine Adversary", in International Conference on Distributed Computing Systems (ICDCS'10), 2010, pp. 263-272.
37. Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch, "Verifiable secret sharing and achieving simultaneity in the presence of faults", in Proceedings of the 26th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, 1985, SFCS '85, pp. 383-395, IEEE Computer Society.
38. Arpita Patra Michael Backes, Aniket Kate, "Computational verifiable secret sharing revisited", in ASIACRYPT, Dong Hoon Lee and Xiaoyun Wang, Eds. 2011, vol. 7073 of Lecture Notes in Computer Science, pp. 590-609, Springer.
39. T. Nishide and K. Sakurai, "Distributed Paillier Cryptosystem without Trusted Dealer", Information Security Applications, pp. 44-60, 2011.
40. T. Yuen, Q. Huang, Y. Mu, W. Susilo, D. Wong, and G. Yang, "Efficient non-interactive range proof", in 15th Annual International Conference on Computing and Combinatorics (COCOON'09), 2009, pp. 138-147.
41. V. King, S. Lonargan, J. Saia, and A. Trehan, "Load balanced scalable byzantine agreement through quorum building, with full information", Distributed Computing and Networking, pp. 203-214, 2011.
42. G. Bracha, "An asynchronous [(n - 1)/3]-resilient consensus protocol", in Proceedings of the third annual ACM symposium on Principles of distributedcomputing (PODC'84), 1984, pp. 154-162.
43. Data and Privacy Lab, "Paillier threshold encryption toolbox", July 2011.