This project might be open to known security vulnerabilities, which can be prevented by tightening the version range of affected dependencies. Find detailed information at the bottom.
rouille(16 total, 3 outdated, 2 possibly insecure)
| Crate | Required | Latest | Status |
|---|---|---|---|
| base64 | ^0.13 | 0.22.1 | out of date |
| brotli | ^3.3.2 | 8.0.2 | out of date |
| chrono ⚠️ | ^0.4.19 | 0.4.44 | maybe insecure |
| deflate | ^1.0.0 | 1.0.0 | up to date |
| filetime | ^0.2.0 | 0.2.27 | up to date |
| multipart | ^0.18 | 0.18.0 | up to date |
| percent-encoding | ^2 | 2.3.2 | up to date |
| rand | ^0.8 | 0.10.0 | out of date |
| serde | ^1 | 1.0.228 | up to date |
| serde_derive | ^1 | 1.0.228 | up to date |
| serde_json | ^1 | 1.0.149 | up to date |
| sha1_smol | ^1.0.0 | 1.0.1 | up to date |
| threadpool | ^1 | 1.8.1 | up to date |
| time ⚠️ | ^0.3.15 | 0.3.47 | maybe insecure |
| tiny_http | ^0.12.0 | 0.12.0 | up to date |
| url | ^2 | 2.5.8 | up to date |
(2 total, all up-to-date)
| Crate | Required | Latest | Status |
|---|---|---|---|
| log | ^0.4 | 0.4.29 | up to date |
| postgres | ^0.19 | 0.19.12 | up to date |
chrono: Potential segfault in `localtime_r` invocationsUnix-like operating systems may segfault due to dereferencing a dangling pointer in specific circumstances. This requires an environment variable to be set in a different thread than the affected functions. This may occur without the user's knowledge, notably in a third-party library.
No workarounds are known.
time: Denial of Service via Stack ExhaustionWhen user-provided input is provided to any type that parses with the RFC 2822 format, a denial of service attack via stack exhaustion is possible. The attack relies on formally deprecated and rarely-used features that are part of the RFC 2822 format used in a malicious manner. Ordinary, non-malicious input will never encounter this scenario.
A limit to the depth of recursion was added in v0.3.47. From this version, an error will be returned rather than exhausting the stack.
Limiting the length of user input is the simplest way to avoid stack exhaustion, as the amount of the stack consumed would be at most a factor of the length of the input.