Robust random number generation for peer-to-peer systems

DOI10.1016/J.TCS.2008.10.003MaRDI QIDQ1004308zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Christian Scheideler

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

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

Recommendations

• Choosing a random peer
• Robust pseudorandom generators
• Reducing communication costs in robust peer-to-peer networks
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 1931813

Cites work

• scientific article; zbMATH DE number 1583939 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 1559581 (Why is no real title available?)
• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• scientific article; zbMATH DE number 1931812 (Why is no real title available?)
• scientific article; zbMATH DE number 1931813 (Why is no real title available?)
• scientific article; zbMATH DE number 861531 (Why is no real title available?)
• Accessing nearby copies of replicated objects in a distributed environment
• Algorithms – ESA 2005
• Asynchronous secure computations with optimal resilience (extended abstract)
• Automata, Languages and Programming
• Bit commitment using pseudorandomness
• Concentration of Measure for the Analysis of Randomized Algorithms
• How to spread adversarial nodes?
• Novel architectures for P2P applications: the continuous-discrete approach
• Practical and provably-secure commitment schemes from collision-free hashing
• Scalable leader election

Cited in

(6)

• Tiara: a self-stabilizing deterministic skip list and skip graph
• Distributed agreement in dynamic peer-to-peer networks
• Resource Burning for Permissionless Systems (Invited Paper)
• Towards a scalable and robust DHT
• Towards worst-case churn resistant peer-to-peer systems
• On a decentralized trustless pseudo-random number generation algorithm

Describes a project that uses

Uses Software

• Chord

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004308)