Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 7,975 papers for “Correlation attack”

Decimation-Based Fast Correlation Attack

M.P.C. Fossorier, Miodrag J. Mihaljević, Hideki Imai · 2007

In this paper, the gains achievable by proper decimation (or puncturing) of the received sample for fast correlation attack are investigated. In particular, the instances in which such an approach is interesting are clearly identified.

Cited by 0

Countering the Correlation Attack on

Pomaranch Cees Jansen, Cees J. A. Jansen, Er Kholosha · 2008

A recent key-recovery attack on Pomaranch stream cipher was built due to the spotted biases in the distribution of certain linear relations in the output sequence of a Jump Register Section. All the relations and corresponding biases were found by computer experiments.

Cited by 0

Algebra for capability based attack correlation

Navneet Kumar P, S. K. Gupta, Shaveta Leekha · 2015

Abstract. Most of the existing intrusion detection systems (IDS) often generate large numbers of alerts which contain numerous false positives and non relevant positives. Alert correlation techniques aim to aggregate and combine the outputs of single/multiple IDS to provide a concise and broad view of the security state of network. Capability based alert correlator uses notion of capability to correlate IDS alerts where capa-bility is the abstract view of attack extracted from IDS alerts/alert. To make correlation process semantically correct and systematic, there is a strong need to identify the algebraic and set properties of capability. In this work, we identify the potential algebraic properties of capability in terms of operations, relations and inferences. These properties give better insight to understand the logical association between capabilities which will be helpful in making the system modular. This paper also presents variant of correlation algorithm by using these algebraic prop-erties. To make these operations more realistic, existing capability model has been empowered by adding time-based notion which helps to avoid temporal ambiguity between capability instances. The comparison be-tween basic model and proposed model is exhibited by demonstrating cases in which false positives have been removed that occurred due to temporal ambiguity.

Cited by 0

Spatial correlation detection of DDoS attack

Zonglin Li, Guangming Hu, Yao Xingmiao · 2009

DDoS attack flows distributed in many links exhibit directional nature, they are usually generated by certain tools and originate from different nodes, but have inherent dependencies in spatial when transit in network. This will cause correlation between the traffic where they traverse deviate from norm. By taking advantage of this feature, we propose a spatial correlation detection method deploying in backbone network to combat DDoS attack. In doing so, we first approximately estimate abnormality of every origin destination (OD) flow through comparing observations with predictions, then for OD flows with same destination, extracting spatial correlation between their abnormality estimations by principle component analysis(PCA). Abrupt change of spatial correlation indicates DDoS attack occurs. We evaluate the detection performance of our method in detecting synthetic DDoS attack that injected on real backbone traffic through receiver operating characteristic (ROC) curve. The contribution of this paper is utilizing spatial correlation between attack flows, rather than the volume of attack purely, facilitates us to detect relatively small attack being masked in tremendous traffic of backbone network. Moreover, contrary to the centralized computation of previous network-wide anomaly detection method, our method can be deployed separately in each node, in such a way that our method can adapt to different size of network, and thus scalable.

Cited by 4

Conditional correlation attack on combiners withmemory

Jovan Dj. Golić · Electronics Letters · 1996

A connection between linear codes and the correlation attack conditioned on the output of binary combiners with memory is established. Using a sort of random coding argument, it is shown that an average combiner with memory is potentially vulnerable to such an attack only if the number of outputs is equal to or greater than the number of inputs. The required computational complexity in the former case is exponentially greater than in the latter case.

Cited by 2

A New Correlation Model of IoT Attack Based on Attack Tree

Yu Liu, Kailiang Chen, Yue Chang et al. · 2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · 2021

With the development of Internet of Things (IoT) technology, IoT attacks are more and more frequent. It's difficult to express the lateral IoT attack actions by the common models. Aiming at the problem of IoT attack modeling, this paper proposes a novel channel attack tree (Channel-AT) model. Firstly, we investigate the method of constructing an attack tree model automatically. The edges of attack trees are mined based on sequential patterns and association rules, and the attack tree is constructed under the same target. Then, we study the method of constructing Channel-AT model from the attack tree set. Attackers can use the channels to attack laterally among different attack trees. IoT attack channels are extracted among attack trees by two methods. One is that we can extract information channels as attack channels. Also, we calculate the similarity of nodes in different attack trees. There can be one attack channel if two nodes are very similar. Our work proposes a new correlation model which concludes the attack process, attack goal, and lateral attack action. Besides, we study the automatic modeling method based on sequential patterns and association rules.

Cited by 1

A Fast Correlation Attack via Parallel Computing

Qiong Liu, Yupu Hu · 2009

For stream ciphers which use binary linear feedback shift registers as stream generators, fast correlation attack is one of the most important attacks. Aiming at the shortcomings of serial algorithm, the proposed technique is based on parallel computing. This kind of attack divides the initial state into several parts, uses multiprocessor to recover all parts of the initial state synchronously. Comparing with previous results, this kind of attack shows low complexity and high attack efficiency.

Cited by 0