Resource-Competitive Sybil Defenses

11/15/2019
by   Diksha Gupta, et al.
0

Proof-of-work(PoW) is an algorithmic tool used to secure networks by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices perform significant computational work in perpetuity, even when the system is not under attack. We address this issue by designing general PoW protocols that ensure two properties. First, the fraction of identities in the system that are controlled by an attacker is a minority. Second, the computational cost of our protocol is comparable to the cost of an attacker. In particular, we present an efficient algorithm, GMCOM, which guarantees that the average computational cost to the good ID per unit time is O(J + sqrt(T(J+1))), where J is the average number of joins by the good IDs and T is the average computational spending of the adversary. Additionally, we discuss a precursor to this algorithm, CCOM, which guarantees an average computational cost to good IDs per unit time of O(J+T). We prove a lower bound showing that GMCOM's spending rate is asymptotically optimal among a large family of algorithms. Finally, we provide empirical evidence that our algorithms can be significantly more efficient than previous defenses under various attack scenarios.

READ FULL TEXT
research
06/03/2020

ToGCom: An Asymmetric Sybil Defense

Proof-of-work (PoW) is one of the most common techniques to defend again...
research
10/12/2020

Bankrupting Sybil Despite Churn

A Sybil attack occurs when an adversary pretends to be multiple identiti...
research
09/17/2021

Hard to Forget: Poisoning Attacks on Certified Machine Unlearning

The right to erasure requires removal of a user's information from data ...
research
05/17/2022

Bankrupting DoS Attackers Despite Uncertainty

On-demand provisioning in the cloud allows for services to remain availa...
research
01/30/2023

Adversarial Attacks on Adversarial Bandits

We study a security threat to adversarial multi-armed bandits, in which ...
research
10/31/2018

DBSCAN++: Towards fast and scalable density clustering

DBSCAN is a classical density-based clustering procedure which has had t...
research
04/02/2019

Data Disclosure under Perfect Sample Privacy

Perfect data privacy seems to be in fundamental opposition to the econom...

Please sign up or login with your details

Forgot password? Click here to reset