This paper explores how attackers use vulnerability chaining in cybersecurity to carry out more powerful attacks. They do this by exploiting and connecting different weaknesses in a system. Understanding the system's architecture is crucial for this method, as attackers take advantage of the interactions between seemingly unrelated vulnerabilities.

Cited by 0Open access

chaining overflow

SpringerReference · 2011

Cited by 0

Chaining Patterns

Taneli Mielikäinen · Lecture notes in computer science · 2003

Cited by 5

chaining, n.

Oxford University Press eBooks · 2023

Cited by 0

Chaining Patterns

Taneli Mielikäinen · 2003

Cited by 0

Vulnerability Chaining

2024

Cited by 0

Chaining waters

Jonkhof, J.F. · Socio-Environmental Systems Modeling · 2003

Cited by 0Open access

Chaining history

Hacquebord, A. (author) · Research Repository (Delft University of Technology) · 2008

Cited by 0Open access

backward chaining

Martin H. Weik · 2000

Cited by 0

Packet chaining

George Michelogiannakis, Nan Jiang, Daniel Becker et al. · 2011

This paper introduces packet chaining, a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with short packets and short cycle times. Packet chaining operates by chaining packets destined to the same output together, to reuse the switch connection of a departing packet. This allows an allocator to build up an efficient matching over a number of cycles like incremental allocation, but not limited by packet length. For a 64-node 2D mesh at maximum injection rate and with single-flit packets, packet chaining increases network throughput by 15% compared to a highly-tuned router using a conventional single-iteration separable iSLIP allocator, and outperforms significantly more complex allocators. Specifically, it outperforms multiple-iteration iSLIP allocators and wavefront allocators by 10% and 6% respectively, and gives comparable throughput with an augmenting paths allocator. Packet chaining achieves this performance with a cycle time comparable to a single-iteration separable allocator. Packet chaining also reduces average network latency by 22.5% compared to a single-iteration iSLIP allocator. Finally, packet chaining increases IPC up to 46% (16% average) for application benchmarks because short packets are critical in a typical cache-coherent chip multiprocessor.

Cited by 37

Chaining care

Paul Watson · Nursing Standard · 1996

A nurse describes problems he faced when caring for patients who were shackled

Cited by 0