همهٔ گزارش‌ها
متوسط

kernel: bpf: Fix out-of-bounds write in trie_get_next_key()

متن اصلی

نسخه‌های متأثر

نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده
نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده
نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده
نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده

بهره‌برداری

CVE-2024-50262

احتمال بهره‌برداری در ۳۰ روز آینده: 0.27%

FIRST EPSS · ۱۴۰۵/۰۸/۲۸

شرح آسیب‌پذیری

In the Linux kernel, the following vulnerability has been resolved: bpf: Fix out-of-bounds write in trie_get_next_key() trie_get_next_key() allocates a node stack with size trie->max_prefixlen, while it writes (trie->max_prefixlen + 1) nodes to the stack when it has full paths from the root to leaves. For example, consider a trie with max_prefixlen is 8, and the nodes with key 0x00/0, 0x00/1, 0x00/2, ... 0x00/8 inserted. Subsequent calls to trie_get_next_key with _key with .prefixlen = 8 make 9 nodes be written on the node stack with size 8.

A flaw was found in the Linux kernel's Berkeley Packet Filter (BPF) component. A privileged local attacker could exploit an out-of-bounds write vulnerability in the trie_get_next_key() function. This occurs because the function attempts to write more data than the allocated buffer size, leading to memory corruption. Successful exploitation could result in a denial of service or potentially arbitrary code execution.