Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

28c3: The Science of Insecurity

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
14,416
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Dec 28, 2011

Download high quality version: http://bit.ly/uSJPUL
Description: http://events.ccc.de/congress/2011/Fahrplan/events/4763.en.html

Meredith L. Patterson, Sergey: The Science of Insecurity

Why is the overwhelming majority of common networked software still not secure, despite all effort to the contrary? Why is it almost certain to get exploited so long as attackers can craft its inputs? Why is it the case that no amount of effort seems to be enough to fix software that must speak certain protocols?

The answer to these questions is that for many protocols and services currently in use on the Internet, the problem of recognizing and validating their "good", expected inputs from bad ones is either not well-posed or is undecidable (i. e., no algorithm can exist to solve it in the general case), which means that their implementations cannot even be comprehensively tested, let alone automatically checked for weaknesses or correctness. The designers' desire for more functionality has made these protocols effectively unsecurable.

In this talk we'll draw a direct connection between this ubiquitous insecurity and basic computer science concepts of Turing completeness and theory of languages. We will show how well-meant protocol designs are doomed to their implementations becoming clusters of 0-days, and will show where to look for these 0-days. We will also discuss simple principles of how to avoid designing such protocols.

Link to this comment:

Share to:

Top Comments

  • Uhm, a fixed width length field most certainly does not make a protocol context sensitive, but only blows up the (D)FA needed to recognize it. On the other hand I'm reasonably sure context sensitive grammars won't cut something like Elias codes. Otherwise, Patterson's ideas are a beautiful formalization of what I've been saying for the longest time: validate first, then compute with minimal checks. Kudos!

  • @sTL45oUw Unfunny troll is unfunny. Go rate more kawasaki movies pls. We need your expertise there.

see all

All Comments (18)

Sign In or Sign Up now to post a comment!
  • I fall asleep with this video... Worst than my lecturer...

  • @GIMBLUTAXT LOL Me too!

  • Thank you. This has really opened my eyes. I'll never look at a parser the same way again.

  • Meredith really reminds me of Amy Farrah from the big bang theory.

  • "*chough* ASN.1 *cough*" ♥

  • @Jibes tinyurl_com_7x2zawj

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more