Race condition in nss_ldap, when used in applications that are linked against the pthread library and fork after a call to nss_ldap, might send user data to the wrong process because of improper handling of the LDAP connection. NOTE: this issue was originally reported for Dovecot with the wrong mailboxes being returned, but other applications might also be affected.
The product contains a code sequence that can run concurrently with other code, and the code sequence requires temporary, exclusive access to a shared resource, but a timing window exists in which the shared resource can be modified by another code sequence that is operating concurrently.
| Name | Vendor | Start Version | End Version |
|---|---|---|---|
| Nss_ldap | Nss_ldap | * | * |
| Libnss-ldap | Ubuntu | dapper | * |
| Libnss-ldap | Ubuntu | edgy | * |
| Libnss-ldap | Ubuntu | feisty | * |
| Libnss-ldap | Ubuntu | gutsy | * |
| Libnss-ldap | Ubuntu | upstream | * |
| Red Hat Enterprise Linux 4 | RedHat | nss_ldap-0:253-5.el4 | * |
| Red Hat Enterprise Linux 5 | RedHat | nss_ldap-0:253-12.el5 | * |
This can have security implications when the expected synchronization is in security-critical code, such as recording whether a user is authenticated or modifying important state information that should not be influenced by an outsider. A race condition occurs within concurrent environments, and is effectively a property of a code sequence. Depending on the context, a code sequence may be in the form of a function call, a small number of instructions, a series of program invocations, etc. A race condition violates these properties, which are closely related:
A race condition exists when an “interfering code sequence” can still access the shared resource, violating exclusivity. Programmers may assume that certain code sequences execute too quickly to be affected by an interfering code sequence; when they are not, this violates atomicity. For example, the single “x++” statement may appear atomic at the code layer, but it is actually non-atomic at the instruction layer, since it involves a read (the original value of x), followed by a computation (x+1), followed by a write (save the result to x). The interfering code sequence could be “trusted” or “untrusted.” A trusted interfering code sequence occurs within the product; it cannot be modified by the attacker, and it can only be invoked indirectly. An untrusted interfering code sequence can be authored directly by the attacker, and typically it is external to the vulnerable product.