Windows缓冲区溢出Exploit代码分析研究

该文首先讨论了缓冲区漏洞的产生原理和一般攻击手段,然后分析总结Windows缓冲区溢出漏洞利用的攻击Exploit代码结构和特征,最后讨论了这些特征在入侵检测领域中的应用以及基于系统调用特征的入侵检测这一最新发展方向。     

缓冲区溢出分析及其防范策略研究

缓冲区溢出是一种在各种操作系统和应用软件中广泛存在且危害较大的漏洞。分析了缓冲区溢出攻击的原理,讨论了基于缓冲区溢出的攻击方式和一般规律以及攻击代码的植入方式,给出了防范缓冲区溢出攻击的策略和措施。     

一种缓冲区溢出攻击描述语言的研究与设计

分析目前缓冲区溢出攻击的弱点,提出一种新的攻击方法。通过抽象缓冲区溢出攻击的规律,分析植入代码的结构特征,给出缓冲区溢出攻击描述语言的文法。对于不同的缓冲区溢出漏洞,攻击描述语言能够动态地构造植入代码,实现攻击的自动化。     

缓冲区溢出的软件安全性测试技术研究

缓冲区溢出作为系统或程序自身存在的一种漏洞对系统或软件安全造成了潜在威胁,黑客可以轻易利用这一漏洞进行攻击,以达到控制系统或窃取秘密的目的。据统计,利用缓冲区溢出漏洞进行的攻击已经占到了互联网攻击总数的一半以上。文章在对缓冲区溢出原理进行分析的基础上,给出了缓冲区溢出的故障模型,并提出了基于静态分析的代码自动检测算法,为故障发现及预防奠定了基础。     

缓冲区溢出攻击:原理,防御及检测

给出了缓冲区溢出的原理，分析了利用缓冲区溢出漏洞进行网络攻击的方法及其特征；从程序编写、程序检测、数据结构设计以及程序执行控制等多个角度对防止缓冲区溢出攻击进行了分析，提出了遏制利用缓冲区溢出漏洞进行攻击的一些方法。     

缓冲区溢出漏洞研究与进展

软件中的缓冲区溢出漏洞是个严重的安全隐患,利用它的攻击给社会造成了巨大的危害和经济损失,缓冲区溢出漏洞检测防护技术已成为一个研究热点.首先分类剖析了缓冲区溢出攻击原理,进而对缓冲区溢出漏洞检测防护技术十几年来的研究进展进行了讨论,最后给出该领域的研究热点问题与展望.     

缓冲区溢出原理及防护

本文详细分析了缓冲区溢出的原理,描述了网络攻击者利用缓冲区溢出漏洞进行系统攻击的一般过程,最后简单讨论了几种缓冲区溢出的保护方法。     

剖析缓冲区溢出攻击

本文从程序设计语言的特征、程序编写、数据结构以及程序执行控制等多个角度对缓冲区溢出漏洞攻击的原理进行深入剖析,最后提出了遏制利用缓冲区溢出漏洞进行攻击的一些措施。     

缓冲区溢出攻击的原理与防范

攻击代码漏洞的常用手段就是利用缓冲区溢出。strcpy 的那个漏洞至今仍是许多黑客掌中利器,作者将介绍如何防止缓冲区的溢出。缓冲区溢出(Buffer Overflow)是计算机安全的头号公敌,据报道,有50%以上的安全漏洞和缓冲区溢出有关。C/C++语言对数组下标访问越界不做检查,是引起缓冲区溢出问题的根本原因。本文以 Linux on IA32(32-bit Intel Architecture,即通常所说的 x86)为平台,介绍缓冲区溢出的原理与防范措施。按照被攻击的缓冲区所处的位置,缓冲区溢出(Buffer     

剖析缓冲区溢出攻击

本文从程序设计语言的特征、程序编写、数据结构以及程序执行控制等多个角度对缓冲区溢出漏洞攻击的原理进行深入剖析,最后提出了遏制利用缓冲区溢出漏洞进行攻击的一些措施。     

基于位宽控制提高SIMD架构并行度的优化算法

随着SIMD功能单元作为多媒体加速部件的广泛应用,如何有效利用这一构架优化应用程序成为编译优化研究的热点.目前典型的SIMD结构为同一操作对不同的数据化宽提供了不同的指令版本,随着操作数位宽的增加,对应的SIMD指令可同时完成的操作个数也随之降低.因此,如何有效识别操作数的有效位宽,对提高优化过程中SIMD指令内操作的并行度将产生至关重要的影响.文中针对SIMD优化面临的并行度问题,提出了一种优化算法,该算法在对操作数的有效位进行分析的基础上,进行溢出控制,从而减少操作数对宽位宽数据类型的依赖.实验数据表明,该算法可以有效提高多媒体程序优化的并行度,对多媒体程序获得较好的加速效果.     

堆溢出的攻击演变与防范

以栈溢出为主的缓冲区溢出研究取得了较为丰硕的成果,与其相比,堆溢出攻击要困难许多,研究力度也少了许多。然而我们绝不能低估基于堆的溢出攻击,事实上,堆溢出已经成为攻击软件的主要方式之一。论文从基本的堆溢出开始,详细研究了堆溢出的主要攻击手段及其演变,介绍了各种常见的防御措施,并且对这些研究成果进行了分析总结。最后陈述了我们对此问题的观点。     

Overflow handling in hashing tables: A hybrid approach

The hybrid method of handling overflows in hashing tables, which incapsulates both open addressing and chaining, is presented. A simulation model which accounts for the effect of the loading order is developed in order to evaluate the average number of accesses and the average number of overflows under the hybrid method. Furthermore, two cost models are considered to compare the performance of the hybrid method with open addressing and chaining for hashing tables kept in main core and on secondary storage devices.     

分布式环境下基于语义相似的案例检索

分布式环境下的异构案例表达制约了案例检索过程中案例属性之间的可比性，进而成为分布式环境下案例推理系统成败的一个关键问题。该文提出基于语义相似的案例检索，通过利用Ontology技术来理解案例属性的内在含义，在此基础上定义并计算属性之间的相似程度。对原型系统的初步测试证明了基于语义相似的案例检索有效性。     

缓冲区溢出漏洞攻击的分析研究

缓冲区溢出漏洞是当前互联网中存在的最主要的威胁之一.本文针对Linux系统存在的缓冲区溢出漏洞,讨论了缓冲区溢出漏洞的产生原理和一般的攻击手段,介绍了不同的防御手段并比较了其优缺点.     

Feature transfer and matching in disparate stereo views through the use of plane homographies

Many vision tasks rely upon the identification of sets of corresponding features among different images. This paper presents a method that, given some corresponding features in two stereo images, matches them with features extracted from a second stereo pair captured from a distant viewpoint. The proposed method is based on the assumption that the viewed scene contains two planar surfaces and exploits geometric constraints that are imposed by the existence of these planes to first transfer and then match image features between the two stereo pairs. The resulting scheme handles point and line features in a unified manner and is capable of successfully matching features extracted from stereo pairs that are acquired from considerably different viewpoints. Experimental results are presented, which demonstrate that the performance of the proposed method compares favorably to that of epipolar and tensor-based approaches.     

Efficient bulk-loading of gridfiles

This paper considers the problem of bulk-loading large data sets for the gridfile multiattribute indexing technique. We propose a rectilinear partitioning algorithm that heuristically seeks to minimize the size of the gridfile needed to ensure no bucket overflows. Empirical studies on both synthetic data sets and on data sets drawn from computational fluid dynamics applications demonstrate that our algorithm is very efficient, and is able to handle large data sets. In addition, we present an algorithm for bulk-loading data sets too large to fit in main memory. Utilizing a sort of the entire data set it creates a gridfile without incurring any overflows     

Blind image inpainting quality assessment using local features continuity

Multimedia Tools and Applications - This paper deals with Blind Inpainted Image Quality Assessment BIIQA. Herein, we propose a new method that exploits the continuity of features around the...     

Multi-agent event recognition by preservation of spatiotemporal relationships between probabilistic models

We present a new method for multi-agent activity analysis and recognition that uses low level motion features and exploits the inherent structure and recurrence of motion present in multi-agent activity scenarios.     

Fast video segment retrieval by Sort-Merge feature selection, boundary refinement, and lazy evaluation

We present a fast video retrieval system with three novel characteristics. First, it exploits the methods of machine learning to construct automatically a hierarchy of small subsets of features that are progressively more useful for indexing. These subsets are induced by a new heuristic method called Sort-Merge feature selection, which exploits a novel combination of Fastmap for dimensionality reduction and Mahalanobis distance for likelihood determination. Second, because these induced feature sets form a hierarchy with increasing classification accuracy, video segments can be segmented and categorized simultaneously in a coarse-fine manner that efficiently and progressively detects and refines their temporal boundaries. Third, the feature set hierarchy enables an efficient implementation of query systems by the approach of lazy evaluation, in which new queries are used to refine the retrieval index in real-time. We analyze the performance of these methods, and demonstrate them in the domain of a 75-min instructional video and a 30-min baseball video.