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.

Crate bevy_render

Dependencies

(28 total, 19 outdated, 2 possibly insecure)

CrateRequiredLatestStatus
 anyhow^1.01.0.93up to date
 bevy_app^0.6.00.14.2out of date
 bevy_asset^0.6.00.14.2out of date
 bevy_core^0.6.00.14.2out of date
 bevy_crevice^0.6.00.7.0out of date
 bevy_derive^0.6.00.14.2out of date
 bevy_ecs^0.6.00.14.2out of date
 bevy_math^0.6.00.14.2out of date
 bevy_reflect^0.6.00.14.2out of date
 bevy_transform^0.6.00.14.2out of date
 bevy_utils^0.6.00.14.2out of date
 bevy_window^0.6.00.14.2out of date
 bitflags^1.2.12.6.0out of date
 codespan-reporting^0.11.00.11.1up to date
 copyless^0.1.50.1.5up to date
 downcast-rs^1.2.01.2.1up to date
 futures-lite^1.4.02.5.0out of date
 hex^0.4.20.4.3up to date
 hexasphere^6.0.015.0.0out of date
 image^0.23.120.25.5out of date
 naga^0.8.023.0.0out of date
 once_cell^1.4.11.20.2up to date
 parking_lot^0.11.00.12.3out of date
 regex ⚠️^1.51.11.1maybe insecure
 serde^11.0.215up to date
 smallvec ⚠️^1.61.13.2maybe insecure
 thiserror^1.02.0.3out of date
 wgpu^0.12.023.0.0out of date

Security Vulnerabilities

smallvec: Buffer overflow in SmallVec::insert_many

RUSTSEC-2021-0003

A bug in the SmallVec::insert_many method caused it to allocate a buffer that was smaller than needed. It then wrote past the end of the buffer, causing a buffer overflow and memory corruption on the heap.

This bug was only triggered if the iterator passed to insert_many yielded more items than the lower bound returned from its size_hint method.

The flaw was corrected in smallvec 0.6.14 and 1.6.1, by ensuring that additional space is always reserved for each item inserted. The fix also simplified the implementation of insert_many to use less unsafe code, so it is easier to verify its correctness.

Thank you to Yechan Bae (@Qwaz) and the Rust group at Georgia Tech’s SSLab for finding and reporting this bug.

regex: Regexes with large repetitions on empty sub-expressions take a very long time to parse

RUSTSEC-2022-0013

The Rust Security Response WG was notified that the regex crate did not properly limit the complexity of the regular expressions (regex) it parses. An attacker could use this security issue to perform a denial of service, by sending a specially crafted regex to a service accepting untrusted regexes. No known vulnerability is present when parsing untrusted input with trusted regexes.

This issue has been assigned CVE-2022-24713. The severity of this vulnerability is "high" when the regex crate is used to parse untrusted regexes. Other uses of the regex crate are not affected by this vulnerability.

Overview

The regex crate features built-in mitigations to prevent denial of service attacks caused by untrusted regexes, or untrusted input matched by trusted regexes. Those (tunable) mitigations already provide sane defaults to prevent attacks. This guarantee is documented and it's considered part of the crate's API.

Unfortunately a bug was discovered in the mitigations designed to prevent untrusted regexes to take an arbitrary amount of time during parsing, and it's possible to craft regexes that bypass such mitigations. This makes it possible to perform denial of service attacks by sending specially crafted regexes to services accepting user-controlled, untrusted regexes.

Affected versions

All versions of the regex crate before or equal to 1.5.4 are affected by this issue. The fix is include starting from regex 1.5.5.

Mitigations

We recommend everyone accepting user-controlled regexes to upgrade immediately to the latest version of the regex crate.

Unfortunately there is no fixed set of problematic regexes, as there are practically infinite regexes that could be crafted to exploit this vulnerability. Because of this, we do not recommend denying known problematic regexes.

Acknowledgements

We want to thank Addison Crump for responsibly disclosing this to us according to the Rust security policy, and for helping review the fix.

We also want to thank Andrew Gallant for developing the fix, and Pietro Albini for coordinating the disclosure and writing this advisory.