CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Controlled Declassification based on Intransitive Noninterference

Heiko Mantel ; David Sands (Institutionen för datavetenskap, ProSec)
Lecture Notes in Computer Science - Proceedings of the Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004 (0302-9743). Vol. 3302 (2004), p. 129-145.
[Konferensbidrag, refereegranskat]

Traditional noninterference cannot cope with common features of secure systems like channel control, information filtering, or explicit downgrading. Recent research has addressed the derivation and use of weaker security conditions that could support such features in a language-based setting. However, a fully satisfactory solution to the problem has yet to be found. A key problem is to permit exceptions to a given security policy without permitting too much. In this article, we propose an approach that draws its underlying ideas from intransitive noninterference, a concept usually used on a more abstract specification level. Our results include a new bisimulation-based security condition that controls tightly where downgrading can occur and a sound security type system for checking this condition.



Denna post skapades 2006-09-28. Senast ändrad 2013-07-10.
CPL Pubid: 12230

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för datavetenskap, ProSec (2002-2004)

Ämnesområden

Datalogi

Chalmers infrastruktur