The design and implementation of network puzzles

Feng, Wu-chi; Kaiser, Ed; Luu, Antoine

doi:10.1109/infcom.2005.1498523

Cited by 29 publications

(8 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…IP puzzles [chang Feng et al 2005] are another mechanism hosts can employ to actively defend against spoofing. A server sends an IP puzzle to a client, then the client needs to "solve" the puzzle by performing some computational task.…”

Section: Activementioning

confidence: 99%

On the state of IP spoofing defense

Ehrenkranz

2009

ACM Trans. Internet Technol.

View full text Add to dashboard Cite

Section: Activementioning

confidence: 99%

On the state of IP spoofing defense

Ehrenkranz

2009

ACM Trans. Internet Technol.

View full text Add to dashboard Cite

“…Yet, despite success with Bitcoin and other cryptocurrencies, PoW has not found a widespread application in mitigating malicious behavior in networks. This is despite numerous proposals for PoW-based defenses [37,43,80,90,104,108,126,146,147].…”

Section: Introductionmentioning

confidence: 99%

Resource-Competitive Sybil Defenses

Gupta,

Saia,

Young

2019

Preprint

View full text Add to dashboard Cite

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 + 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.

show abstract

“…Network puzzles Feng et al [30,31] proposed cryptographically based countermeasure against DoS attacks. When a server comes under attack, it distributes small cryptographic puzzles to the requesting clients.…”

Section: Network Puzzles 3 Protocol Scrubbing and Screeningmentioning

confidence: 99%

“…31 shows the nodes vs utilization to illustrate the nodes left operational at the end indicated by their almost 100% load.TheFigures 4.32, 4.33 and 4.34 show the respective Zone 2 results. We can observe that utilization with sleep/wake are similar between zones.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Anti-fragile internet with autonomous swarm networks

Lua¹

View full text Add to dashboard Cite

Internet services and traffic is growing at an exponential rate. They are however vulnerable to flash crowds and Distributed Denial of Service attacks. Existing techniques are difficult to scale and have limited effectiveness. Most of them addresses specific attacks and do not provide wider coverage. We explore concepts of anti-fragility, autonomic and swarm computing to address these problems. We propose a decentralized and iterative overlay structure to reduce disruptions and risks in large networks. An autonomic system features (1) Self-configuration, (2) Self-healing, (3) Self-optimization and (4) Self-protection. For each of the features, we propose appropriate mechanisms. We show how each component is integrated to addresses simple and sculpted attacks. Fast flux session binding allows clients to contact gateway nodes in overlay networks. Auto-structure describes how the network builds itself iteratively. Auto-sensing estimates global traffic flows effectively. Auto-resistance deploys traffic scrubbers in real-time to mitigate illegitimate traffic. Auto-flow optimization increases network throughput through route selection. Our system filters traffic that does not conform to expectations of end point servers. Application level attacks will trigger auto deployment of filters. Meanwhile, selfmanagement strategies constantly optimize and heal the underlying network. Simulations were ran to demonstrate effectiveness of the above features. These were then integrated into a prototype. This prototype was deployed to a large number of computers to demonstrate how each feature performs. Results from our deployment has shown that we can mitigate application level attacks effectively. We are also able to perform real-time optimization of our network by varying the number of active nodes and their respective pools. We show how swarm algorithms such as IWD can be used to perform distributed traffic management. This allows us to allocate traffic effectively and increases survivability of the network.

show abstract

The design and implementation of network puzzles

Cited by 29 publications

References 38 publications

On the state of IP spoofing defense

On the state of IP spoofing defense

Resource-Competitive Sybil Defenses

Anti-fragile internet with autonomous swarm networks

Contact Info

Product

Resources

About