Robust random number generation for peer-to-peer systems
From MaRDI portal
Publication:1004308
DOI10.1016/J.TCS.2008.10.003zbMATH Open1157.68010OpenAlexW2019890995MaRDI QIDQ1004308FDOQ1004308
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
Recommendations
Random number generation in numerical analysis (65C10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cites Work
- Bit commitment using pseudorandomness
- Practical and provably-secure commitment schemes from collision-free hashing
- Title not available (Why is that?)
- Concentration of Measure for the Analysis of Randomized Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accessing nearby copies of replicated objects in a distributed environment
- Novel architectures for P2P applications: the continuous-discrete approach
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to spread adversarial nodes?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asynchronous secure computations with optimal resilience (extended abstract)
- Title not available (Why is that?)
- 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
Uses Software
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)
