This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)
On confidentiality-preserving real-time locking protocols
Philadelphia, PA, USA USA
April 09-April 11
ISBN: 978-1-4799-0186-9
Marcus Volp, Department of Computer Science, Operating Systems Group, Technische Universita¨t Dresden, Germany
Benjamin Engel, Department of Computer Science, Operating Systems Group, Technische Universita¨t Dresden, Germany
Claude-Joachim Hamann, Department of Computer Science, Operating Systems Group, Technische Universita¨t Dresden, Germany
Hermann Hartig, Department of Computer Science, Operating Systems Group, Technische Universita¨t Dresden, Germany
Coordinating access to shared resources is a challenging task, in particular if real-time and security aspects have to be integrated into the same system. However, rather than exacerbating the problem, we found that considering real-time guarantees actually simplifies the security problem of preventing information leakage over shared-resource covert channels. We introduce a transformation for standard real-time resource locking protocols and show that protocols transformed in this way preserve the confidentiality guarantees of the schedulers on which they are based. Through this transformation, we were able to prove that four out of the seven investigated protocols are information-flow secure.
Index Terms:
resources,covert channels,information-flow security,real-time systems
Citation:
Marcus Volp, Benjamin Engel, Claude-Joachim Hamann, Hermann Hartig, "On confidentiality-preserving real-time locking protocols," rtas, pp.153-162, 2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS), 2013
Usage of this product signifies your acceptance of the Terms of Use.