v3rity技术文章集

简介:

 v3rity是由David Litchfield在2010年3月 建立起来的组织,旨在解决一些IT问题。官方网站提供了一些比较有用的文章。

Papers on Oracle Forensics
Oracle Forensics Part 7: Using the Oracle System Change Number in Forensic Investigations
Oracle Forensics Part 6: Examining Undo Segments, Flashback and the Oracle Recycle Bin
Oracle Forensics Part 5: Finding Evidence in the Absence of Auditing
Oracle Forensics Part 4: Live Response
Oracle Forensics Part 3: Isolating Evidence of Attacks Against the Authentication Mechanism
Oracle Forensics Part 2: Locating Dropped Objects
Oracle Forensics Part 1: Dissecting the Redo Logs

Papers on Database Security
Hacking Aurora in Oracle 11g
Exploiting PL/SQL Injection With Only CREATE SESSION Privileges in Oracle 11g 
Understanding Database Security
Exploiting PL/SQL Injection Flaws with only CREATE SESSION Privileges
Bypassing DBMS_ASSERT (in certain situations)
Lateral SQL Injection – A New Class of Vulnerability in Oracle.
Cursor Injection – A New Method for Exploiting PL/SQL Injection and Potential Defences
Cursor Snarfing – A New Class of Attack in Oracle
Oracle PL/SQL Injection (Blackhat Japan)
Threat Profiling Microsoft SQL Server
Hack Proofing Oracle Application Server
Microsoft SQL Server Passwords
Data-mining with SQL Injection and Inference
Database Servers on Windows XP and the Unintended Consequences of Simple File Sharing
Web Application Disassembly with ODBC Error Messages
Hackproofing Lotus Domino Web Server

Papers on Buffer Overflows
An Introduction to Heap overflows on AIX 5.3L
Buffer Underruns, DEP, ASLR and Improving the Exploitation Prevention Mechanisms (XPMs) on the Windows Platform
Defeating the Stack Based Buffer Overflow Prevention Mechanism of Microsoft Windows 2003 Server
Variations in Exploit methods between Linux and Windows
Non-stack Based Exploitation of Buffer Overrun Vulnerabilities on Windows NT/2000/XP
Windows Heap Overflows
Windows 2000 Format String Vulnerabilities
Buffer Overflows on SPARC Architecture
Buffer Overflows for Beginners
Exploiting Windows NT 4.0 Buffer Overruns (A Case Study: RASMAN.EXE)











本文转hackfreer51CTO博客,原文链接:http://blog.51cto.com/pnig0s1992/573371,如需转载请自行联系原作者

相关文章
|
7月前
|
内存技术
Motorola MVME147S MPU VME 模块
MVME147S 模块配备MC68030微处理器和MC68882浮点协处理器,具有共享DRAM(无奇偶校验版为MVME147SRF),4个RS-232C串口,SCSI接口,时钟/日历,2K CMOS RAM,4个ROM插口,VME总线中断器和控制器,支持A32/D32、A24/D16。还包括复位开关、打印机端口、滴答定时器、看门狗和以太网接口(MVME147SRF除外)。模块设计用于0至55摄氏度的强制空气冷却环境,使用25瓦负载板和3个100 CFM轴流风扇进行冷却测试。实际冷却效果取决于环境温度和气流,至少需要10 CFM,更高气流可扩展工作温度范围。
|
7月前
|
缓存
ARM学习扫盲篇(一):CPSR&SPSR、Lcache&Dcache、w/parity&w/ECC
ARM学习扫盲篇(一):CPSR&SPSR、Lcache&Dcache、w/parity&w/ECC
135 0
|
算法
light oj 1258 - Making Huge Palindromes(KMP)
ight oj里这个题目是属于KMP分类的,但乍看好像不是kmp,因为只有一个字符串。要想的到一个回文串,把该字符串翻转接到原串后面必然是一个回文串,但并不一定是最短的。我们必须考虑怎么把两个串尽量融合在一起,这就要看翻转串的前段与原串的后段有多少是匹配的了,这里就用到了KMP算法。
38 1
codeforces 317 A Perfect Pair
我先排除了输出-1的,然后再考虑如何计算最小的步数。我们主要在每一步中最小一个加上另一个就可以了,这是朴素的求法,但可能出现这样的情况 比如 -100000000 1 10000000 这样的话会循环100000000多次,肯定超时,所以我们要加快速度。
50 0
uva673 Parentheses Balance
uva673 Parentheses Balance
50 0
【UCIe】UCIe Clock Gating
【UCIe】UCIe Clock Gating
559 0
【UCIe】UCIe Clock Gating
|
人工智能
Nearest Opposite Parity最短路径+超级源点
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given an array a consisting of n integers. In one move, you can jump from the position i to the position i−ai (if 1≤i−ai) or to the position i+ai (if i+ai≤n).
152 0
Nearest Opposite Parity最短路径+超级源点
|
缓存 网络协议 网络架构