ELSA-2023-2784: grafana security update (MODERATE)

ELSA-2023-2167: grafana security and enhancement update (MODERATE)

ELSA-2023-2780: Image Builder security, bug fix, and enhancement update (MODERATE)

ELSA-2023-2204: Image Builder security, bug fix, and enhancement update (MODERATE)

ELSA-2023-18908: ol8addon security update (IMPORTANT)

ELSA-2024-0121: container-tools:4.0 security update (MODERATE)

ELSA-2023-2357: git-lfs security and bug fix update (MODERATE)

Security update for go1.19

Security update for go1.18

Moderate: go-toolset:rhel8 security and bug fix update

Moderate: go-toolset and golang security and bug fix update

ELSA-2023-2866: git-lfs security and bug fix update (MODERATE)

ELSA-2023-0446: go-toolset:ol8 security and bug fix update (MODERATE)

ELSA-2023-0328: go-toolset and golang security and bug fix update (MODERATE)

ELSA-2024-3254: container-tools:ol8 security update (IMPORTANT)

ELSA-2022-24267: ol8addon security update (IMPORTANT)

Security update for SUSE Manager Client Tools

Programs which compile regular expressions from untrusted sources may be vulnerable to memory exhaustion or denial of service. The parsed regexp representation is linear in the size of the input, but in some cases the constant factor can be as high as 40,000, making relatively small regexps consume much larger amounts of memory. After fix, each regexp being parsed is limited to a 256 MB memory footprint. Regular expressions whose representation would use more space than that are rejected. Normal use of regular expressions is unaffected.

Programs which compile regular expressions from untrusted sources may be vulnerable to memory exhaustion or denial of service. The parsed regexp representation is linear in the size of the input, but in some cases the constant factor can be as high as 40,000, making relatively small regexps consume much larger amounts of memory. After fix, each regexp being parsed is limited to a 256 MB memory footprint. Regular expressions whose representation would use more space than that are rejected. Normal use of regular expressions is unaffected.

Programs which compile regular expressions from untrusted sources may be vulnerable to memory exhaustion or denial of service. The parsed regexp representation is linear in the size of the input, but in some cases the constant factor can be as high as 40,000, making relatively small regexps consume much larger amounts of memory. After fix, each regexp being parsed is limited to a 256 MB memory footprint. Regular expressions whose representation would use more space than that are rejected. Normal use of regular expressions is unaffected.