Scalable and Secure Polling in Dynamic Distributed Networks

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n2) in an n nodes system, we present SPP (Secure and Private Polling), the first distributed polling protocol requiring only a communication complexity of O(n log3 n), which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates (1/2 - ϵ)n Byzantine nodes for any constant 1/2 >; ϵ >; 0 (not depending on n), and outputs the exact value of the poll with high probability. SPP is composed of two sub-protocols, which we believe to be interesting on their own: SPP-Overlay maintains a structured overlay when nodes leave or join the network, and SPP-Computation conducts the actual poll. We validate the practicality of our approach through experimental evaluations and describe briefly two possible applications of SPP: (1) an optimal Byzantine Agreement protocol whose communication complexity is Θ(n log n) and (2) a protocol solving an open question of King and Saia in the context of aggregation functions, namely on the feasibility of performing multiparty secure aggregations with a communication complexity of o(n2).

[1]  Aniket Kate,et al.  Computational Verifiable Secret Sharing Revisited , 2011, ASIACRYPT.

[2]  Gabriel Bracha,et al.  An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[3]  Richard Cleve,et al.  Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.

[4]  Christian Scheideler,et al.  Towards Scalable and Robust Overlay Networks , 2007, IPTPS.

[5]  Jared Saia,et al.  Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information , 2011, ICDCN.

[6]  Christian Scheideler,et al.  Towards a Scalable and Robust DHT , 2006, SPAA '06.

[7]  Martin Hirt,et al.  Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.

[8]  Eyal Kushilevitz,et al.  A zero-one law for Boolean privacy , 1989, STOC '89.

[9]  Anne-Marie Kermarrec,et al.  Computing in social networks , 2014, Inf. Comput..

[10]  Christian Scheideler,et al.  How to spread adversarial nodes?: rotate! , 2005, STOC '05.

[11]  Bruce M. Kapron,et al.  Fast asynchronous byzantine agreement and leader election with full information , 2008, SODA '08.

[12]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[14]  Jared Saia,et al.  From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits , 2009, DISC.

[15]  Oded Goldreich.  Foundations of Cryptography: Index , 2001 .

[16]  Jonathan Katz.  On achieving the "best of both worlds" in secure multiparty computation , 2007, STOC '07.

[17]  Stefan Schmid,et al.  Towards worst-case churn resistant peer-to-peer systems , 2010, Distributed Computing.

[18]  Jacques Stern,et al.  Practical multi-candidate election system , 2001, PODC '01.

[19]  Jared Saia,et al.  Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary , 2010, JACM.

[20]  Yehuda Lindell,et al.  Secure Computation without Agreement , 2002, DISC.

[21]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[22]  Mike Hibler,et al.  An integrated experimental environment for distributed systems and networks , 2002, OSDI '02.

[23]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..

[24]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[25]  Donald Beaver,et al.  Multiparty Computation with Faulty Majority , 1989, CRYPTO.

[26]  Christian Scheideler,et al.  Robust random number generation for peer-to-peer systems , 2006, Theor. Comput. Sci..

[27]  Christian Scheideler,et al.  A Distributed and Oblivious Heap , 2009, ICALP.

[28]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[29]  Ivan Damgård,et al.  Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.

[30]  Yi Mu,et al.  Efficient Non-interactive Range Proof , 2009, COCOON.

[31]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[32]  Bruce M. Kapron,et al.  Lower bound for scalable Byzantine Agreement , 2006, PODC.

[33]  Kouichi Sakurai,et al.  Distributed Paillier Cryptosystem without Trusted Dealer , 2010, WISA.

[34]  Ian Goldberg,et al.  Practical Robust Communication in DHTs Tolerating a Byzantine Adversary , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[35]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[36]  Donald Beaver,et al.  Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.

[37]  Oded Goldreich,et al.  Foundations of Cryptography: List of Figures , 2001 .

[38]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[39]  Ivan Damgård,et al.  A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.

[40]  Anne-Marie Kermarrec,et al.  Scalable and Secure Aggregation in Distributed Networks , 2011, ArXiv.

[41]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[42]  Christian Scheideler,et al.  A DoS-resilient information system for dynamic data management , 2009, SPAA '09.