Showing 1–20 of 32 results
/ Date/ Name
Feb 24, 2010Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive AdversaryDec 25, 2018Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016Oct 12, 2020Bankrupting Sybil Despite ChurnNov 2, 2005The Impact of Social Networks on Multi-Agent Recommender SystemsMay 21, 2014Secure Anonymous BroadcastAug 3, 2017Proof of Work Without All the Work: Computationally Efficient Attack-Resistant SystemsOct 12, 2007Sleeping on the Job: Energy-Efficient Broadcast for Radio NetworksMay 2, 2012Scalable Mechanisms for Rational Secret SharingOct 13, 2013Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty ComputationDec 18, 2016Distributed Computing with Channel NoiseMay 17, 2022Bankrupting DoS AttackersJun 3, 2020ToGCom: An Asymmetric Sybil DefenseNov 15, 2019Resource-Competitive Sybil DefensesMay 6, 2014Self-Healing ComputationMay 29, 2017Tiny Groups Tackle Byzantine AdversariesFeb 14, 2009The Forgiving Graph: A distributed data structure for low stretch under adversarial attackMar 1, 2012Secure Multi-Party Computation in Large NetworksNov 2, 2005Parameters Affecting the Resilience of Scale-Free Networks to Random FailuresFeb 22, 2008The Forgiving Tree: A Self-Healing Distributed Data StructureMay 29, 2009Improved Approximation Algorithms for Segment Minimization in Intensity Modulated Radiation Therapy