Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel DeLaughter

dblp:308/2830 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 87% Blockchain and cryptocurrency security · 13%
Computer networks
1 paper
Transport protocols and congestion control · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › attack strategy
denial-of-service attack
0.912025
SYN Proof-of- Work: Improving Volumetric DoS Resilience in TCP · SP 2025
Network security › attack strategy › denial-of-service attack
SYN flood
0.912025
SYN Proof-of- Work: Improving Volumetric DoS Resilience in TCP · SP 2025
Transport protocols and congestion control
TCP
0.312025
SYN Proof-of- Work: Improving Volumetric DoS Resilience in TCP · SP 2025
Transport protocols and congestion control
transport protocols
0.312025
SYN Proof-of- Work: Improving Volumetric DoS Resilience in TCP · SP 2025
Blockchain and cryptocurrency security › consensus protocol
proof-of-work
0.312025
SYN Proof-of- Work: Improving Volumetric DoS Resilience in TCP · SP 2025

Methods — techniques the papers use, named apart from their topics

proof-of-work · 1.7
YearPublicationVenuePosition
2025 SYN Proof-of- Work: Improving Volumetric DoS Resilience in TCP
abstract
This paper presents and evaluates SYN PoW, a novel approach to mitigating TCP SYN flooding attacks using minia-ture proofs-of-work. SYN Floods have been a common threat on the Internet for decades, and have increased dramatically in both scale and frequency in recent years. Currently, SYN Cookies are widely deployed as a mitigation against this threat, but as we demonstrate they scale poorly with the volume of attack and can be detrimental to performance. SYN PoW plays a similar role, but with several key advantages: (1) it protects bandwidth by dropping malicious SYN s without sending SYN-ACKs in response; (2) it facilitates in-network verification, enabling middle boxes to detect and drop malicious packets before they reach their target; (3) it shifts the primary cost burden of mitigation from attack victims to attackers themselves; and (4) it protects against spoofing attacks without requiring source address validation. We explain how proofs-of-work can be added to SYN packets in a way that complies with the current TCP standard, and demonstrate how SYN Po W outperforms SYN Cookies under high-volume SYN floods in controlled testbed experiments.
Samuel DeLaughter, Karen R. Sollins
SP1