104 matches found
EUVD-2021-1380
Malware in sbrugna...
EUVD-2021-1748
Malware in sbrugna...
EUVD-2021-0928
Malware in sbrugna...
EUVD-2021-0725
Malware in sbrugna...
EUVD-2020-3159
Malware in sbrugna...
EUVD-2025-12612
Malicious code in bioql PyPI...
EUVD-2023-26630
Malicious code in bioql PyPI...
EUVD-2023-28818
Malicious code in bioql PyPI...
EUVD-2023-30291
Malicious code in bioql PyPI...
Linux Distros Unpatched Vulnerability : CVE-2021-33587
The Linux/Unix host has one or more packages installed that are impacted by a vulnerability without a vendor supplied patch available. - The css-what package 4.0.0 through 5.0.0 for Node.js does not ensure that attribute parsing has Linear Time Complexity relative to the size of the input...
BIT-LIBPYTHON-2020-10735
A flaw was found in python. In algorithms with quadratic time complexity using non-binary bases, when using int"text", a system could take 50ms to parse an int string with 100,000 digits and 5s for 1,000,000 digits float, decimal, int.frombytes, and int for binary bases 2, 4, 8, 16, and 32 are no...
Outsourced Privacy-Preserving Feature Selection Based on Fully Homomorphic Encryption
Feature selection is a technique that extracts a meaningful subset from a set of features in training data. When the training data is large-scale, appropriate feature selection enables the removal of redundant features, which can improve generalization performance, accelerate the training process...
Denial Of Service (DoS)
vllm is vulnerable to a Denial Of Service DoS. The vulnerability is due to inefficient list concatenation operations and also dynamic replacement of placeholder tokens with repeated tokens based on precomputed lengths, allowing an attacker to trigger resource exhaustion by exploiting the quadrati...
CVE-2025-46560 vLLM phi4mm: Quadratic Time Complexity in Input Token Processing leads to denial of service
vLLM is a high-throughput and memory-efficient inference and serving engine for LLMs. Versions starting from 0.8.0 and prior to 0.8.5 are affected by a critical performance vulnerability in the input preprocessing logic of the multimodal tokenizer. The code dynamically replaces placeholder tokens...
GHSA-VC6M-HM49-G9QG phi4mm: Quadratic Time Complexity in Input Token Processing leads to denial of service
Summary A critical performance vulnerability has been identified in the input preprocessing logic of the multimodal tokenizer. The code dynamically replaces placeholder tokens e.g., , with repeated tokens based on precomputed lengths. Due to inefficient list concatenation operations, the...
phi4mm: Quadratic Time Complexity in Input Token Processing leads to denial of service
Summary A critical performance vulnerability has been identified in the input preprocessing logic of the multimodal tokenizer. The code dynamically replaces placeholder tokens e.g., , with repeated tokens based on precomputed lengths. Due to inefficient list concatenation operations, the...
CVE-2024-8763
A Regular Expression Denial of Service ReDoS vulnerability exists in the lunary-ai/lunary repository, specifically in the compileTextTemplate function. The affected version is git be54057. An attacker can exploit this vulnerability by manipulating the regular expression /.?/g, causing the server ...
Transformers Regular Expression Denial of Service (ReDoS) vulnerability
A Regular Expression Denial of Service ReDoS vulnerability was identified in the huggingface/transformers library, specifically in the file tokenizationnougatfast.py. The vulnerability occurs in the postprocesssingle function, where a regular expression processes specially crafted input. The issu...
CVE-2024-12720 Regular Expression Denial of Service (ReDoS) in huggingface/transformers
A Regular Expression Denial of Service ReDoS vulnerability was identified in the huggingface/transformers library, specifically in the file tokenizationnougatfast.py. The vulnerability occurs in the postprocesssingle function, where a regular expression processes specially crafted input. The issu...
BIT-PYTHON-MIN-2020-10735
A flaw was found in python. In algorithms with quadratic time complexity using non-binary bases, when using int"text", a system could take 50ms to parse an int string with 100,000 digits and 5s for 1,000,000 digits float, decimal, int.frombytes, and int for binary bases 2, 4, 8, 16, and 32 are no...