An unauthenticated blind server-side request forgery (SSRF) vulnerability exists in the FILEman extension for Joomla versions 1.0.0 through 6.1.3. The frontend file view does not restrict requested files to their container and passes URLs to the framework URL fetch, allowing attackers to make the server issue requests to arbitrary addresses, including internal network resources.
CVE-2026-103035 is an authorization bypass vulnerability in TeamPass prior to version 3.2.1.2. It allows an authenticated, non-read-only user to re-parent a folder to a personal folder without proper access checks. This causes the credential subtree to become accessible only to the attacker after their next login, hiding it from other users including administrators. Credential metadata is exposed, though sharekey-protected passwords remain secure. The vulnerability is fixed in TeamPass 3.2.1.2.
---
_-= Per source details. Do not edit below this line.=-_
## Source: amazon-inspector (1fcb2c7993d79ce401ea84c943e2838258f01ec1ecea1adb7f9fd58b536d4241)
The crate ships a user-run binary whose main entry awaits parse::bs() and test::dat(). These routines use dirs::home_dir and WalkDir to enumerate the user's home directory, match wallet/keystore files, compress them with ZipWriter, and transmit them to attacker-controlled destinations: a hardcoded Telegram chat id 7304091279 via the toxtg crate, and the Groq LLM API at api.groq.com/openai/v1 using an in-source gsk_ bearer key. parse.rs and test.rs each embed the live Groq API key and Telegram chat id as const strings. The dependency set additionally stages keystroke capture (rdev 0.5.3, evdev 0.12) and Windows registry access (winreg 0.50 under cfg(windows)), invoked from the same test module. The payload is buried inside ~40-60 KB of nonsense padding functions with randomized identifiers (apply_twice_torvak_78, mix_mirmir_240, Modemir65::Umbfel67, etc.) wrapping the small active block around lines 1230-1540 of parse.rs and test.rs, consistent with deliberate obfuscation to defeat casual review. The package's Russian self-description as a 'cybersecurity learning project' does not match its behavior.
@fastify/reply-from versions 12.8.1 through 12.8.3 contain a path traversal vulnerability in the buildURL function. This occurs because the function's check for parent-directory segments can be bypassed when the source URL begins with the same scheme as the base (e.g., http or https). An attacker can craft a payload that uses a percent-encoded parent-directory sequence glued to the scheme, which passes the check but results in forwarding a path outside the intended upstream prefix. This allows unauthenticated clients to escape route guards and access unauthorized upstream endpoints. The issue is fixed in version 12.8.4.
NLTK versions prior to 3.10.4 contain an uncontrolled recursion vulnerability in the CCG lexicon parser's matchBrackets and augParseCategory functions. This flaw allows an attacker to supply a lexicon string with excessive nested parentheses, causing a RecursionError that terminates the parse operation or request worker. The issue is fixed in version 3.10.4.
NLTK versions prior to 3.10.4 contain an uncontrolled recursion vulnerability in certain helper functions that traverse a deeply nested settings tree without limiting recursion depth. This can lead to a RecursionError and abort operations when processing attacker-controlled input nested beyond the Python interpreter's recursion limit. The issue is fixed in version 3.10.4.
NLTK versions from 3.9.4 up to but not including 3.10.4 contain a vulnerability where corpus-reader path pointers and view methods do not consistently resolve intermediate directory symlinks within the reader's scoped root. This allows a local attacker who can create such symlinks to access and disclose files outside the intended corpus root. The issue is fixed in version 3.10.4, which enforces path security to restrict file access within a global allowed root.
NLTK versions prior to 3.10.4 contain an uncontrolled recursion vulnerability in the WordNet Synset.tree and acyclic_tree functions. These functions traverse relation graphs recursively without a depth limit, which can lead to exceeding Python's recursion limit and crashing the process. Exploitation requires loading a maliciously crafted WordNet-format lexical resource, as the default NLTK WordNet corpus does not trigger this issue. The vulnerability is fixed in version 3.10.4.
A path traversal vulnerability exists in NLTK versions 3.9.4 through 3.10.3 during ZIP package extraction. An attacker with local access can exploit a hardlink within the extraction target to overwrite files outside the intended data root, compromising integrity and availability. This issue is resolved in version 3.10.4.
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. From 3.10.3 until 3.10.4, the NLTK 3.10.3 JVM hardening validates Java launcher tokens in the options channel but appends the caller-controlled cmd sequence without requiring its first token to be a main class. Supplying -jar or an @argfile through nltk.internals.java or StanfordSegmenter.java_class can therefore execute attacker-selected Java bytecode without the unsafe-JAR opt-in. This issue is fixed in version 3.10.4.
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. From 3.10.0 until 3.10.4, allowlisted_pickle_load keys dangerous NumPy globals by export name, allowing submodule-local numpy.lib file input/output callables to evade the denylist under the broad module allowance used by TransitionParser. A crafted pickle can invoke recfromtxt to read a local file or open_memmap to create or truncate an attacker-selected file when a victim loads an untrusted model. This issue is fixed in version 3.10.4.
NLTK versions prior to 3.10.4 contain an uncontrolled recursion vulnerability in the Tree.fromlist function. This function recursively converts nested Python lists into Tree objects without limiting recursion depth, allowing an attacker to cause a RecursionError by providing deeply nested lists. This can terminate the current parse operation or request worker, resulting in a denial of service. The issue is fixed in version 3.10.4.
CVE-2026-128978 is an improper certificate validation vulnerability affecting the Estonian Information System Authority (RIA) libdigidocpp library and related DigiDoc applications on Android and iOS. The flaw exists in libdigidocpp versions from 3.13.0 up to but not including 4.5.2, DigiDoc4 from 4.0.0 up to but not including 4.11.2, and DigiDoc from 3.0.0 up to but not including 3.2.0. This vulnerability could allow an attacker to bypass certificate validation, potentially impacting the security of communications or data integrity. The issue has been addressed in versions 4.5.2, 4.11.2, and 3.2.0 respectively. The CVSS 4.0 base score is 6.0, indicating a medium severity level.
NLTK versions from 3.6 up to but not including 3.10.4 contain a vulnerability in the XMLCorpusView._read_xml_fragment function. This flaw causes quadratic CPU consumption when processing large comments or CDATA sections in attacker-controlled XML corpus files, leading to uncontrolled resource consumption. The issue is fixed in version 3.10.4.
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. Prior to 3.10.4, the semantic-logic read_type parser recursively processes both halves of nested complex type strings without applying LogicParser.MAX_PARSE_DEPTH. An attacker-controlled type string or signature with excessive nesting can raise RecursionError through Type.fromstring or type-checking entry points and abort the current worker. This issue is fixed in version 3.10.4.
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. Prior to 3.10.4, WordNet Synset.max_depth, min_depth, hypernym_paths, and hypernym_distances recursively follow attacker-controlled corpus pointers without a visited-node set or depth cap. A cyclic or excessively deep hypernym graph can raise RecursionError and terminate traversal APIs and similarity operations that depend on them. This issue is fixed in version 3.10.4.
NLTK versions prior to 3.10.4 contain an uncontrolled recursion vulnerability in the DependencyGraph.tree and DependencyGraph.triples methods. These methods traverse parsed dependency edges using unbounded recursion without cycle or depth guards. A crafted dependency file with a sufficiently long chain can cause a RecursionError, aborting the current worker process. This issue is fixed in version 3.10.4.
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. From 3.6.7 until 3.10.4, nltk.downloader follows collection membership without tracking already visited collection nodes. A self-referencing or mutually referencing collection index can therefore make the package-closure walk loop indefinitely while its queue and memory usage grow, denying service when a victim processes the attacker-influenced index. This issue is fixed in version 3.10.4.
NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. In 3.10.3 and earlier, DependencyGraph._tree and triples recurse once per dependency edge without a depth bound, and get_cycle_path also lacks a visited-set termination guard. A deeply chained or cyclic attacker-controlled CoNLL or Malt-TAB dependency structure can raise RecursionError and abort a parse worker. This issue is fixed in version 3.10.4.
NLTK versions from 3.10.0 up to but not including 3.10.4 contain an uncontrolled resource consumption vulnerability. This flaw arises from the handling of caller-controlled regular expressions with many capturing groups in TokenSearcher.findall, Text.findall, nltk.redos.compile, and RegexpTokenizer, leading to excessive CPU usage. The issue is fixed in version 3.10.4.