Results 251 to 260 of about 257,742 (291)
Some of the next articles are maybe not open access.
Generating Attack Scenarios for Attack Intention Recognition
2011 International Conference on Computational and Information Sciences, 2011Attack intention recognition is the process of inferring an attacker's intention from the observed attack behaviors, which is based on some attack scenario. The common methods of modeling attack scenario are attack tree and attack graph, but these methods are not suitable for attack intention recognition.
Jie Feng +4 more
openaire +1 more source
Proceedings of the Vertical Flight Society 76th Annual Forum, 2020
Attack helicopters have gone through several notable changes in development and capabilities throughout their history, changes which are continuing to this day. These changes can be captured in distinct generations of attack helicopters, with significant similarities to generations of fighter aircraft development.
openaire +1 more source
Attack helicopters have gone through several notable changes in development and capabilities throughout their history, changes which are continuing to this day. These changes can be captured in distinct generations of attack helicopters, with significant similarities to generations of fighter aircraft development.
openaire +1 more source
Scalable Attack Graph Generation
Proceedings of the 11th Annual Cyber and Information Security Research Conference, 2016Attack graphs are a powerful modeling technique with which to explore the attack surface of a system. However, they can be difficult to generate due to the exponential growth of the state space, often times making exhaustive search impractical. This paper discusses an approach for generating large attack graphs with an emphasis on scalable generation ...
Kyle Cook +3 more
openaire +1 more source
Attacking the Pollard Generator
IEEE Transactions on Information Theory, 2006Let p be a prime and let c be an integer modulo p. The Pollard generator is a sequence (un) of pseudorandom numbers defined by the relation un+1equivun 2+c mod p. It is shown that if c and 9/14 of the most significant bits of two consecutive values un,un+1 of the Pollard generator are given, one can recover in polynomial time the initial value u0 with ...
Domingo Gmez +2 more
openaire +1 more source
Generative Transferable Adversarial Attack
Proceedings of the 3rd International Conference on Video and Image Processing, 2019Despite their superior performance in computer vision tasks, deep neural networks are found to be vulnerable to adversarial examples, slightly perturbed examples that can mislead trained models. Moreover, adversarial examples are often transferable, i.e., adversaries crafted for one model can attack another model.
Yifeng Li +3 more
openaire +1 more source
Distributed Attack Graph Generation
IEEE Transactions on Dependable and Secure Computing, 2016Attack graphs show possible paths that an attacker can use to intrude into a target network and gain privileges through series of vulnerability exploits. The computation of attack graphs suffers from the state explosion problem occurring most notably when the number of vulnerabilities in the target network grows large.
Kerem Kaynar, Fikret Sivrikaya
openaire +1 more source
Automatic Generation of Attack Scripts from Attack Graphs
2018 1st International Conference on Data Intelligence and Security (ICDIS), 2018While attack graphs are valuable tools for security analysis, their testing and validation is a time-consuming process. Once validated, the attack graph can be used to generate testing scripts or use-cases for system security testing and validation. Furthermore, simply identifying states where a system is critically compromised can also be lengthy and ...
William Nichols +4 more
openaire +1 more source
Generic Attacks on Generalized Feistel Ciphers
2017Type-1, type-2 and type-3 and alternating Feistel schemes, are described by Zhen, Matsumoto, and Imai (On the construction of block ciphers provably secure and not relying on any unproved hypotheses, Springer, Heidelberg, 1990, pp. 461–480) (see also Hoang and Rogaway, On generalized Feistel networks, Springer, Heidelberg, 2010, pp. 613–630).
Valerie Nachef +2 more
openaire +1 more source
Panic Attacks in Generalized Anxiety Disorder
Journal of Nervous & Mental Disease, 2013Panic attacks have been reported by patients with generalized anxiety disorder (GAD) in response to catastrophic worry. This has not been characterized in the literature. We examined the prevalence of GAD panic attacks in an anxiety disorders clinic sample. Charts of 254 patients with DSM-IV GAD were retrospectively evaluated.
Michael, Van Ameringen +3 more
openaire +2 more sources
Generalization of Weger’s Attack
2011In 2002, De Weger show that choosing an RSA modulus with a small difference of its prime factors yields improvements on the small private exponent attacks of Wiener and Boneh-Durfee. In this paper, we extend the Weger’s bound of the Boneh-Durfee attack for the RSA modulus N = pq, when \(\frac{p}{q}\) being close to \(\frac{b}{a}\) with small integers a
Navaneet Ojha, Sahadeo Padhye
openaire +1 more source

