Research
Software Systems

Provable security: How feasible is it?

Authors

Gerwin Klein, Toby Murray, Peter Gammie, Thomas Sewell and Simon Winwood

NICTA

UNSW

Abstract

Strong, machine-checked security proofs of operating systems have been in the too hard basket long enough.

They will still be too hard for large mainstream operating systems, but even for systems designed from the ground up for security they have been counted as infeasible. There are high-level formal models, nice security properties, ways of architecting and engineering secure systems, but no implementation level proofs yet, not even with the recent verification of the seL4 microkernel.

This needs to change.

BibTeX Entry

  @inproceedings{Klein_MGSW_11,
    publisher        = {USENIX},
    author           = {Klein, Gerwin and Murray, Toby and Gammie, Peter and Sewell, Thomas and Winwood, Simon},
    month            = {may},
    year             = {2011},
    keywords         = {security, proof, sel4},
    title            = {Provable Security: How feasible is it?},
    booktitle        = {Workshop on Hot Topics in Operating Systems},
    pages            = {5},
    address          = {Napa, USA}
  }

Download