PULSE
LIVE12signals / 24h
FEED
ransomkrybit reclama a www.ville-rinxent.fr · FR · Government & Defenseransomkrybit reclama a countrymotors.com.mx · MX · Retail & E-Commerceransomsilentransomgroup reclama a Moses & Singer · US · Professional Servicesransomkrybit reclama a www.buzztrading104.co.za · ZA · Financial Servicesransomqilin reclama a Wire Products · US · Manufacturingransomcrpxo reclama a Encore Enterprises, Inc. · US · Otherransomthegentlemen reclama a Philippine Savings Bank · PH · Financial Servicesransomplay reclama a The Butcher Brothers · US · Retail & E-Commerceransomplay reclama a Sigma Plastics Group · US · Manufacturingransomplay reclama a Cambridge Management · US · Professional Servicesransomincransom reclama a quantinuum.com · US · Technologyransomglobal secret group reclama a Vernon & Waldrep · US · Professional Servicesransomqilin reclama a The Saturday Evening Post · US · Otherransomqilin reclama a Commercial Furniture Interiors · US · Retail & E-Commerceransomkrybit reclama a www.ville-rinxent.fr · FR · Government & Defenseransomkrybit reclama a countrymotors.com.mx · MX · Retail & E-Commerceransomsilentransomgroup reclama a Moses & Singer · US · Professional Servicesransomkrybit reclama a www.buzztrading104.co.za · ZA · Financial Servicesransomqilin reclama a Wire Products · US · Manufacturingransomcrpxo reclama a Encore Enterprises, Inc. · US · Otherransomthegentlemen reclama a Philippine Savings Bank · PH · Financial Servicesransomplay reclama a The Butcher Brothers · US · Retail & E-Commerceransomplay reclama a Sigma Plastics Group · US · Manufacturingransomplay reclama a Cambridge Management · US · Professional Servicesransomincransom reclama a quantinuum.com · US · Technologyransomglobal secret group reclama a Vernon & Waldrep · US · Professional Servicesransomqilin reclama a The Saturday Evening Post · US · Otherransomqilin reclama a Commercial Furniture Interiors · US · Retail & E-Commerce
CVE Watch354,867 in full archive

Vulnerabilities exploitable today

354,867in current view

Single score combining CVSS, KEV membership and EPSS. Every CVE with its own record — timeline from publication to active exploitation.

In KEV catalog1,656
New KEV · 24H0
Exploit Today ≥ 701,601

Distribution · last window

  • Critical
    2,555
  • High
    9,167
  • Medium
    7,433
  • Low
    691
Filters

Window

Severity

Flags

Vulnerabilities333,281–333,320 · 354,867
CVECVSSEPSSKEVRExploitTitleMod.
CVE-2019-9468
6.0%
2
CVE-2018-5854
6.0%
2
CVE-2026-642967.8 HIG
6.0%
2In the Linux kernel, the following vulnerability has been resolved: exfat: bound uniname advance in exfat_find_dir_entry() In exfat_find_dir_entry(), each TYPE_EXTEND (file name) entry advances the output pointer by a fixed amount while the loop guard only tracks the accumulated name length: if (++order == 2) uniname = p_uniname->name; else uniname += EXFAT_FILE_NAME_LEN; len = exfat_extract_uni_name(ep, entry_uniname); name_len += len; unichar = *(uniname+len); *(uniname+len) = 0x0; uniname grows by EXFAT_FILE_NAME_LEN (15) per name entry, but name_len grows only by the actual extracted length, which is shorter when a name fragment contains an early NUL. The only guard is `name_len >= MAX_NAME_LENGTH`, so a crafted directory with many short name fragments lets uniname run far past the p_uniname->name[MAX_NAME_LENGTH + 3] buffer while name_len stays small, causing an out-of-bounds read and write at *(uniname+len). The sibling extractor exfat_get_uniname_from_ext_entry() already stops on a short fragment (the lockstep `len != EXFAT_FILE_NAME_LEN` guard added in commit d42334578eba ("exfat: check if filename entries exceeds max filename length")); exfat_find_dir_entry() never got the equivalent. Track the per-entry write offset as a count and reject a fragment once the offset, or the offset plus the extracted length, would exceed MAX_NAME_LENGTH, before forming the output pointer.3d
CVE-2026-643227.8 HIG
6.0%
2In the Linux kernel, the following vulnerability has been resolved: udf: validate sparing table length as an entry count, not a byte count udf_load_sparable_map() accepts a sparing table when sizeof(*st) + le16_to_cpu(st->reallocationTableLen) > sb->s_blocksize is false, i.e. it treats reallocationTableLen as a number of BYTES that must fit in the block. But the table is walked as an array of 8-byte sparingEntry elements: for (i = 0; i < le16_to_cpu(st->reallocationTableLen); i++) { struct sparingEntry *entry = &st->mapEntry[i]; ... entry->origLocation ... } in udf_get_pblock_spar15() and udf_relocate_blocks(). A reallocationTableLen of N therefore passes the check whenever sizeof(*st) + N <= blocksize, yet the consumers index sizeof(*st) + N * sizeof(struct sparingEntry) bytes -- up to ~8x the block. On a crafted UDF image this is an out-of-bounds read in udf_get_pblock_spar15(); udf_relocate_blocks() additionally feeds the same length to udf_update_tag(), whose crc_itu_t() reads far past the block, and its memmove() through st->mapEntry[] is an out-of-bounds write. Validate reallocationTableLen as the entry count it is, with struct_size().6d
CVE-2025-386157.8 HIG
6.0%
2In the Linux kernel, the following vulnerability has been resolved: fs/ntfs3: cancle set bad inode after removing name fails The reproducer uses a file0 on a ntfs3 file system with a corrupted i_link. When renaming, the file0's inode is marked as a bad inode because the file name cannot be deleted. The underlying bug is that make_bad_inode() is called on a live inode. In some cases it's "icache lookup finds a normal inode, d_splice_alias() is called to attach it to dentry, while another thread decides to call make_bad_inode() on it - that would evict it from icache, but we'd already found it there earlier". In some it's outright "we have an inode attached to dentry - that's how we got it in the first place; let's call make_bad_inode() on it just for shits and giggles".3d
CVE-2025-58432
6.0%
2
CVE-2023-20579
6.0%
2
CVE-2025-57848
6.0%
2
CVE-2021-1959
6.0%
2
CVE-2025-38344
6.0%
2
CVE-2025-13462
6.0%
2
CVE-2023-52719
6.0%
2
CVE-2022-31756
6.0%
2
CVE-2026-45669
6.0%
2
CVE-2025-62058
6.0%
2
CVE-2025-62063
6.0%
2
CVE-2025-48468
6.0%
2
CVE-2026-314105.5 MED
6.0%
2In the Linux kernel, the following vulnerability has been resolved: ksmbd: use volume UUID in FS_OBJECT_ID_INFORMATION Use sb->s_uuid for a proper volume identifier as the primary choice. For filesystems that do not provide a UUID, fall back to stfs.f_fsid obtained from vfs_statfs().9d
CVE-2019-9244
6.0%
2
CVE-2019-2220
6.0%
2
CVE-2019-9344
6.0%
2
CVE-2025-62069
6.0%
2
CVE-2024-20435
6.0%
2
CVE-2026-577868.8 HIG
6.0%
2Cross-Site Request Forgery (CSRF) vulnerability in purethemes WorkScout-Core workscout-core allows Authentication Bypass.This issue affects WorkScout-Core: from n/a through <= 1.7.08.20d
CVE-2026-59148.8 HIG
6.0%
2Type Confusion in CSS in Google Chrome prior to 147.0.7727.55 allowed an attacker who convinced a user to install a malicious extension to potentially exploit heap corruption via a crafted Chrome Extension. (Chromium security severity: Low)9d
CVE-2025-9000
6.0%
2
CVE-2025-62068
6.0%
2
CVE-2025-385847.0 HIG
6.0%
2In the Linux kernel, the following vulnerability has been resolved: padata: Fix pd UAF once and for all There is a race condition/UAF in padata_reorder that goes back to the initial commit. A reference count is taken at the start of the process in padata_do_parallel, and released at the end in padata_serial_worker. This reference count is (and only is) required for padata_replace to function correctly. If padata_replace is never called then there is no issue. In the function padata_reorder which serves as the core of padata, as soon as padata is added to queue->serial.list, and the associated spin lock released, that padata may be processed and the reference count on pd would go away. Fix this by getting the next padata before the squeue->serial lock is released. In order to make this possible, simplify padata_reorder by only calling it once the next padata arrives.3d
CVE-2025-385867.8 HIG
6.0%
2In the Linux kernel, the following vulnerability has been resolved: bpf, arm64: Fix fp initialization for exception boundary In the ARM64 BPF JIT when prog->aux->exception_boundary is set for a BPF program, find_used_callee_regs() is not called because for a program acting as exception boundary, all callee saved registers are saved. find_used_callee_regs() sets `ctx->fp_used = true;` when it sees FP being used in any of the instructions. For programs acting as exception boundary, ctx->fp_used remains false even if frame pointer is used by the program and therefore, FP is not set-up for such programs in the prologue. This can cause the kernel to crash due to a pagefault. Fix it by setting ctx->fp_used = true for exception boundary programs as fp is always saved in such programs.3d
CVE-2025-62060
6.0%
2
CVE-2019-9242
6.0%
2
CVE-2025-12840
6.0%
2
CVE-2026-32068
6.0%
2
CVE-2022-49923
6.0%
2
CVE-2025-23162
6.0%
2
CVE-2021-0941
6.0%
2
CVE-2023-28023
6.0%
2
CVE-2023-41612
6.0%
2
CVE-2024-32996
6.0%
2
CVE-2018-9544
6.0%
2