full-disclosure - Re: Info about attack trees

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date: Sat, 26 May 2012 13:50:36 -0700
From: coderman <coderman@...il.com>
To: Gage Bystrom <themadichib0d@...il.com>
Cc: "full-disclosure@...ts.grok.org.uk" <full-disclosure@...ts.grok.org.uk>
Subject: Re: Info about attack trees

On Sat, May 26, 2012 at 1:32 PM, Gage Bystrom <themadichib0d@...il.com> wrote:
> If you havnt guessed from the replies, there are no such thing as an attack
> tree...
> The classical method is something along the lines of preform recon,
> enumerate, attack, presist/extract data. You react based upon the
> information you gather, the more information you have, the clearer it is on
> to what the next step ought to be.

this concept is more useful in fully automated exploit +
post-exploitation systems, where you have an arsenal of exploits of
varying stealth, reliability, applicability. the result of exploit
preference, exploit chaining, and contingency paths based on real-time
feedback results in a tree like structure following the path of least
resistance to total compromise.

you need to prepare this tree ahead of time as a human in the loop
will only slow down the process and increase the risk of counter
measures frustrating further attack.

a pedant would call them exploit graphs ;)

_______________________________________________
Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/