Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home » Portably Solving File TOCTTOU Races with Hardness Amplification
Tweet

connect with us

Portably Solving File TOCTTOU Races with Hardness Amplification

Abstract: 

The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect these problems (by pinpointing their locations in the code), or prevent the problem altogether (by modifying the kernel or its API). The latter alternative is not prevalent, and the former is just the first step: programmers must still address TOCTTOU flaws within the limits of the existing API with which several important tasks can not be accomplished in a portable straightforward manner. Recently, Dean and Hu addressed this problem and suggested a probabilistic hardness amplification approach that alleviated the matter. Alas, shortly after, Borisov et al. responded with an attack termed “filesystem maze” that defeated the new approach.

We begin by noting that mazes constitute a generic way to deterministically win many TOCTTOU races (gone are the days when the probability was small). In the face of this threat, we (1) develop a new user-level defense that can withstand mazes, and (2) show that our method is undefeated even by much stronger hypothetical attacks that provide the adversary program with ideal conditions to win the race (enjoying complete and instantaneous knowledge about the defending program's actions and being able to perfectly synchronize accordingly). The fact that our approach is immune to these unrealistic attacks suggests it can be used as a simple and portable solution to a large class of TOCTTOU vulnerabilities, without requiring modifications to the underlying operating system.

Dan Tsafrir, IBM T.J. Watson Research Center

Tomer Hertz, Microsoft Research

David Wagner, University of California, Berkeley

Dilma Da Silva, IBM T.J. Watson Research Center

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

BibTeX
@inproceedings {268336,
author = {Dan Tsafrir and Tomer Hertz and David Wagner and Dilma Da Silva},
title = {Portably Solving File {TOCTTOU} Races with Hardness Amplification},
booktitle = {6th USENIX Conference on File and Storage Technologies (FAST 08)},
year = {2008},
address = {San Jose, CA},
url = {https://www.usenix.org/conference/fast-08/portably-solving-file-tocttou-races-hardness-amplification},
publisher = {USENIX Association},
month = feb,
}
Download

Presentation Video

Presentation Audio

MP3 Download OGG Download

Download Audio

Links

Paper: 
http://usenix.org/events/fast08/tech/full_papers/tsafrir/tsafrir.pdf
Paper (HTML): 
http://usenix.org/events/fast08/tech/full_papers/tsafrir/tsafrir_html/index.html
Award: 
Best Paper
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Contact Us