Robust random number generation for peer-to-peer systems

DOI10.1016/j.tcs.2008.10.003zbMath1157.68010OpenAlexW2019890995MaRDI QIDQ1004308

Christian Scheideler, Baruch Awerbuch

Publication date: 2 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.003

zbMATH Keywords

random number generationpeer-to-peer systemsjoin-leave attacks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Random number generation in numerical analysis (65C10) Distributed algorithms (68W15)

Related Items (5)

Towards worst-case churn resistant peer-to-peer systems ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Towards a scalable and robust DHT ⋮ Distributed agreement in dynamic peer-to-peer networks

Uses Software

• Chord

Cites Work

• Bit commitment using pseudorandomness
• Accessing nearby copies of replicated objects in a distributed environment
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Novel architectures for P2P applications
• How to spread adversarial nodes?
• Scalable leader election
• Asynchronous secure computations with optimal resilience (extended abstract)
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Concentration of Measure for the Analysis of Randomized Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust random number generation for peer-to-peer systems