CWE-367: Time-of-check Time-of-use (TOCTOU) Race Condition
Weakness ID: 367
Abstraction: BaseStructure: Simple |
Status: Incomplete
|
TOCTTOU: |
The TOCTTOU acronym expands to "Time Of Check To Time Of Use".
|
---|---|
TOCCTOU: |
The TOCCTOU acronym is most likely a typo of TOCTTOU, but it has been used in some influential documents, so the typo is repeated fairly frequently.
|
The table(s) below shows the weaknesses and high level categories that are related to this weakness. These relationships are defined as ChildOf, ParentOf, MemberOf and give insight to similar items that may exist at higher and lower levels of abstraction. In addition, relationships such as PeerOf and CanAlsoBe are defined to show similar weaknesses that the user may want to explore.
![+](https://cwe.mitre.org/images/head_more.gif)
Nature | Type | ID | Name |
---|---|---|---|
ChildOf | ![]() |
362 | Concurrent Execution using Shared Resource with Improper Synchronization ('Race Condition') |
ParentOf | ![]() |
363 | Race Condition Enabling Link Following |
ParentOf | ![]() |
365 | Race Condition in Switch |
PeerOf | ![]() |
386 | Symbolic Name not Mapping to Correct Object |
CanFollow | ![]() |
609 | Double-Checked Locking |
![+](https://cwe.mitre.org/images/head_more.gif)
Nature | Type | ID | Name |
---|---|---|---|
MemberOf | ![]() |
557 | Concurrency Issues |
The different Modes of Introduction provide information about how and when this weakness may be introduced. The Phase identifies a point in the life cycle at which introduction may occur, while the Note provides a typical scenario related to introduction during the given phase.
Phase | Note |
---|---|
Implementation |
Languages
Class: Language-Independent (Undetermined Prevalence)
The table below specifies different individual consequences associated with the weakness. The Scope identifies the application security area that is violated, while the Impact describes the negative technical impact that arises if an adversary succeeds in exploiting this weakness. The Likelihood provides information about how likely the specific consequence is expected to be seen relative to the other consequences in the list. For example, there may be high likelihood that a weakness will be exploited to achieve a certain impact, but a low likelihood that it will be exploited to achieve a different impact.
Scope | Impact | Likelihood |
---|---|---|
Integrity Other |
Technical Impact: Alter Execution Logic; Unexpected State The attacker can gain access to otherwise unauthorized resources.
|
|
Integrity Other |
Technical Impact: Modify Application Data; Modify Files or Directories; Modify Memory; Other Race conditions such as this kind may be employed to gain read or write access to resources which are not normally readable or writable by the user in question.
|
|
Integrity Other |
Technical Impact: Other The resource in question, or other resources (through the corrupted one), may be changed in undesirable ways by a malicious user.
|
|
Non-Repudiation |
Technical Impact: Hide Activities If a file or other resource is written in this method, as opposed to in a valid way, logging of the activity may not occur.
|
|
Non-Repudiation Other |
Technical Impact: Other In some cases it may be possible to delete files a malicious user might not otherwise have access to, such as log files.
|
Example 1
The following code checks a file, then updates its contents.
...
lstat("...",sb); // it has not been updated since the last time it was read
printf("stated file ");
if (sb->st_mtimespec==...){
updateThings();
Potentially the file could have been updated between the time of the check and the lstat, especially since the printf has latency.
Example 2
The following code is from a program installed setuid root. The program performs certain file operations on behalf of non-privileged users, and uses access checks to ensure that it does not use its root privileges to perform operations that should otherwise be unavailable the current user. The program uses the access() system call to check if the person running the program has permission to access the specified file before it opens the file and performs the necessary operations.
operate(f);
...
else {
fprintf(stderr,"Unable to open file %s. ",file);
The call to access() behaves as expected, and returns 0 if the user running the program has the necessary permissions to write to the file, and -1 otherwise. However, because both access() and fopen() operate on filenames rather than on file handles, there is no guarantee that the file variable still refers to the same file on disk when it is passed to fopen() that it did when it was passed to access(). If an attacker replaces file after the call to access() with a symbolic link to a different file, the program will use its root privileges to operate on the file even if it is a file that the attacker would otherwise be unable to modify. By tricking the program into performing an operation that would otherwise be impermissible, the attacker has gained elevated privileges. This type of vulnerability is not limited to programs with root privileges. If the application is capable of performing any operation that the attacker would not otherwise be allowed perform, then it is a possible target.
Example 3
This code prints the contents of a file if a user has permission.
//resolve file if its a symbolic link
if(is_link($filename)){
if(fileowner($filename) == $user){
return;
else{
return false;
This code attempts to resolve symbolic links before checking the file and printing its contents. However, an attacker may be able to change the file from a real file to a symbolic link between the calls to is_link() and file_get_contents(), allowing the reading of arbitrary files. Note that this code fails to log the attempted access (CWE-778).
Reference | Description |
---|---|
CVE-2003-0813 |
A multi-threaded race condition allows remote attackers to cause a denial of service (crash or reboot) by causing two threads to process the same RPC request, which causes one thread to use memory after it has been freed.
|
CVE-2004-0594 |
PHP flaw allows remote attackers to execute arbitrary code by aborting execution before the initialization of key data structures is complete.
|
CVE-2008-2958 |
chain: time-of-check time-of-use (TOCTOU) race condition in program allows bypass of protection mechanism that was designed to prevent symlink attacks.
|
CVE-2008-1570 |
chain: time-of-check time-of-use (TOCTOU) race condition in program allows bypass of protection mechanism that was designed to prevent symlink attacks.
|
Phase: Implementation The most basic advice for TOCTOU vulnerabilities is to not perform a check before the use. This does not resolve the underlying issue of the execution of a function on a resource whose state and identity cannot be assured, but it does help to limit the false sense of security given by the check.
|
Phase: Implementation When the file being altered is owned by the current user and group, set the effective gid and uid to that of the current user and group when executing this statement.
|
Phase: Architecture and Design Limit the interleaving of operations on files from multiple processes.
|
Phases: Implementation; Architecture and Design If you cannot perform operations atomically and you must share access to the resource between multiple processes or threads, then try to limit the amount of time (CPU cycles) between the check and use of the resource. This will not fix the problem, but it could make it more difficult for an attack to succeed.
|
Phase: Implementation Recheck the resource after the use call to verify that the action was taken appropriately.
|
Phase: Architecture and Design Ensure that some environmental locking mechanism can be used to protect resources effectively.
|
Phase: Implementation Ensure that locking occurs before the check, as opposed to afterwards, such that the resource, as checked, is the same as it is when in use.
|
Nature | Type | ID | Name |
---|---|---|---|
MemberOf | ![]() |
361 | 7PK - Time and State |
MemberOf | ![]() |
743 | CERT C Secure Coding Standard (2008) Chapter 10 - Input Output (FIO) |
MemberOf | ![]() |
877 | CERT C++ Secure Coding Section 09 - Input Output (FIO) |
MemberOf | ![]() |
884 | CWE Cross-section |
MemberOf | ![]() |
988 | SFP Secondary Cluster: Race Condition Window |
Relationship
Research Gap
Mapped Taxonomy Name | Node ID | Fit | Mapped Node Name |
---|---|---|---|
PLOVER | Time-of-check Time-of-use race condition | ||
7 Pernicious Kingdoms | File Access Race Conditions: TOCTOU | ||
CLASP | Time of check, time of use race condition | ||
CERT C Secure Coding | FIO01-C | Be careful using functions that use file names for identification | |
Software Fault Patterns | SFP20 | Race Condition Window |
[REF-18] Secure Software, Inc.. "The CLASP Application Security Process". 2005. <https://cwe.mitre.org/documents/sources/TheCLASPApplicationSecurityProcess.pdf>.
|
[REF-367] Dan Tsafrir, Tomer Hertz, David Wagner and Dilma Da Silva. "Portably Solving File TOCTTOU Races with Hardness Amplification". 2008-02-28. <http://www.usenix.org/events/fast08/tech/tsafrir.html>.
|
[REF-44] Michael Howard, David LeBlanc and John Viega. "24 Deadly Sins of Software Security". "Sin 13: Race Conditions." Page 205. McGraw-Hill. 2010.
|
[REF-62] Mark Dowd, John McDonald and Justin Schuh. "The Art of Software Security Assessment". Chapter 9, "TOCTOU", Page 527. 1st Edition. Addison Wesley. 2006.
|