• Title/Summary/Keyword: 오버플로우 영역

Search Result 12, Processing Time 0.016 seconds

Detection Mechanism against Code Re-use Attack in Stack region (스택 영역에서의 코드 재사용 공격 탐지 메커니즘)

  • Kim, Ju-Hyuk;Oh, Soo-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.5
    • /
    • pp.3121-3131
    • /
    • 2014
  • Vulnerabilities related to memory have been known as major threats to the security of a computer system. Actually, the number of attacks using memory vulnerability has been increased. Accordingly, various memory protection mechanisms have been studied and implemented on operating system while new attack techniques bypassing the protection systems have been developed. Especially, buffer overflow attacks have been developed as Return-Oriented Programing(ROP) and Jump-Oriented Programming(JOP) called Code Re-used attack to bypass the memory protection mechanism. Thus, in this paper, I analyzed code re-use attack techniques emerged recently among attacks related to memory, as well as analyzed various detection mechanisms proposed previously. Based on the results of the analyses, a mechanism that could detect various code re-use attacks on a binary level was proposed. In addition, it was verified through experiments that the proposed mechanism could detect code re-use attacks effectively.

An Efficient Video Management Technique using Forward Timeline on Multimedia Local Server (전방향 시간 경계선을 활용한 멀티미디어 지역 서버에서의 효율적인 동영상 관리 기법)

  • Lee, Jun-Pyo;Woo, Soon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.147-153
    • /
    • 2011
  • In this paper, we present a new video management technique using forward timeline to efficiently store and delete the videos on a local server. The proposed method is based on capturing the changing preference of the videos according to recentness, frequency, and playback length of the requested videos. For this purpose, we utilize the forward timeline which represents the time area within a number of predefined intervals. The local server periodically measures time popularity and request segment of all videos. Based on the measured data, time popularity and request segment, the local server calculates the mean time popularity and mean request segment of a video using forward timeline. Using mean time popularity and mean request segment of video, we estimate the ranking and allocated storage space of a video. The ranking represents the priority of deletion when the storage area of local server is running out of space and the allocated storage space means the maximum size of storage space to be allocated to a video. In addition, we propose an efficient storage space partitioning technique in order to stably store videos and present a time based free-up storage space technique using the expected variation of video data in order for avoiding the overflow on a local server in advance. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, our video management technique for local server provides the lowest user start-up latency and the highest bandwidth saving significantly.