2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CR2023★ 2 cited
Algorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking
Dina Barak-Pelleg, Daniel Berend, Thomas J. Robinson +1
DoS and DDoS attacks are widely used and pose a constant threat. Here we explore Probability Packet Marking (PPM), one of the important methods for reconstructing the attack-graph…
cs.LG2020
On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design
Daniel Berend, Aryeh Kontorovich, Lev Reyzin +1
We tackle some fundamental problems in probability theory on corrupted random processes on the integer line. We analyze when a biased random walk is expected to reach its bottommos…