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-2019-10192

by Fred · 11/07/2019

A heap-buffer overflow vulnerability was found in the Redis hyperloglog data structure versions 3.x before 3.2.13, 4.x before 4.0.14 and 5.x before 5.0.4. By carefully corrupting a hyperloglog using the SETRANGE command, an attacker could trick Redis interpretation of dense HLL encoding to write up to 3 bytes beyond the end of a heap-allocated buffer.

Date published : 2019-07-11

http://www.securityfocus.com/bid/109290

https://seclists.org/bugtraq/2019/Jul/19

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-2019-1010310
  • Previous story CVE-2017-7189

Recent Posts

  • CVE-2025-8832
  • CVE-2025-7965
  • CVE-2025-8854
  • CVE-2025-8831
  • CVE-2025-8830
  • CVE-2025-8829
  • CVE-2025-8828
  • CVE-2025-8827
  • CVE-2025-27577
  • CVE-2025-27562
  • CVE-2025-27536
  • CVE-2025-27128
  • CVE-2025-26690
  • CVE-2025-25278
  • CVE-2025-25212
  • CVE-2025-24925
  • CVE-2025-24844
  • CVE-2025-24298
  • CVE-2025-8826
  • CVE-2025-8825
  • CVE-2025-8824
  • CVE-2025-8823
  • CVE-2025-8822
  • CVE-2025-8821
  • CVE-2025-8820
  • CVE-2025-8819
  • CVE-2025-8818
  • CVE-2025-8817
  • CVE-2025-8816
  • CVE-2025-8815

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.