SkyHash: an Opinion Dynamics Model for Hash Consensus over P2P network

Traditional Byzantine consensus does not work in P2P network due to Sybil attack while the most prevalent Sybil-proof consensus at present still can’t resist advers ary with dominant compute power. This paper proposed a two-layered opinion dynamics model named SkyHash for hash consensus over P2P network. For hash consensus, failures are constrai ned due to the difficulty to create collision with big hash size, however, we identified DoS attack and extent our model to a DoS-proof one. Simulations show that on the SNAP dataset of the Wikipedia who-votes-on-whom network with reasonabl e latencies, the network will reach consensus within 45 secon ds, and it can also tolerant DoS attack committed by 7% random nodes or 0.9% top influential nodes, where no correct nodes decide on different hashes and 4% nodes refuse to decide, at the cost of 50% reduction of throughput. Comparing to compute power based consensus, our approach can resist any faulty or malic ious nodes by unfollowing them. To the best of our knowledge, it’sthe first work dedicated to hash consensus on P2P network based on opinion dynamics.

[1]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[2]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[3]  David Schwartz,et al.  The Ripple Protocol Consensus Algorithm , 2014 .

[4]  John Augustine,et al.  Fast byzantine agreement in dynamic networks , 2013, PODC '13.

[5]  Houwu Chen,et al.  Sky: an Opinion Dynamics Framework and Model for Consensus over P2P Network , 2015 .

[6]  Eli Upfal,et al.  Fault Tolerance in Networks of Bounded Degree , 1988, SIAM J. Comput..

[7]  Nikita Borisov,et al.  Computational Puzzles as Sybil Defenses , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[8]  Rida A. Bazzi,et al.  On the establishment of distinct identities in overlay networks , 2005, PODC '05.

[9]  Eli Upfal,et al.  Fault tolerance in networks of bounded degree , 1986, STOC '86.

[10]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[11]  A. Poelstra,et al.  A Treatise on Altcoins , 2014 .

[12]  Miguel Castro,et al.  Defending against eclipse attacks on overlay networks , 2004, EW 11.

[13]  Floriana Gargiulo,et al.  Opinion dynamics in a group-based society , 2010 .

[14]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[15]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[16]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[17]  S. Fortunato,et al.  Statistical physics of social dynamics , 2007, 0710.3256.

[18]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[19]  CastroMiguel,et al.  Secure routing for structured peer-to-peer overlay networks , 2002 .

[20]  Nicolas Courtois,et al.  On Subversive Miner Strategies and Block Withholding Attack in Bitcoin Digital Currency , 2014, ArXiv.

[21]  Silvio Lattanzi,et al.  SoK: The Evolution of Sybil Defense via Social Networks , 2013, 2013 IEEE Symposium on Security and Privacy.

[22]  David A. Lavis,et al.  Mean-Field Theory , 2015 .

[23]  J. Aspnes,et al.  Exposing Computationally-Challenged Byzantine Impostors , 2005 .