ÐIn a cellular phone system, mobility databases called visitor location registers (VLRs) are used to temporarily hold the subscription information of the roaming users who visit the service area of the VLR. When the users leave the VLR area, the corresponding records in the VLR are deleted. Due to user mobility, the capacity of the VLR may not be large enough to hold information for all visitor...

Buffer overflow attacks are among the oldest and most common attacks used to gain privileged access to a computer system. In fact, statistics from Carnegie Mellon’s Computer Emergency Response Team reveal that buffer overflow vulnerabilities accounted for about 50% of all reported vulnerabilities in 2000 [2]. It is surprising that after almost 20 years of buffer overflow exploits, they are stil...

Introduction Conclusions References

ÐHigh-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred...

In this paper, the performance of ATM switches with self-similar input traffic is analyzed. The ATM switch is a non-blocking, output-buffered switch, and input traffic is approximated by a Poisson-Zeta process, which is an asymptotically second-order self-similar process. The upper and lower bounds of the buffer overflow probability of the switch are obtained by stochastically bounding the numb...

Programs written in C are inherently vulnerable to buffer overflow attacks. Functions are frequently passed pointers as parameters without any hint of their sizes. Since their sizes are unknown, most run time buffer overflow detection techniques instead rely on signatures of known attacks or loosely estimate the range of the referenced buffers. Although they are effective in detecting most atta...

Buffer overflow attacks cause serious security problems. Array & pointer bound checking is one of the most effective approaches for defending against buffer overflow attacks when source code is available. However, original array & pointer bound checking causes too much overhead since it is designed to catch memory errors and it puts too many checks. In this paper, we propose an efficient array ...

Annexe A – Exercices sur les buffer overflows 90 Annexe B – Les codes utilisés dans le rapport-4/92