Robust random number generation for peer-to-peer systems
作者： Baruch Awerbuch , Christian Scheideler
DOI: 10.1007/11945529_20
关键词: Random number generation 、 Computer science 、 Constant (computer programming) 、 Distributed computing 、 Adversarial system 、 Fraction (mathematics) 、 Generator (mathematics) 、 Peer-to-peer 、 State (computer science) 、 Overlay network
摘要: We consider the problem of designing an efficient and robust distributed random number generator for peer-to-peer systems that is easy to implement works even if all communication channels are public. A crucial avoiding adversarial join-leave attacks on overlay networks. show our new together with a light-weight rule recently proposed in [4] keeping peers well-distributed can keep various structured networks state under constant fraction peers.
springer.com
acm.org 
sci-hub.st 参考文章(33)
HariGovind V Ramasamy, Christian Cachin, None, Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast international conference on principles of distributed systems. pp. 88- 102 ,(2005) , 10.1007/11795490_9
Seth James Nielson, Scott A. Crosby, Dan S. Wallach, A Taxonomy of Rational Attacks Peer-to-Peer Systems IV. pp. 36- 46 ,(2005) , 10.1007/11558989_4
Scott A. Crosby, Dan S. Wallach, Denial of service via algorithmic complexity attacks usenix security symposium. pp. 3- 3 ,(2003)
Amos Fiat, Jared Saia, Maxwell Young, Making Chord Robust to Byzantine Attacks Algorithms – ESA 2005. pp. 803- 814 ,(2005) , 10.1007/11561071_71
Baruch Awerbuch, Christian Scheideler, Group Spreading: A Protocol for Provably Secure Distributed Name Service Automata, Languages and Programming. ,vol. 3142, pp. 183- 195 ,(2004) , 10.1007/978-3-540-27836-8_18
Oded Goldreich, B. Korte, R. L. Graham, Modern Cryptography, Probabilistic Proofs and Pseudorandomness ,(1998)
K. Srinathan, C. Pandu Rangan, Efficient Asynchronous Secure Multiparty Distributed Computation international conference on progress in cryptology. pp. 117- 129 ,(2000) , 10.1007/3-540-44495-5_11
Jared Saia, Amos Fiat, Steve Gribble, Anna R. Karlin, Stefan Saroiu, Dynamically Fault-Tolerant Content Addressable Networks international workshop on peer to peer systems. pp. 270- 279 ,(2002) , 10.1007/3-540-45748-8_26
Christian Scheideler, How to spread adversarial nodes? Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05. pp. 704- 713 ,(2005) , 10.1145/1060590.1060694
Moni Naor, Udi Wieder, Novel architectures for P2P applications: the continuous-discrete approach acm symposium on parallel algorithms and architectures. pp. 50- 59 ,(2003) , 10.1145/777412.777421