Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security 2015
DOI: 10.1145/2810103.2813633
|View full text |Cite
|
Sign up to set email alerts
|

Maneuvering Around Clouds

Abstract: The increase of Distributed Denial-of-Service (DDoS) attacks in volume, frequency, and complexity, combined with the constant required alertness for mitigating web application threats, has caused many website owners to turn to Cloud-based Security Providers (CBSPs) to protect their infrastructure. These solutions typically involve the rerouting of tra c from the original website through the CBSP's network, where malicious tra c can be detected and absorbed before it ever reaches the servers of the protected we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
14
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 41 publications
(15 citation statements)
references
References 14 publications
1
14
0
Order By: Relevance
“…Our work extends to earlier work by Vissers et al [111] with the following three contributions. First, we analyze origin exposure in the DNS at a largerthan-ever-before scale.…”
Section: The Problemsupporting
confidence: 78%
See 3 more Smart Citations
“…Our work extends to earlier work by Vissers et al [111] with the following three contributions. First, we analyze origin exposure in the DNS at a largerthan-ever-before scale.…”
Section: The Problemsupporting
confidence: 78%
“…In this section we explain various vectors through which the origin can be exposed. We describe two novel vectors (see Sections 7.3.4 and 7.3.6) in addition to various vectors that were previously identified in the literature [75,83,111].…”
Section: Exposure Vectorsmentioning
confidence: 99%
See 2 more Smart Citations
“…If they are not similar they are not clustered together; if they are, we still have to investigate whether their DOMs are similar to decide if they should be clustered or not. To achieve this, we build upon the normalized DOM-edit distance metric (NDD), proposed by Vissers et al [62], which essentially takes as input two DOM trees and computes the number of edit operations required to move from one tree to the other. Initially, we observed that the tree edit distance algorithm they used at the time (ZSS [63]) was rather slow even for relatively simple DOMs.…”
Section: B Url Clusteringmentioning
confidence: 99%