This project contains known security vulnerabilities. Find detailed information at the bottom.
quadit(15 total, 1 insecure)
| Crate | Required | Latest | Status |
|---|---|---|---|
| anyhow | ^1.0.100 | 1.0.102 | up to date |
| quaditsync | ^1.0.2 | 1.0.2 | up to date |
| serde | ^1.0.228 | 1.0.228 | up to date |
| serde_yaml | ^0.9.34 | 0.9.34+deprecated | up to date |
| tokio-cron-scheduler | ^0.15.1 | 0.15.1 | up to date |
| uuid | ^1.19.0 | 1.22.0 | up to date |
| tokio | ^1.49.0 | 1.50.0 | up to date |
| dotenvy | ^0.15.7 | 0.15.7 | up to date |
| chrono | ^0.4.42 | 0.4.44 | up to date |
| tracing | ^0.1.44 | 0.1.44 | up to date |
| tracing-subscriber | ^0.3.22 | 0.3.23 | up to date |
| url | ^2.5.7 | 2.5.8 | up to date |
| users ⚠️ | ^0.11 | 0.11.0 | insecure |
| reqwest | ^0.13.1 | 0.13.2 | up to date |
| dirs | ^6.0.0 | 6.0.0 | up to date |
(3 total, 1 possibly insecure)
| Crate | Required | Latest | Status |
|---|---|---|---|
| claims | ^0.8.0 | 0.8.0 | up to date |
| time ⚠️ | ^0.3.44 | 0.3.47 | maybe insecure |
| timer | ^0.2.0 | 0.2.0 | up to date |
users: `root` appended to group listingsAffected versions append root to group listings, unless the correct listing
has exactly 1024 groups.
This affects both:
If the caller uses this information for access control, this may lead to privilege escalation.
This crate is not currently maintained, so a patched version is not available.
Versions older than 0.8.0 do not contain the affected functions, so downgrading to them is a workaround.
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.