About CGC: the world’s first all-machine hacking tournament
summary
Overview of the DARPA Cyber Grand Challenge: an autonomous CTF where machines perform static analysis, fuzzing, symbolic execution, exploit generation and binary patching on stripped CGC binaries. A winning system automatically finds and exploits a subtle null-byte bug and creates a working exploit in 105 minutes. The final competition runs on 2,000 cores across 64 machines and analyzes over 80 unknown programs in ten hours, demonstrating real autonomous exploit generation and automated patching that actually works.
AI-written summary · about
chapters (36)
- 0:00Software security assessment
- 1:04Networking problems
- 2:57DARPA
- 5:28About CGC
- 6:41Scoring system
- 7:05DARPAs architecture
- 7:54Availability scoring
- 8:13Failure scoring
- 8:48Taunt tracking
- 9:29CGC format
- 10:10Exploits
- 10:50Complex programs
- 11:20Bugs
- 11:55Mayhem
- 12:28Robustness
- 14:09Symbolic Execution
- 14:32Symbolic Execution Example
- 15:18Fuzzing
- 17:30How to do instrumentation
- 18:00Fuzzing vs Symbolic Execution
- 20:01Making an exploit
- 21:00The exploit
- 22:23Binary hot patching
- 24:00Static binary rewriting
- 25:03Recompilation
- 26:35Instrumenting
- 28:50Patching
- 31:00Generic Patches
- 32:25Static Analysis
- 34:00Performance Testing
- 35:17Decision Making
- 36:39Bayesian Estimation
- 40:04What do we do
- 42:25Protection
- 43:08Selfdriving cars
- 44:33The future
related talks
41mKeynote:Bend the Machine: The Hacker Path to Autonomy in the Real World
01h 02mPanel Discussion:The Present and Future of AI and Security
44mArtificial Intelligence Cyber Challenge (AIxCC): Overview and Releasing Research as Open Source Software
16mThe Dungeon Master: Mastering Cybersecurity by Building CTF Challenges
01h 57mSecurity Competitions
14mClosing + CTF Wrap Up
03mComing Soon to GopherCon 2023... Capture the Flag, One Byte at a Time!
35mThe long road to autonomous cybersecurity