東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Enhancing security using legality as...

Wang, Lei.

FindBook

Google Book

Amazon

博客來

Enhancing security using legality assertions.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Enhancing security using legality assertions./
作者:	Wang, Lei.
面頁冊數:	120 p.
附註:	Source: Masters Abstracts International, Volume: 44-01, page: 0414.
Contained By:	Masters Abstracts International44-01.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR05086
ISBN:	9780494050866

Enhancing security using legality assertions.
Wang, Lei.

Enhancing security using legality assertions. - 120 p.

Source: Masters Abstracts International, Volume: 44-01, page: 0414.

Thesis (M.Sc.)--Queen's University (Canada), 2005.

Buffer overflows have been the most common form of security vulnerability in the past decade. The most common attacks use an unchecked string copy to cause a buffer overrun, thereby overwriting the return address. When the function returns, control is likely transferred to the attacker's code. A number of techniques have been proposed to address such attacks. Some are limited to protecting the return address on stack only; others are more general, but have undesirable properties such as large overhead, false positives or negatives.

ISBN: 9780494050866Subjects--Topical Terms:

626642
Computer Science.

Enhancing security using legality assertions.
LDR:02062nam 2200253 a 45 001 973075
005 20110928
008 110928s2005 eng d
020 $a 9780494050866
035 $a (UnM)AAIMR05086
035 $a AAIMR05086
040 $a UnM $c UnM
100 1 $a Wang, Lei. $3 1256221
245 1 0 $a Enhancing security using legality assertions.
300 $a 120 p.
500 $a Source: Masters Abstracts International, Volume: 44-01, page: 0414.
502 $a Thesis (M.Sc.)--Queen's University (Canada), 2005.
520 $a Buffer overflows have been the most common form of security vulnerability in the past decade. The most common attacks use an unchecked string copy to cause a buffer overrun, thereby overwriting the return address. When the function returns, control is likely transferred to the attacker's code. A number of techniques have been proposed to address such attacks. Some are limited to protecting the return address on stack only; others are more general, but have undesirable properties such as large overhead, false positives or negatives.
520 $a The approach described in this thesis uses legality assertions to check buffer overflows at run time. A transformation system is developed to analyze the input program and annotate it with appropriate assertions automatically, which provides a fast and convenient way to verify the correctness of the program. It has been proved to be able to detect buffer vulnerabilities on both stack and heap memory and has demonstrated its functionality to detect the potential buffer overflows in library functions without any modification to their representations. Runtime checking through the assertions also considerably enhances the accuracy and efficiency of buffer overflow detection. When an error is detected, the program terminates, which prevents it from being exploited by attackers.
590 $a School code: 0283.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Queen's University (Canada). $3 1017786
773 0 $t Masters Abstracts International $g 44-01.
790 $a 0283
791 $a M.Sc.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR05086