ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Electronic Notes in Theoretical Computer Science
Volume 153, Issue 2, 23 May 2006, Pages 33-55
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (379 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2005.10.031    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Preventing Timing Leaks Through Transactional Branching Instructions

Gilles Barthea, E-mail The Corresponding Author, Tamara Rezka, E-mail The Corresponding Author and Martijn Warnierb, E-mail The Corresponding Author

aINRIA Sophia-Antipolis, Project EVEREST, 2004, Route de Lucioles, BP 93, Sophia-Antipolis Cedex, France bRadboud University Nijmegen, SoS group, Toernooiveld 1, 6500 GL, Nijmegen, The Netherlands

Available online 18 May 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Timing channels constitute one form of covert channels through which programs may be leaking information about the confidential data they manipulate. Such timing channels are typically eliminated by design, employing ad-hoc techniques to avoid information leaks through execution time, or by program transformation techniques, that transform programs that satisfy some form of noninterference property into programs that are time-sensitive termination-sensitive non-interfering. However, existing program transformations are thus far confined to simple languages without objects nor exceptions.

We introduce a program transformation that uses transaction mechanisms to prevent timing leaks in sequential object-oriented programs. Under some strong but reasonable hypotheses, the transformation preserves the semantics of programs and yields for every termination-sensitive noninterfering program a time-sensitive termination-sensitive non-interfering program.

Keywords: Non-interference; Timing leaks; Security; Program transformation; Semantics


Electronic Notes in Theoretical Computer Science
Volume 153, Issue 2, 23 May 2006, Pages 33-55
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.