Skip to main content

Threat Intelligence Database

Comprehensive database of the latest cyber threats affecting organizations worldwide. Filter and search to find specific threat intelligence relevant to your organization.

Pro Console Lifetime

Stop chasing alerts. Route them.

Start free, then upgrade once to turn Radar into an automated delivery engine for your security stack.

Custom feeds / Automations: email, Slack, webhooks, SIEM/MISP / API access (baseline limits)

View Plans & Pricing

API access activates after upgrading in Console -> Billing.

Breach by OffSeqOFFSEQFRIENDS — 25% OFF

Check if your credentials are on the dark web

Instant breach scanning across billions of leaked records. Free tier available.

Scan now

Filter Threats

Narrow down the results by type, severity, or affected countries

Search threats by title, CVE ID, or description. Maximum 100 characters.
Active filters (1):Package: pkg:hex/absinthe

Threat Intelligence

Click on any threat for detailed analysis and mitigation recommendations

CVE-2026-42793 is a high-severity vulnerability in absinthe-graphql absinthe versions from 1.5.0 before 1.10.2. It allows unauthenticated denial of service via exhaustion of the Erlang VM atom table when parsing attacker-controlled GraphQL SDL documents. The vulnerability arises because Absinthe's SDL parser converts many unique names into atoms without limits, and atoms are never garbage collected, leading to a fixed-size atom table exhaustion and node crash. Any application that parses untrusted GraphQL SDL input is vulnerable, such as schema-upload endpoints or federation gateways. No official patch or remediation guidance is currently confirmed.

Join the discussion

Inefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation. 'Elixir.Absinthe.Phase.Document.Validation.UniqueFragmentNames':run/2 iterates over all fragments and for each one calls duplicate?/2, which evaluates Enum.count(fragments, &(&1.name == name)) — a full linear scan of the fragment list. The result is O(N²) comparisons per document, where N is the number of fragment definitions supplied by the caller. Because input.fragments is built directly from the GraphQL query body, N is fully attacker-controlled. A minimum-size fragment definition is roughly 16 bytes, so a ~1 MB document carries ~60,000 fragments and forces ~3.6 × 10⁹ comparisons inside this single validation phase. No authentication, schema knowledge, or special configuration is required. This issue affects absinthe: from 1.2.0 before 1.10.2.

Join the discussion

Showing 1 to 2 of 2 results

Filters:Package: pkg:hex/absinthe
Page 1 of 1
OffSeq TrainingCredly Certified

Lead Pen Test Professional

Technical5-day eLearningPECB Accredited
View courses