Skip to content

NuytsTech Security

  • Home
  • Terms of Use
    • Privacy Policy
  • Blog
  • Cloud Hosting
  • Contact

NuytsTech Security

  • Home
  • Terms of Use
    • Privacy Policy
  • Blog
  • Cloud Hosting
  • Contact
  • Vulnerabilities

CVE-2021-3470

by Fred · 31/03/2021

A heap overflow issue was found in Redis in versions before 5.0.10, before 6.0.9 and before 6.2.0 when using a heap allocator other than jemalloc or glibc’s malloc, leading to potential out of bound write or process crash. Effectively this flaw does not affect the vast majority of users, who use jemalloc or glibc malloc.

Date published : 2021-03-31

https://bugzilla.redhat.com/show_bug.cgi?id=1943623

Share this:

  • Click to share on X (Opens in new window) X
  • Click to share on Bluesky (Opens in new window) Bluesky
  • Click to share on Facebook (Opens in new window) Facebook
  • Click to share on LinkedIn (Opens in new window) LinkedIn
  • Click to share on Threads (Opens in new window) Threads
  • Click to share on Mastodon (Opens in new window) Mastodon

Similar

Tags: Cybersecurity Alert

  • Next story CVE-2020-19613
  • Previous story CVE-2021-3476

Recent Posts

  • CVE-2025-6081
  • CVE-2025-5967
  • CVE-2025-6940
  • CVE-2025-6939
  • CVE-2025-6938
  • CVE-2025-53096
  • CVE-2025-53095
  • CVE-2025-53003
  • CVE-2025-6937
  • CVE-2025-53005
  • CVE-2025-36056
  • CVE-2025-2141
  • CVE-2025-6936
  • CVE-2025-6935
  • CVE-2025-6932
  • CVE-2025-6931
  • CVE-2025-6930
  • CVE-2025-6554
  • CVE-2025-6929
  • CVE-2025-53004
  • CVE-2025-49521
  • CVE-2025-49520
  • CVE-2025-32463
  • CVE-2025-32462
  • CVE-2025-52997
  • CVE-2025-52996
  • CVE-2025-52995
  • CVE-2025-52901
  • CVE-2025-52491
  • CVE-2025-49493

Categories

  • Critical cyberalert
  • Vulnerabilities

Tags

CISA Cybersecurity Alert Shields Up

© 1999-2025 NUYTSTECH. All Rights Reserved. Use of the CVE (Common Vulnerabilities and Exposures) from this non-profit website are subject to the terms of use.

We use cookies to ensure that we give you the best experience on our website. If you continue to use this site we will assume that you are happy with it.OkPrivacy policy