« Don't look at me, I'm hideous! | Main | Next BaySec: 6/19/08 »

The highest form of flattery.

Juan Caballero, Theocharis Kampouris, Dawn Song, and Jia Wang published some interesting extensions at this year's NDSS of the work presented by Harish Sethu and me at CCS '04.

Both papers examine the software diversity problem, which states that networks of systems would be more secure if they minimized the number of possible common mode faults by running different software and operating systems, by relating it to the graph coloring problem. The thesis of both papers is that software diversity can be improved by using graph coloring algorithms to maximize diverse software allocation.

This title of this post's implication is only in jest, as I am incredibly happy to see our idea extended by the research community.

Post a comment

(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)


This page contains a single entry from the blog posted on June 17, 2008 1:58 PM.

The previous post in this blog was Don't look at me, I'm hideous!.

The next post in this blog is Next BaySec: 6/19/08.

Many more can be found on the main index page or by looking through the archives.

Powered by
Movable Type 3.33