- How Arbitrum's freezes send transactions from an address without its key
Analysis of the Arbitrum Security Council's 30 October 2026 freeze of 8,425 ETH and 74,559,805.2 ARB on Arbitrum One, tied to the Binance exploit. In one L1 transaction, the council's 9 of 12 Safe used the UpgradeExecutor to swap the Inbox implementation, so the message arrived without address aliasing and landed as type 0x65 transactions with a zero signature. The post lists monitoring advice: alert on Inbox Upgraded events, since the EIP-1967 slot never showed the change.
ethereum-magicians.orgarticlePublished and added 2 Nov 2026π‘οΈ Security
Binance Drained of $5.5 Billion in Suspected Hack, Tether and Circle Freeze $1.8 BillionDecrypt reports that at least $5.57 billion left Binance-linked hot wallets on Ethereum, Bitcoin and Tron on 29 October 2026, which would be the largest crypto hack on record. On-chain analysts point to an EIP-7702 delegation, installed from a Tornado Cash-funded address minutes before the first sweep. Tether and Circle froze about $1.8 billion. Binance has not confirmed the hack, and how the attacker obtained the signature is unknown.
decrypt.coarticlePublished and added 29 Oct 2026π‘οΈ Security
Rekt - SingularityNET - RektSingularityNET exploit (19 September 2026): attackers with signing authority exposed through a cloud infrastructure breach drained 8.72M FET from the Ethereum bridge converter, then minted about 2.3 billion AGIX, NTX, WMTX and CGV. Rekt's transaction-level reconstruction puts gross liquid proceeds near $2.29M, not the $16.77M headline, and traces laundering via Chainflip, Baltex and THORChain. It notes conversionIn() skipped checkLimits() and trusted a single EOA signature.
rekt.newswriteupAdded 29 Oct 2026π‘οΈ Security
Introducing MavenGate: a supply chain attack method for Java and Android applications | Oversecured BlogMavenGate is Oversecured's research on hijacking Maven dependencies by buying expired domains behind groupIds on Maven Central and JitPack. It found 6,170 of 33,938 checked domains (18.18%) vulnerable, and tested the attack with its own com.oversecured:hello-world library. It lists defenses (Gradle verification-metadata.xml, PGP signatures) and proposes changes to repository signing.
oversecured.comwriteupAdded 29 Oct 2026π‘οΈ Security
Inventory of PQ P2P Migrations in the Consensus LayerInventory of post-quantum migration work for Ethereum consensus-layer networking, by adust09 of Nyx Foundation. It maps three targets: Discovery v5/ENR signatures and key exchange, TLS 1.3 key agreement in QUIC, and libp2p TLS identity binding and CertificateVerify. It covers the 300-byte ENR and 1,280-byte packet limits, why hybrid KEMs do not authenticate peers, and downgrade and DoS concerns. It selects no algorithm or schedule.
ethresear.charticlePublished and added 27 Oct 2026π‘οΈ Security
Falcon Key Recovery from Joint Sampler LeakagesFalcon Key Recovery from Joint Sampler Leakages is an ePrint paper presenting a power side-channel attack on Falcon and FN-DSA that fuses three SamplerZ leakages (exponent class of the center, sign bit, proposal magnitude). It turns them into slab and halfspace constraints solved by softplus interval regression, with no LLL or BKZ. On PQClean Falcon-512 (ARM Cortex-M4) it recovered all 50 keys with at most 34 signatures; on c-fn-dsa it recovered 38 of 50 keys within 200 signatures.
eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π‘οΈ Security
Bitcoin Wallet Fixes Critical Flaw That Redirected Funds to AttackersElectrum 4.8.3, released 24 October 2026, fixes a high-severity flaw in the Bitcoin wallet. Rogue servers could suppress a real payment and inject a fake unconfirmed transaction paying an attacker, so a user's fee-bump became the first transaction broadcast. The fix verifies signatures on wallet-owned inputs, but incoming transactions from external senders stay unverified. One user lost funds on 18 October.
decrypt.coarticlePublished and added 26 Oct 2026π‘οΈ Security
Bitcoin wallet bug let rogue servers steal funds when users tried to speed up paymentsElectrum, a Bitcoin software wallet, disclosed on 24 October 2026 a flaw where malicious servers swapped pending transactions for fake ones with invalid signatures that the wallet did not check. When users chose Replace-by-Fee to raise the fee, Electrum signed a valid replacement paying the attacker, and at least one user lost funds. Version 4.8.3 adds signature checks; users of only trusted or self-run servers were not exposed.
coindesk.comarticlePublished and added 26 Oct 2026π‘οΈ Security
A KelseyβKohno Attack Variant against SHA-2 Message Digests in HSS/LMS and XMSSFalko Strenzke's ePrint 2026/2635 presents a multi-target second-preimage attack on message hashing in HSS/LMS and XMSS with SHA-256 and SHA-256/192. It herds chaining states from many collected signatures into one state, defeating the key and leaf-index prefix. With 2^64 signatures, SHA-256 cost falls from 2^256 to about 2^166 (2^156 at maximal message length). SHAKE256 parameter sets are unaffected.
eprint.iacr.orgpaperAdded 26 Oct 2026, published 25 Oct 2026π‘οΈ Security
A hash-only rollup: OP Stack L2 accounts as Lamport-style hash chains, no ECDSA inside the L2Hash-only rollup: an OP Stack L2 (chain ID 42069000, live since 30 September 2026) where accounts are keccak-256 hash chains and transactions carry no signatures. Spending uses a commit-reveal step through two new transaction types in op-geth. The post describes a flaw the authors found: unauthenticated commits could be overwritten, which allowed preimage front-running. It was fixed with a first-commit-wins rule on 21 October 2026. It lists the remaining limits: L1 ECDSA, no fault proofs, a centralized sequencer, 160-bit addresses and wallet desync.
ethresear.charticlePublished and added 24 Oct 2026π‘οΈ Security
Chosen Commitments and Certified Decoding Regions in the Adaptive Threshold Schnorr AttackThis IACR ePrint 2026/2632 paper by DemirtaΕ and Yayla analyses the CritesβStewart adaptive forgery attack on threshold Schnorr signatures, which needs one call to a sparse linear search oracle (bounded distance decoding of a scaled ReedβSolomon code). It shows that choosing the commitment coefficient vector does not help much: a wrapper adversary with Q challenges succeeds with probability at most QM/p, even if its solvers decode every witness for free. For the six original (N, Ο) pairs, M stays below 2^24, so the bound is under 2^-100 after 2^128 challenges at p = 2^252.
eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026π‘οΈ Security
Electrum wallet security flaw is fixed after a user loses money in fee attackElectrum 4.8.3, released 24 October 2026, fixes a flaw where a malicious server replaces a user's unconfirmed payment with a conflicting transaction carrying invalid signatures. If the user then bumps the fee with replace-by-fee, the wallet signs a payment to the attacker. One of two reporting users lost funds, and the patch now checks input signatures before accepting such transactions. Bull Bitcoin is adding the same client-side check.
en.cryptonomist.charticlePublished and added 24 Oct 2026π‘οΈ Security
The Exact Bit Security of Hash-Based SignaturesThe Exact Bit Security of Hash-Based Signatures is a 2026 IACR ePrint paper that analyses XMSS with 128-bit digests and SLH-DSA-128s in the random oracle model, with proofs formalised in Lean4. Strong unforgeability comes to 127 bits under most accounting modes but only 122 bits if just direct random oracle queries are counted. The authors give matching attacks, and show how resource accounting changes the result.
eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026π‘οΈ Security
Faster and Smaller Anonymous Credentials from Standardized SignaturesGordieHowe is a language, certifying compiler and zero-knowledge proof system for building anonymous credentials on standardized signatures (ECDSA, RSA, ML-DSA). It proves an ECDSA-signed mobile driving license presentation in 64.8 ms with a 276 KiB proof, 10.1x faster than Google's Longfellow, and an ML-DSA-44 signature in 87.3 ms with at least 116 bits of quantum security. Compiler output and security theorems are checked in Lean. It introduces series-parallel IOPs and extends the BCS transformation in the QROM.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 23 Oct 2026π‘οΈ Security
Agentic AI Defense: Decode-Time Provenance Binding for MCPDecode-time provenance binding is a defense for Model Context Protocol agent pipelines against cross-modal trust laundering, where instructions hidden in an email-signature image via LSB, DCT or metadata steganography get decoded by a tool. It combines HMAC-authenticated trust labels, a provenance ledger and context-taint tracking to block critical tool calls. On a real MCP testbed with 24 adaptive payloads, attack success fell from 100% undefended (62.5% for keyword and regex filters) to 0%.
arxiv.orgpaperAdded 26 Oct 2026, published 22 Oct 2026π‘οΈ Security
Balsamic: One-round Threshold UOV from GPU-Accelerated FHEBalsamic is a complete homomorphic Unbalanced Oil and Vinegar (UOV) signer, used to build one-round threshold UOV signatures from a packed discrete-CKKS FHE circuit. A paired-pivot linear solver and pivot-success certificates allow encrypted retry selection. In 2-out-of-3 semihonest signing, each online partial signature takes 10.7 s on an RTX 6000 Ada and 7.77 s on a GB300, with 5.25 MB per response.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026π‘οΈ Security
Integer Coordinate Families and Threshold RSA Signatures for Any Prime ExponentPaper by Shivansh Jaiswal and Somitra Sanadhya (IACR ePrint 2026/2601) on integer coordinate families for threshold RSA signatures with prime exponent e. It shows the CT-RSA 2026 Ng-Lau scheme admits trivial forgeries and has a flawed proof. It proposes repaired scheme PiIC and integer secret-sharing scheme PiZ for any prime e and any (t,n), both proven TS-UF-CMA secure under the standard RSA assumption. It also gives super-polynomial coordinate lower bounds for pairwise families.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026π‘οΈ Security
Coinbase's Plan for a Quantum-Safe BitcoinBankless summary of Coinbase's October 2026 proposal for making Bitcoin quantum-safe. It covers upgradeable address designs (BIP-360 P2MR, P2TRv2, hybrid addresses), four candidate signatures (ML-DSA, SLH-DSA, FN-DSA, SHRINCS) with size and stateful-key-reuse trade-offs, a five-stage migration plan, and a separate track for dormant coins with exposed public keys such as Satoshi's.
bankless.comarticlePublished and added 21 Oct 2026π‘οΈ Security
Verifiable Post-Quantum TLS Handshake: Recognizing Implementation Errors of Cryptographic Verification StepsPQCD-TLS is a post-quantum TLS handshake that binds confirmation codes into chained key derivation, so a faulty signature or KEM verification step causes a key mismatch and handshake failure. The authors build confirmation-code frameworks for ML-DSA and Falcon signatures and for ML-KEM, HQC and DAWN, with unpredictability proofs. Across 48 configurations, handshake latency overhead stays below 1%.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026π‘οΈ Security
SHAKEing SLH-DSA with Non-profiled SCAsSHAKEing SLH-DSA with Non-profiled SCAs is an eShard ePrint paper (2026/2584) on correlation power analysis of SLH-DSA-SHAKE, the NIST-standardised hash-based signature scheme. It analyses PRF inputs and selection functions, then combines subtrace averaging, partial-then-total CPA and an efficient exhaustive search to recover the full secret seed, enabling universal forgery. On a 32-bit microcontroller the attack needs about 280 to 559 signatures, and the search finishes within 45 minutes on 72 cores.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026π‘οΈ Security
HAETAE on a Diet: Less Stack, Less Time on Low-End MicrocontrollersThis ePrint paper presents an optimized HAETAE implementation, a lattice-based post-quantum signature scheme, for Cortex-M4, Cortex-M3, MSP430 and AVR. It keeps polynomials in 16 bits, shares buffers between objects with disjoint lifetimes, and replays Gaussian samples instead of regenerating them. On an ATmega2560, HAETAE-2 key generation, signing and verification run in 8,070 B of SRAM. Stack use drops up to 34% and signing is 1.18-2.51x faster than Low-Stack HAETAE.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026π‘οΈ Security
Fault-Induced Nonce Repetition in Threshold Lattice Signatures: A Reveal-Structure Criterion, Cross-Scheme Analysis, and Detection BoundariesFault-Induced Nonce Repetition in Threshold Lattice Signatures is an ePrint paper (2026/2566, Yulong Meng) showing that faulting t devices in a t-of-n threshold ML-DSA deployment recovers the full signing secret, verified on Mithril with exact recovery in 96/96 scan groups. It gives a reveal-structure criterion across Quorus, TALUS and Trilithium, a threshold law m* = (β-1)N+βN/Kβ for imperfect faults, and two-layer transcript detection (305/305 hits, no false positives).
eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026π‘οΈ Security
FN-DSA on Arm Cortex-M55: Revisiting a Floating-Point Lattice Signature with Native FP64 and HeliumFN-DSA on Arm Cortex-M55 is an ePrint paper presenting the first FN-DSA (NIST post-quantum signature) implementation on this core that reproduces the reference known-answer tests and runs in constant time. It uses the native FP64 FPU for signing and Helium (MVE) for NTT, key-generation FFT and Keccak, with SLOTHY rescheduling. Key generation, signing and verification are up to 1.23x, 1.93x and 1.30x faster than the reference, and four-signature batch verification up to 1.75x.
eprint.iacr.orgpaperPublished and added 20 Oct 2026π‘οΈ Security
Plex vulnerabilities being exploited in the wild to drop a cryptominerHoneypot writeup of in-the-wild exploitation of Plex Media Server through the Plex2Shell chain (CVE-2026-96652, -96654, -96655, -96656) in October 2026. Attackers from 45.194.92.222, 91.92.40.202 and 176.65.139.228 used SSRF-style timeline/subscribe requests and downloaded a Docker-named dropper and an XMRig miner from 217.60.194.116. Includes file hashes, a later-seen proxyware sample (myawesomeproxy), lab pcaps for signatures and links to sandbox reports.
boredhackerblog.infowriteupAdded 20 Oct 2026, published 19 Oct 2026π‘οΈ Security
A Note on the Security of ECDSA with Presignatures or Biased NoncesA Note on the Security of ECDSA with Presignatures or Biased Nonces (Couteau and Makriyannis, ePrint 2026/2545) examines alternative ECDSA modes built for faster distributed signing. It shows that the security of some variants used in deployed libraries is equivalent, in the generic group and random oracle model, to the average-case hardness of k-SUM. It also proves fine-grained lower bounds on generic group attacks against modes analyzed by Groth and Shoup (Eurocrypt 2022).
eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026π‘οΈ Security
Efficient and Compact High-order Masking Raccoon on Memory Constrained DevicesThe paper presents the first efficient, compact implementation of high-order masked Raccoon (lattice-based signature, CRYPTO 2024) on ARM Cortex-M4, up to 32 masking orders. It uses 3+3+3 layer-merged 32-bit NTT/INTT with lazy reduction, a negative double Montgomery reduction, and one-shot SHAKE256 sampling (at least 1.80x faster). It beats the reference by 1.85x-2.25x and masked Dilithium3 at orders 2, 4 and 8. Second-order leakage tests show DPA resistance once micro-architectural transitional leakage is mitigated.
eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026π‘οΈ Security
Revisiting the Security of VDOORevisiting the Security of VDOO is an ePrint paper (October 2026) on VDOO, a multivariate signature scheme submitted to China's NGCC program. It models VDOO as a multilayer Rainbow construction, keeps only the last oil space to get a generalized UOV instance, and applies wedge attacks. For the 512-bit parameter set it estimates 2^432 gates (reconciliation) and 2^379 gates (intersection), below the claimed level and the specification's figures.
eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026π‘οΈ Security
Enjoy FAEST on Hardware: Efficient and Novel Hardware Acceleration of Emerging Post-Quantum Digital Signature Scheme FAESTThis ePrint paper (2026/2525, October 2026) by Brendan Funk and Jiafeng Xie presents the first hardware accelerator for FAEST, an MPC-in-the-head post-quantum signature in NIST's Round 3 additional-signature process. It analyses FAEST's compute-heavy operations, builds them into hardware blocks, and adds an L1-EM-fast variant. The authors report at least 98% lower equivalent area-delay product than the recent complete SDitH design at the same security level.
eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026π‘οΈ Security
Eο¬cient Fixed-Point Implementation of MitakaPresents a fixed-point C implementation of the Mitaka signing algorithm, a simpler, parallelizable Falcon (FN-DSA) variant. It replaces MitakaZ's wide integral Gram root decomposition with a fixed-point square Cholesky decomposition, which cuts the cost of integer Gaussian sampling, and proves bounds on intermediate values and representation errors without empirical assumptions. Signing averages 361 kcycles (Mitaka-512) and 707 kcycles (Mitaka-1024) on AVX2, and 4.0 and 7.8 Mcycles on an STM32F411 Cortex-M4F. This makes floating-point-free lattice signatures practical on constrained devices.
eprint.iacr.orgpaperPublished and added 17 Oct 2026π‘οΈ Security
DPA-style Attacks on VOLE-in-the-Head Signature SchemesPresents the first DPA-style power side-channel attack framework against VOLE-in-the-Head signature schemes, targeting the secret witness whose recovery enables forging signatures on arbitrary messages. It analyzes leakage from sensitive intermediate values in VOLE correlations and proposes six attack classes (two vertical, four horizontal) on FAEST and SDitH, both in NIST's third round of additional signatures. Attacks are validated with simulated leakage under varying noise and real measurements on three ARM Cortex-M4 devices.
eprint.iacr.orgpaperPublished and added 17 Oct 2026π‘οΈ Security
Claude reveals ECDSA curve originsAnthropic's Frontier Red Team reports that Claude recovered how the NIST P-192/224/256/384/521 and ANSI X9.62 curve seeds were generated. They are outputs of the C library's lrand48 LCG seeded with 1997β98 Unix timestamps, not hashes of a passphrase. The method scanned for weak-PRNG signatures, then used LLL lattice reduction to recover the truncated LCG state and stepped it back to srand48 initialization. Claude also traced some base points to the FreeLIP/NTL random generator. Reproducible Python is included. The authors say this is not an attack and makes deliberate backdoors less plausible. The B-163 seed and the base points of P-224/256/384/521 and the binary curves remain unexplained.
anthropic.comwriteupAdded 17 Oct 2026, published 16 Oct 2026π‘οΈ Security
Claude reveals ECDSA curve originsAnthropic's Frontier Red Team reports that Claude, given no hint, worked out how the NIST P-192/224/256/384/521 and ANSI X9.62 curve seeds were generated. They came from the C library's lrand48 LCG seeded with Unix timestamps from 1997β98, not from a hash of a phrase. Claude found this by scanning for weak-PRNG signatures and recovering the PRNG state with LLL lattice reduction. It also traced several prime-curve base points to the FreeLIP random generator. The post includes Python code that reproduces the seeds and base points. It says this is not an attack and makes backdoor claims less plausible. B-163 and the other base points remain unexplained.
anthropic.comwriteupAdded 17 Oct 2026, published 16 Oct 2026π§ AI
Proving HumanityGalaxy research report arguing that CAPTCHAs and behavioral bot detection (reCAPTCHAv3, Cloudflare Turnstile) are failing as AI agents reproduce human conduct, for example ChatGPT Agent clicking through Turnstile's checkbox. It shows that Web Bot Auth signatures and Google's AP2 mandates identify the platform or account key but not a distinct person. It proposes reframing "proving humanity" as ensuring every agent traces to one person counted once, covering Sybil, one-person-one-share, accountability and public-count harms. It lays out requirements for a proof-of-personhood credential: strong, private, portable, delegable and accessible. It deliberately does not evaluate specific projects.
galaxy.comarticleAdded 16 Oct 2026π‘οΈ Security
Proving HumanityGalaxy Research essay arguing that as AI agents become the main way people use the web, the key question shifts from "is this a machine?" to "is a distinct real person behind it, counted once?". It traces CAPTCHA history (distorted text, image puzzles, reCAPTCHAv3 and Turnstile behavioral scoring) and notes ChatGPT Agent passing Cloudflare's checkbox. It reviews Web Bot Auth signatures and Google's AP2 payment mandates, showing both stop at the platform or key and never establish a person. It then covers harms (one-person-one-share abuse, no one to answer for an agent, distorted public counts, collapsing confidence, scaled deception, broken ad economics) and lists the properties a privacy-preserving proof-of-personhood credential needs: strong, private, portable, delegable, accessible.
galaxy.comarticleAdded 16 Oct 2026π§ AI
TileDRAM: Compiler-Controlled Tile-to-DRAM Layouts for 3D DRAM GPGPUsTileDRAM is a compiler-runtime toolchain that adds tile-to-DRAM layouts as a compiler-visible abstraction for compute-unit-local 3D DRAM GPUs. It extends GPU Linear Layout to DRAM placement and picks layouts per tile access signature using row-buffer behavior. On 108 MoE FFN cases in Accel-Sim/Ramulator2, row-conflict rate fell from 75.7% to 15.2%, with a 1.77x geomean speedup. Overhead on an RTX 3090 is 0.17%.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026π§ AI
Fast post-quantum signature aggregation with lattice SNARKsa16z crypto announces Aerie, a lattice-SNARK system that aggregates Falcon-512/1024 signatures into one ~66 KiB proof. On an M4 Max laptop it handles 32,768 signatures in 0.65 s (~50k/s), verifies in 54 ms, and costs ~42 bytes per signature. It benchmarks against Orthus and Ethereum's leanVM hash-based XMSS aggregation, and argues that recursion-free lattice aggregation is simpler than hash-only designs. It also covers Falcon's hardware-wallet and side-channel constraints and why private payments need lattice encryption such as ML-KEM.
a16zcrypto.comarticlePublished and added 16 Oct 2026π‘οΈ Security
Fast post-quantum signature aggregation with lattice SNARKsAerie is an a16z crypto and LayerZero Labs system that aggregates Falcon-512 and Falcon-1024 lattice signatures into one lattice SNARK. On an Apple M4 Max it aggregates 32,768 Falcon-512 signatures in 0.65 seconds, with 54 ms verification and about 42 bytes per signature. The post compares it with Ethereum's hash-based leanVM and XMSS plan and Orthus, and covers Falcon signing limits on hardware wallets.
a16zfrontier.comarticleAdded 22 Oct 2026, published 16 Oct 2026π‘οΈ Security
Analysis of the Multi-Key Optimization for SPECKThe paper revisits the multi-key optimization for SPECK, a code-based signature scheme that uses the Permutation Code Equivalence Problem (PEP) as a trapdoor for the Permuted Kernel Problem (PKP). Each SPECK round has soundness error 1/2, which inflates signatures, and the SPECK authors had warned that naively using multiple public keys creates security concerns. The authors analyse those concerns, give conditions and parameter constraints under which multiple keys can be integrated securely, and show that conservative parameters perform poorly but leave room for improvement. They also build a ring signature scheme on the same construction.
eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026π‘οΈ Security
Power Analysis on SQIsign via Ideal Reconstruction from Quaternion LeakagesePrint paper identifying five side-channel vulnerabilities in the signing procedure of Round-3 SQIsign, the isogeny-based signature scheme in NIST's additional post-quantum signature process. It gives polynomial-time algebraic algorithms that recover the secret key from leaked quaternion/ideal intermediate values, including cases where only partial bits leak. It also demonstrates power analysis on the SQIsign source code to extract the needed leakage, which earlier work on Round-1 or toy parameters did not do.
eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026π‘οΈ Security
MUB: An Identity-Masked Benchmark for Music Understanding in Multimodal Language ModelsMUB (Music Understanding Benchmark) is a set of 500 identity-masked recordings with existing annotations for tempo, key, time signature and structural intervals. It covers all 24 keys, tempos of 47 to 180 BPM and 4,676 intervals, and strips titles, artists and platform IDs from inputs. Baselines reach 53.6% tempo accuracy (DSP) and 98.4% time-signature accuracy (constant 4/4). No multimodal LLM has been tested yet, and rights clearance is unresolved.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026π§ AI
SwiftAuth: Conditional Privacy-Preserving UAV Authentication with Multi-Source Credential Aggregation and Non-Interactive AuthorizationThe paper proposes a traceable and aggregatable tagged witness signature (TA-TWS) and builds SwiftAuth on it, a conditional privacy-preserving anonymous authentication framework for UAVs and other dynamic terminals. Issuers can create authorization components while users are offline. Several credentials compress into one constant-size proof, verifiers can batch-verify across users, and a regulatory trapdoor lets authorities trace misbehaving users. TA-TWS is proven unforgeable and witness-hiding, and benchmarks with the MIRACL Core library on constrained devices and Aliyun servers show it is practical.
eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026π‘οΈ Security
Shorter Hash-Based Signatures via Guarded Sharing in a DAG ModelProposes "guarded sharing", a technique that moves few-time signatures in SPHINCS-style stateless hash-based schemes from a tree model to a DAG model. Combined with bucket thinning, hash chains and rejection sampling, it yields BGS-CC, which improves on the prior best few-time scheme BPORS-C+BFP. For 128-bit security and a use quota of Q=2^24 it gives 2,228-byte signatures, the first SPHINCS-based stateless signature shorter than ML-DSA-44's 2,420 bytes. This matters for PQ migration because signature size is the main drawback of SLH-DSA.
eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026π‘οΈ Security
MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning EngineeringPresents MLExpert, a 35B Mixture-of-Experts agentic model trained for autonomous long-horizon machine learning engineering. Training uses a Kaggle-MLE Factory to build executable tasks and an interaction harness, hierarchical agentic SFT with outcome-guided supervision, and Windowed Interaction RL (WIRL). WIRL treats the multi-turn decisions between successive experiment results as one execution window with a shared outcome reward, and uses asynchronous collection and policy correction. On MLE-Bench Lite the average medal rate rises from 37.9% to 72.7%, comparable to larger frontier models such as Kimi-K3 and GLM-5.3. It also improves on NatureBench Lite, agent scaffold optimization and algorithm optimization.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026π§ AI
FAEST on GPUs: Addressing Field Multiplication as a BottleneckePrint paper presenting an NVIDIA GPU implementation of FAEST (a post-quantum signature scheme built on VOLE-in-the-Head and QuickSilver), covering key generation and OWFProve/OWFVerify for standard and EM constructions in s and f variants. Profiling shows field multiplication takes about 82% of FAEST-128f signing time once AES is hardware-accelerated. Using PTX clmad carry-less multiplication plus Karatsuba, it reaches up to 26.6x kernel throughput and about 2.9-3.1x full 256-bit OWFProve throughput over the software-multiplication build on an RTX A5000.
eprint.iacr.orgpaperPublished and added 15 Oct 2026π‘οΈ Security
Crypto's Quantum Defense Is Being Built in the OpenBankless article on Eigen Labs' Yukon, a platform for open-research challenges where developers and AI agents try to improve a technical problem. Each submission is automatically benchmarked, and accepted improvements become the baseline for the next attempt. Results include an ~88% cut in the ECDSA.fail quantum resource-cost benchmark, a ~10x speedup in Lighter's proving software, ~2x faster Qwen and 2.6x faster Laguna on Apple hardware via MLX.fast, and cheaper Quantum Safe Bitcoin proofs ($320 down to $59). Newer challenges (HashSmash, sig.golf, better.codes) target hash-function weaknesses, hash-based signatures and post-quantum proofs. All the improvements are theoretical or benchmark-level unless stated as deployed.
bankless.comarticlePublished and added 14 Oct 2026π§ AI
Crypto's Quantum Defense Is Being Built in the OpenBankless article on Eigen Labs' Yukon platform, which runs open challenges where researchers and AI agents attack and improve cryptography. It covers ECDSA.fail (quantum circuit cost for attacking Bitcoin/Ethereum ECDSA, cut about 88% from baseline), HashSmash (SHA-256 weakness hunting, so far only on reduced versions), sig.golf (hash-based signatures), StarkWare's Quantum Safe Bitcoin (cost down from about $320 to $59) and better.codes (provable security raised from 64 to about 68 bits). The argument is that public, measurable attack-cost data helps defenders prepare better than withholding circuits does. All gains are theoretical and no quantum computer has run an attack at this scale.
bankless.comarticlePublished and added 14 Oct 2026π‘οΈ Security
ERC-8443: Quantum Bridge ShieldDraft ERC from Quantova Inc proposing a "Quantum Bridge Shield" for Ethereum bridges. A committee signs the Merkle root of each message batch with RFC 8554 LMS hash-based signatures instead of ECDSA/BLS keys that Shor's algorithm can break. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain, chain, guard and epoch, and applies a 60-second delay. The post gives gas costs (LMS W4 height-10 verification about 205k gas, a LayerZero packet 128,683 gas, worst-case rotation 12.44M gas under the EIP-7825 cap) and cites a NioLabs assessment with no critical or high findings. It is relevant as a worked post-quantum migration design for bridge key custody, including hybrid ECDSA+LMS mode and stateful-signature pitfalls such as leaf reuse and rollback.
ethereum-magicians.orgarticlePublished and added 14 Oct 2026π‘οΈ Security
ERC: Quantum Bridge ShieldDraft ERC from Quantova Inc that has Ethereum bridges accept cross-chain message batches only when a committee signs the Merkle root with RFC 8554 LMS hash-based signatures. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain tag, chain ID, guard address and epoch, and enforces a 60-second delay. It reports gas benchmarks (about 205k per LMS W4 height-10 verify, 12.44M worst-case rotation under EIP-7825), a hybrid LMS+ECDSA migration mode, and a NioLabs assessment with no critical or high findings. It argues that Shor's algorithm makes secp256k1 and BLS committee keys a quantum theft target.
ethereum-magicians.orgpaperPublished and added 14 Oct 2026π‘οΈ Security
Package managers have an integrity problemTrail of Bits tested 25 popular package managers with a Docker and mitmproxy harness that simulates a compromised package repository injecting malware into legitimate packages. Fewer than half enforce lockfile hashes by default, only two verified every download, and only Go verifies signatures by default. The post covers lockfile hash pitfalls (Pub, pnpm, Conan, CocoaPods, Composer), repository, developer and Sigstore signing, and Go's checksum database. It also proposes lockfiles that commit to a signing identity plus a transparency log.
blog.trailofbits.comwriteupPublished and added 14 Oct 2026π‘οΈ Security
edaBits in the Exponent (edaBitE) and Issuer-Hiding Blind Signatures from ML-DSA and VOLE-in-the-HeadPresents the first blind signature in which the issuer runs unmodified NIST-standardized ML-DSA, so it works with certified secure elements. Issuance is an ML-DSA signature on a commitment. The blind signature is a VOLE-in-the-head zero-knowledge proof of knowledge of that signature, about 1 MB, under 1 s to produce and 0.5 s to verify. Security reduces to ML-DSA EUF-CMA and the proof system. Issuer-hiding and selective disclosure add a few tens of KB. The paper also introduces edaBitE, a batch consistency check between binary and prime-field commitments that replaces the costly edaBits checks.
eprint.iacr.orgpaperPublished and added 14 Oct 2026π‘οΈ Security
Nowhere Man: Device Binding for Post-Quantum Anonymous CredentialsPresents a modular device-binding protocol for post-quantum anonymous credentials. The phone Secure Element signs a verifier challenge with an unmodified FIPS 204 ML-DSA interface, and the user proves knowledge of that signature in zero knowledge at each presentation. Using ML-DSA's structure avoids the cost of generic NIZK systems such as Longfellow. The most efficient variants assume weak-MLWR for unlinkability, and that assumption can be dropped at some efficiency cost. The protocol works with different anonymous credential schemes, and a proof-of-concept implementation is included. This matters for planned EU age-verification and Google Wallet/mDL rollouts, which need protection against credential sharing.
eprint.iacr.orgpaperPublished and added 14 Oct 2026π‘οΈ Security
Coinbase, which holds 5% of all bitcoin, wants the quantum fix started nowCoinDesk summarizes Coinbase's recommendations for making Bitcoin quantum-resistant before a cryptographically relevant quantum computer (CRQC) can derive private keys from public keys. The proposals are: a transaction format that can carry new signature types (P2MR/BIP-360, P2TRv2), staged hybrid "1-of-2" spends with ECDSA/Schnorr or a post-quantum key, and stateless options alongside stateful schemes to avoid key-reuse forgery. They also ask that evaluation favor constant-time, RNG-failure-safe implementations, require MPC compatibility, and handle dormant or late-migrating coins as a separate debate. It is a useful overview of the defensive migration design space, but it is secondary reporting and not the primary Coinbase paper.
coindesk.comarticlePublished and added 14 Oct 2026π‘οΈ Security- Coinbase lays out flexible designs as key priority for Bitcoinβs post-quantum migration
Coinbase's October 2026 position on Bitcoin's post-quantum migration, as reported by The Block. Coinbase, which holds about 5% of bitcoin supply, favors output designs that separate the container from the signature scheme (P2MR/BIP-360, P2TRv2), staged hybrid 1-of-2 spending paths, a stateless option beside stateful signatures, and MPC-compatible schemes for custody. It also wants the abandoned-coins debate run in parallel.
theblock.coarticleAdded 31 Oct 2026, published 14 Oct 2026π‘οΈ Security
Coinbase advances Bitcoinβs post-quantum readiness while holding about 5% of BTCSummarizes Coinbase's blog post on preparing Bitcoin and custody infrastructure for post-quantum threats. It covers public-key exposure (an estimated 6.7β7M BTC behind already-exposed keys), BIP 360 (P2MR) and P2TRv2 outputs, 1-of-2 hybrid classical/post-quantum spending paths, and the state-reuse forgery risk of stateful signatures. It also covers candidate schemes (ML-DSA, SLH-DSA, FN-DSA, SHRINCS), MPC/HSM compatibility and side-channel tests, and separate handling of dormant, lost and exposed legacy funds.
en.cryptonomist.charticlePublished and added 13 Oct 2026π‘οΈ Security
SDR (Signals Intelligence) for Hackers: Scanning Wireless Devices Using FieldWatchOverview of FieldWatch, a free open-source Android app that passively listens to Wi-Fi and Bluetooth with the phone's own radios and matches them against an editable catalog of about 250 device signatures (trackers, drones, cameras, body cams, mesh radios). It supports alerts, recorded sessions, path maps, Remote ID drone and pilot location, GNSS interference/spoofing detection and export to TAK/ATAK. The article also covers its limits (no direction finding, no Bluetooth Classic, cellular or full Wi-Fi traffic, pattern matches only) and sideloading from the official GitHub repo on Android 10+.
hackers-arise.comarticlePublished and added 13 Oct 2026π‘οΈ Security
Leakage-Resilient Incompressible Cryptography: Constructions and BarriersIntroduces leakage-resilient incompressible cryptography, a security model combining leakage resilience (partial key leakage plus full ciphertext) with incompressibility (full key but only part of the ciphertext or signature). It gives a transformation from incompressible symmetric-key encryption (SKE) to leakage-resilient incompressible SKE, a leakage-resilient incompressible PKE built from a new leakage-resilient non-committing KEM, and an incompressible SKE with ciphertext and compression rate 1/2 using invertible extractors. It also gives a leakage-resilient incompressible signature scheme in the random oracle model under DCR or LWE plus Decisional Linear. Black-box impossibility results show barriers to improving these parameters.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 13 Oct 2026π‘οΈ Security
Ledger hardware wallet breach exposes LTE implant stealing recovery phrasesLedger's Donjon team confirmed on October 10, 2026 a physical implant inside a hardware wallet sold by Malaysia-based reseller CryptoBilis. The implant reads the device display, decodes the 24-word recovery phrase with a microcontroller, and exfiltrates it over LTE via a provisioned eSIM, leaving the Secure Element, OS, transactions and signatures untouched. Onchain investigator Specter traced over $86 million in suspected thefts across Ethereum, Tron and Bitcoin; Ledger advises CryptoBilis buyers to migrate funds to a new device with a new recovery phrase.
en.cryptonomist.charticlePublished and added 13 Oct 2026π‘οΈ Security
Ledger Finds LTE Implant That Stole Recovery Phrases in Suspected $86M DrainLedger's Donjon security team confirmed an unauthorized hardware implant inside Ledger signers sold by Southeast Asian reseller CryptoBilis. The implant sits in the enclosure, reads the 24-word recovery phrase from the screen during setup, decodes it with a microcontroller, and exfiltrates it over LTE via a provisioned eSIM, without touching the Secure Element, OS, or signatures. Onchain investigator Specter traced over $86M in suspected thefts across Ethereum, Tron and Bitcoin; Ledger is reviewing reports of tampered devices elsewhere and advises affected buyers to move funds to a new device with a new seed.
decrypt.coarticlePublished and added 13 Oct 2026π‘οΈ Security
CUTS: Chained Uniform-sum Tree SignaturesThe paper analyses stateful hash-based signatures whose key is a tree of hash chains, and asks what a second signature from the same one-time key reveals after state loss or rollback. It proves that the values derivable from several signatures are exactly the union of those from each signature alone. It also bounds forgery after b signatures in the classical random-oracle model by a combinatorial coverage exponent Ξ»_b, including when the signer grinds a counter. It then introduces CUTS, a scheme on one binary tree whose chain positions sum to a fixed value S and whose signature size and verification cost do not depend on tree height. One parameter set has 1,424-byte signatures and Ξ»_2 β₯ 128.6. A counter variant, CUTS+C, gives a proven grinding gain.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 12 Oct 2026π‘οΈ Security
How Zcash Plans to Hide Your Keys From AI and Quantum AttacksDecrypt reports that Zakura, which builds a Zcash full node, expects post-quantum signature opcodes in Zcash in January, to enable hash-based signatures for transparent pools. The plan rotates to a fresh transparent address after every transaction so public keys stay hidden, and adds a WOTS hash-based backup signature. Private information retrieval, shipping this week in the Vizor wallet, stops servers from linking the rotated addresses. It follows Justin Drake's "bunker mode" warning that AI-driven math could break ECDSA. The plan covers only transparent payments, and no activation date has been confirmed.
decrypt.coarticlePublished and added 11 Oct 2026π‘οΈ Security
Nobody Will Read the Lean: A Case for High-Level Cryptographic LanguagesPosition paper arguing that as AI makes machine-checked proofs cheap, the scarce resource is a human who can read what was proved. It cites a Lean library's Schnorr signature security theorem that passed the checker but held for every adversary and so promised nothing. It shows that on a one-page Verifpal model, two of five verdicts flip under other standard definitions of properties such as forward secrecy. It proposes short, owner-written high-level cryptographic languages, with every claim backed by a checked theorem and a small, versioned, publicly agreed set of built-in security definitions.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 10 Oct 2026π‘οΈ Security
Efficient Vectorized Implementation of MQOMePrint paper presenting a vectorized implementation of the MQOM v2.1 post-quantum signature scheme (a NIST additional-signature candidate). It uses a transpose-enabled paired-matrix trick to cut wasted SIMD work and memory traffic. It benchmarks key generation, signing, verification and memory on Arm NEON, x86 AVX2 and AVX-512, with peak dynamic memory down by up to 39.43%. Supplementary experiments check how the matrix-layout optimization carries over to the Round-3 MQOM v3 code. Useful for practitioners assessing the deployment cost of post-quantum signatures.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 10 Oct 2026π‘οΈ Security
Censorship Resistance in Credential Systems and Application to the EUDI WalletePrint paper that defines a security model for censorship resistance in anonymous credential systems, where a malicious issuer uses information gathered at issuance to selectively deny credentials. It gives a round-optimal construction built on blind signatures with selective disclosure at presentation. It also presents CRACS, an instantiation for the European Digital Identity Wallet (EUDIW). CRACS keeps selective disclosure and adds unlinkability between issuance and presentation. It confines the advanced cryptography to issuance, so secure elements, credential formats, signature schemes and verifiers stay unchanged and deployment can be incremental.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 10 Oct 2026π‘οΈ Security
Zcash developers set January target for quantum-resistant payments after βbunker modeβ scareZcash developer Roman Akhtariev, writing for the Zakura client team, announced a January target for adding post-quantum signature opcodes supporting hash-based signatures to Zcash's transparent (public) payment pool, which holds about 70% of issued ZEC. The move responds to Ethereum researcher Justin Drake's "bunker mode" warning that AI could soon break the elliptic-curve math behind Bitcoin and Ethereum wallet keys. Zakura has also built a private-information-retrieval balance-lookup tool, now experimentally available in the Vizor wallet, that lets a wallet check address balances without revealing to the server which addresses are linked, separate from the shielded-pool quantum-recovery work still needed to defend against store-now-decrypt-later attacks.
coindesk.comarticlePublished and added 9 Oct 2026π‘οΈ Security
Understanding Verification Vulnerabilities in Cross-chain Bridges: An Empirical StudyFirst systematic empirical study of Cross-chain Verification Vulnerabilities (CVVs) in bridge smart contracts, such as flawed validation of state proofs, message sender identities and signatures. From 588 audit reports across 36 bridge projects it derives 11 CVV patterns in 5 categories and builds a dataset of 830 instances across 786 contract files, mapped to reports, source versions and pattern labels. Existing tools cover few CVV patterns, and only two of four tested LLMs beat a 29.3% Macro-F1 constant baseline (best 51.2%), which motivates detectors built for cross-chain verification semantics.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026π‘οΈ Security- ETDI: Comprehensive MCP Security Framework
ETDI (Enhanced Tool Definition Interface) is a proposed security extension to the Model Context Protocol that adds cryptographically signed and versioned tool definitions, OAuth 2.0 scope-based permissions, Cedar-policy-driven context-aware access control (via engines like Amazon Verified Permissions/OPA), and call-stack verification to stop tool chaining and privilege escalation. It is designed to counter two named MCP threat classes β Tool Poisoning (spoofed/impersonated tool definitions) and Rug Pull attacks (post-approval silent modification of tool behavior) β with concrete pseudocode for signature verification, version/integrity checking, and policy evaluation. The page functions as an implementation guide for MCP client/server builders wanting to harden tool approval and invocation flows.
vulnerablemcp.infowriteupAdded 8 Oct 2026π§ AI
Vitalik Buterin backs crypto βbunker modeβ amid rapid AI math advancesEthereum researcher Justin Drake, backed by Vitalik Buterin, warns that rapid AI progress in mathematics (citing OpenAI's recent batch of math findings and a 10,000-agent solve of Navier-Stokes) could break ECDSA-based wallet signatures before quantum computers ever do, and that lattice-based post-quantum schemes may not be safe either. They recommend a controlled 'bunker mode' migration of crypto holdings to fresh addresses whose public keys have never been exposed on-chain, while cautioning that botched migrations carry their own risk.
cointelegraph.comarticlePublished and added 8 Oct 2026π‘οΈ Security
Vitalik Flags AI Risk to Crypto, Warns Against Rushed Wallet MovesVitalik Buterin responds to Ethereum Foundation researcher Justin Drake's bunker mode proposal, agreeing AI-accelerated cryptanalysis could break ECDSA, the signature scheme behind most crypto wallets, in months not years, and that lattice-based schemes like ML-DSA billed as quantum-safe could also take serious hits within two years. Buterin gives practical key-hygiene advice such as keeping funds in addresses that never exposed a public key and rotating multisig signer keys after every operation with offchain signature collection, while warning that botched migrations cost more than hacks.
bankless.comarticlePublished and added 8 Oct 2026π‘οΈ Security- Dark Web Informer (@DarkWebInformer) on X
Post announcing a PoC and security patch for two critical GoBalance (Tor onion service load balancer) takeover flaws, reportedly used in attacks on the Dread and Omega darknet markets. The first flaw reuses or mishandles the nonce in blinded signing, so a single public descriptor lets an attacker recover the onion service's master identity key. The second accepts forged instance descriptors without signature and identity-binding checks, which allows full frontend traffic hijacking. The linked package includes a PoC for both paths, a patched source tree, regression tests and a unified patch. It affects master at commit bb1b0f3.
x.comthreadAdded 9 Oct 2026, published 8 Oct 2026π‘οΈ Security
Morning Minute: Ethereum Researcher Says AI May Break Crypto Encryption Before QuantumA daily crypto-market newsletter segment reporting Ethereum Foundation researcher Justin Drake's warning that AI, not quantum computing, may be the first to break ECDSA β the elliptic-curve signature scheme securing Bitcoin and Ethereum β potentially within months by recovering private keys from exposed public keys using large GPU clusters. Drake calls for industry-wide "bunker mode": migrating self-custodied funds to fresh addresses whose public keys remain hashed/hidden, and names exchanges (Binance, Bitbank, Robinhood, Bitfinex, Tether) he wants to harden cold storage. The article also notes a concurrent Europol report flagging crypto wallets with already-revealed public keys as the main weak point for future quantum/AI attacks, since those cannot be retroactively protected.
decrypt.coarticlePublished and added 8 Oct 2026π‘οΈ Security
Bitcoin and ether holders urged to enter βbunker modeβ against possible AI attacksEthereum researcher Justin Drake and co-founder Vitalik Buterin warn that rapid AI progress in mathematics could break the elliptic-curve signatures securing Bitcoin and Ethereum wallets within months - far sooner than quantum computers are expected to - urging large holders to enter bunker mode by migrating funds to addresses whose public keys have never been exposed onchain. Buterin also flags that lattice-based post-quantum schemes, the basis of NIST's signature standard, could face similar AI-driven erosion, pushing Ethereum's long-term roadmap toward hash-based signatures instead. The piece grounds the warning in already-documented AI-assisted exploit discovery: a 5-year-old Coldcard hardware-wallet firmware bug drained over 1,367 BTC, BTCPay Server Lightning-node thefts, Core Lightning bugs surfaced via AI-generated audits, and Anthropic's demonstration of AI models writing working exploits against simulated DeFi contracts.
coindesk.comarticlePublished and added 8 Oct 2026π‘οΈ Security
AI risk to crypto wallets: Ethereum researcher warns keys could be cracked in monthsEthereum Foundation researcher Justin Drake warned on October 7, 2026 that advances in AI and mathematics could break ECDSA β the signature scheme securing blockchain transactions β within months, potentially letting an attacker recover a private key in about a week using a large GPU cluster. He urged gradual "bunker mode" preparation rather than panic: rotating funds into fresh addresses whose public keys have never been exposed on-chain, strengthening cold storage, and accelerating Ethereum's move toward hash-based signature schemes such as SPHINCS for critical signers like oracles and L2 security councils.
en.cryptonomist.charticlePublished and added 8 Oct 2026π‘οΈ Security- ETDI: Comprehensive MCP Security Framework
ETDI (Enhanced Tool Definition Interface) is a proposed security extension to the Model Context Protocol that defends against Tool Poisoning (spoofed/impersonated tool definitions) and Rug Pull attacks (silent post-approval modification of tool behavior) using cryptographic signing of tool definitions, immutable versioning with mandatory re-approval, OAuth 2.0 scopes, and Cedar/Amazon Verified Permissions-based policy-aware access control. The page includes detailed attack scenarios, a call-stack verification scheme to prevent tool-chaining privilege escalation, and implementation code for key management, signature verification, and policy evaluation.
vulnerablemcp.infowriteupAdded 8 Oct 2026π‘οΈ Security
Ethereum Researcher Says AI May Break Encryption Before Quantum DoesEthereum Foundation researcher Justin Drake warns that AI-driven mathematical advances could break ECDSA β the signature scheme securing Bitcoin and Ethereum β before quantum computers do, potentially recovering a private key from an exposed public key in about a week using a large GPU cluster. He calls for "bunker mode": a controlled mass migration of funds to fresh addresses whose public keys have never been exposed, urges major custodians (Binance, Bitbank, Robinhood, Bitfinex, Tether) to harden cold storage, and pushes Ethereum to accelerate its move to hash-based (post-quantum) cryptography.
decrypt.coarticlePublished and added 7 Oct 2026π‘οΈ Security
Revisiting Lattice-based Blind Signatures AgainThis IACR ePrint paper by Yi-Fu Lai and Yu Yu breaks the blindness property of a lattice-based blind signature scheme presented at Crypto 2020, which uses a linear hash function framework instantiated over lattices. The authors first identify an overlooked bug in the scheme's original blindness security proof, then construct a concrete attack under an honest-key, honest-but-curious signer model by exploiting correlations between leaves of the scheme's tree structure, and discuss how the construction can be repaired.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026π‘οΈ Security
Quantum computers threaten exposed private keys rather than blockchains, Europol warnsEuropol's European Cybercrime Center published a "Quantum Computing and Cryptocurrencies" report arguing that Bitcoin's hash-based blockchain history is far more quantum-resistant than the ECDSA public-key cryptography used to control wallets. It estimates roughly 6.9 million bitcoin sit in addresses with exposed public keys (including early pay-to-public-key and long-dormant "Satoshi era" outputs) that a sufficiently powerful quantum computer could eventually use to derive private keys, and cites a 2024 study putting full UTXO migration to quantum-resistant signatures at 76β300 days of cumulative block space, with new post-quantum signatures 10β120x larger than ECDSA.
coindesk.comarticleAdded 8 Oct 2026, published 7 Oct 2026π‘οΈ Security
Hide Now, Trace Later: Retrospective Attribution in Issuer-Hiding CredentialsKrenn, Lesaignoux, Mir and Spini (AIT Austrian Institute of Technology) propose an "issuer inspection" mechanism for issuer-hiding attribute-based credentials (ABCs): an inspection authority can release time-bound keys that let verifiers locally flag presentations tied to a specific compromised issuer without unmasking other issuers or periods. They formalize the syntax/security model, give a generic construction, and instantiate it concretely using Groth's randomizable structure-preserving signatures, Schnorr-style proofs, and an adapted Gentry anonymous identity-based encryption scheme, showing the overhead stays practical. This addresses the accountability gap introduced when issuer-hiding ABCs conceal which authority issued a credential during verification.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026π‘οΈ Security
A Universal Forgery Attack on the Origami Signature Scheme from the Public Key AloneThis IACR ePrint paper breaks Origami, a multivariate post-quantum signature scheme submitted to the NGCC round-1 public-key call, showing its bilinear construction is effectively a Rainbow-type scheme whose central map leaks through the public verification key in a predictable coordinate order. The authors derive an equivalent secret key from the public key alone, enabling universal forgery at roughly the cost of one signature verification (~0.01s at Origami-128), and demonstrate the attack against the unmodified reference implementation across all four parameter sets and the official test vectors. They also refute Origami's security proof by breaking its inversion assumption in a bilinear independent-coefficient model, and note a separate structural flaw where honest signatures lie in a proper subspace rather than the full space the specification assumes.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026π‘οΈ Security
Someone Scraped 5.6 Billion TikTok Videos and Put the Data on Hugging Face for FreeDecrypt reports that a developer going by "hashfunction," operating under the datasocial account, published a 460GB Parquet dataset of metadata for ~5.6 billion public TikTok videos (captions, hashtags, sound IDs, engagement counts, AI-generated flags) on Hugging Face under CC BY-NC 4.0. The data was obtained by hitting TikTok's private mobile API using generated Android device identities, reverse-engineered request signatures, and a spoofed TLS handshake, bypassing the ToS clause that bars automated scraping; datasocial.ai sells the scraper's source code for $1,699 and offers commercial access, creator profiles, and daily updates. The piece situates this against TikTok's gated official Research Tools and the ongoing Reddit v. Perplexity/SerpApi scraping lawsuit.
decrypt.coarticlePublished and added 6 Oct 2026π‘οΈ Security
The Lattice Isomorphism Problem with HintsThis IACR ePrint paper (published TCHES 2027) presents a new cryptanalysis technique for the Lattice Isomorphism Problem that embeds LIP into a shortest-vector-problem instance on a different lattice than the one used in Hawk's specification, allowing attackers to integrate "hints" β partial information on the secret key obtained via side-channel attacks or other leakage. Using the LeakyLWEEstimator tool, the authors show Hawk signatures themselves leak exploitable information about the secret key, eroding Hawk-1024's security by roughly 11 bits, and apply the framework to resolve an open side-channel problem from TCHES 2024 plus discuss further fault-injection attack paths. Hawk is a lattice-based signature scheme submitted to NIST's second post-quantum signature call, making this a concrete key-recovery cryptanalysis relevant to PQC migration planning.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 6 Oct 2026π‘οΈ Security
Formalization of the Invariant Duality TheoremAn Ethereum Magicians forum post formalizes an "Invariant Duality Theorem": in a permissionless network, a protocol cannot simultaneously achieve Perfect Indistinguishability (traffic statistically indistinguishable from white noise under DPI) and Resource Exhaustion Resistance (O(1) early rejection of junk packets). The proof sketch argues that indistinguishable traffic forces receivers to run expensive deobfuscation on all packets including attacker-generated noise (enabling DoS), while any cheap early-filter function, by Kerckhoffs's principle, becomes a public signature a censor can hardware-implement to block the protocol. This is a theoretical tradeoff relevant to designing or attacking covert/anti-censorship transport protocols.
ethereum-magicians.orgthreadPublished and added 6 Oct 2026π‘οΈ Security
Shorter Few-Time Signatures from Hash Chains and Blockwise Forced PruningThis IACR ePrint paper introduces BPORS-C+BFP, a new few-time signature construction that replaces FORS in SPHINCS+/SLH-DSA, combining short hash chains with a blockwise forced-pruning budget to shrink the bottom signature component. The authors derive a generating-function coverage bound and an exact counting method to safely tighten pruning per block, achieving 8.3%-18.1% smaller full SLH-DSA signatures across six standard parameter sets (versus 3.7%-13.4% for the prior BPORS+FP scheme), and up to 32.5%-36.5% reduction in limited-use settings.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 6 Oct 2026π‘οΈ Security
K-LMS: Design, Implementation, and Evaluation of LeightonβMicali Signatures with Korean Cryptographic PrimitivesAn IACR ePrint paper presenting K-LMS, an experimental variant of the NIST-standardized LMS hash-based post-quantum signature scheme in which the underlying hash is swapped for Korean primitives: the LSH-256 hash function (reference and vectorized) and a Tandem-DM double-block-length construction built from the CHAM, LEA, and ARIA block ciphers. The authors implement a non-invasive backend-swapping bridge over the reference LMS code and benchmark keygen/sign/verify latency, key/signature sizes, memory, and parameter sweeps, finding that hash substitution doesn't change key/signature sizes but that two measurement pitfalls (hash dispatch overhead, and software vs. hardware-accelerated SHA-256 baselines) can shift performance comparisons by an order of magnitude or 6x respectively. They report LSH-256 K-LMS signing on par with SHA-256 LMS in software, and 3.3-3.9x faster than a prior K-XMSS implementation because LMS needs fewer hash calls per Winternitz step than XMSS.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 6 Oct 2026π‘οΈ Security
Introduction to Web Application Firewall (WAF) and Ways to Bypass ItA Hackers-Arise tutorial explaining how Web Application Firewalls detect attacks (signature-based, anomaly scoring, behavioral analysis) and how to fingerprint which WAF a target uses via HTTP headers, curl probing, or the WAFW00F tool. It then covers three concrete bypass techniques β double URL encoding, Unicode normalization mismatches, and ASCII smuggling via invisible Unicode tags β that let malicious payloads like XSS slip past WAF filtering before being decoded by the backend app.
hackers-arise.comarticleAdded 7 Oct 2026, published 5 Oct 2026π‘οΈ Security
One-Round Threshold XMSS and SPHINCS+ from Fully Homomorphic EncryptionIACR ePrint paper constructing and implementing the first one-round threshold signing protocol for the hash-based post-quantum signature schemes XMSS and SPHINCS+, producing signatures that verify unmodified against RFC 8391 and FIPS 205. The approach shares the secret key among t-of-n signing parties and evaluates the signing algorithm homomorphically using threshold FHE over discrete CKKS, achieving 3.4ms amortized per hash and 0.69s online threshold XMSS signing.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
GPU-Assisted FAEST v3 Signing: Challenge Grinding and CPUβGPU PipeliningAn IACR ePrint paper presenting a GPU-assisted implementation of FAEST v3 signing, a post-quantum signature scheme, focusing on two problems: preserving the correct minimum accepting counter when parallelizing "challenge grinding" across GPU threads, and building a two-slot CPU-GPU pipeline to overlap CPU work with GPU batches for multi-signature throughput. Across the six non-EM FAEST v3 parameter sets, the authors find the CPU-GPU path beats optimized CPU-only signing for single-sign latency in 4 of 6 cases (up to 1.6x speedup for FAEST-192s) and wins throughput in 9 of 18 parameter/batch-size combinations, with GPU correctness validated to match the reference signature output.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
N2SF-Based Post-Quantum Cryptography Migration Framework for Data in National and Public InstitutionsAn IACR ePrint paper proposes PQC migration decision criteria for data held by national and public institutions, derived from South Korea's N2SF (National Network Security Framework) protection requirements and each data object's cryptographic dependencies/operational state. It distinguishes migration actions (payload retention, key rewrapping, re-encryption, communication migration, signature renewal) from execution decisions (allow/defer/deny), requiring consistent completion checks, recoverable registered copies, and current authority. A reference implementation ran 225 policy trials and 9 interruption trials, showing per-stage/completion rechecking prevented unauthorized completions or reads that occurred when reusing initial decisions, and confirmed clean resumption after interruption; institutional approval and production-scale key management remain unvalidated.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Batched LSH on ARMv8 NEON and Its Application to K-SPHINCS+IACR ePrint paper presenting hand-written AArch64 NEON assembly implementations of LSH (the Korean standard hash used in K-SPHINCS+), comparing several published optimization techniques and introducing a four-message batched approach that reaches 1.53-2.0x the throughput of sequential KISA reference C code. The authors integrate this batched LSH core into the SPHINCS+ reference framework's WOTS+, FORS and Merkle tree computations to build the first optimized K-SPHINCS+, which signs 2.5-3.2x faster than reference implementations while producing byte-identical signatures across hash backends; all code and measurements are public.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Optimized NEON Implementation of MAYO on Apple M1An IACR ePrint paper presenting an optimized ARMv8 NEON assembly implementation of MAYO Round 3 (one of NIST's post-quantum signature candidates) for Apple M1, generated to be byte-identical to upstream intrinsics but 2β2.6x faster for signing and verification across all four parameter sets. The authors also run a constant-time testing campaign with matched null runs and find that while linear-algebra operations are statistically indistinguishable from constant-time nulls, verification (on public data) exhibits a measurable key-fixed timing effect present in both their implementation and the upstream code.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
HyBind: Structural Analysis of PQ/T Hybrid Cryptographic UsageHyBind is an intraprocedural Python static-analysis framework that traces cryptographic component secrets through code to determine whether post-quantum/traditional (PQ/T) hybrid key-derivation and signature-verification logic actually requires both algorithms to succeed, rather than silently accepting a result from only one. It uses registered API contracts and function-return/execution-effect checks to distinguish real AND-logic hybrids from presence-based heuristics that wrongly treat joint and single-algorithm contributions as equivalent. The authors validate it on 50 controlled fixtures and 33 programs (15 using native ML-KEM/X25519 and ML-DSA/Ed25519 APIs), showing relaxed checks can misclassify traditional-only results as hybrid.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Role-Specific Signature Placement in TLS 1.3: Cost Propagation and PQC MigrationAn IACR eprint paper evaluating all 13-cubed ways to assign 13 post-quantum/traditional signature parameter sets across the Root, Intermediate and Leaf roles of a TLS 1.3 certificate chain, holding the algorithm set fixed and varying only placement. Across 286 three-algorithm groups, median max/min ratios reach 2.085x for TLS handshake latency, 4.310x for certificate body size and 4.551x for path-validation cost purely from role order, with Leaf placement mattering far more than Root/Intermediate swaps. It also shows that looking only at Certificate-message size can misrank candidates such as ML-DSA-65 versus SLH-DSA-SHAKE-192s once the Leaf signature in CertificateVerify and full authentication-path cost are included, arguing PQC certificate-chain design must account for role-specific cost under real network/load conditions.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Post-Quantum Command Authentication for Unmanned Systems: A KpqC Feasibility Study under Real-Time and Bandwidth ConstraintsThis paper evaluates whether Korean post-quantum crypto candidates (HAETAE, AIMer, SMAUG-T, NTRU+) and NIST PQC standards (ML-KEM, ML-DSA, SLH-DSA) can replace classical ECDSA/ECDH in the authentication and key-establishment path of ROS2/DDS-Security for UAV/UGV command channels. The authors build a feasibility envelope mapping each algorithm's key/signature size and handshake latency against real command-link constraints (message rate, MTU, latency deadline, bandwidth), then validate it with authentication-handshake measurements over emulated constrained links on a two-node testbed, producing a classicalβNISTβKpqC comparison and per-channel-budget application guidance.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Deploying Native-Rust KpqC: Pluggable Post-Quantum KEMs and Signatures across TLS, Space Links, and the OQS EcosystemThis IACR ePrint paper presents a native-Rust, memory-safe implementation of the Korean KpqC competition's standardized post-quantum schemes β KEMs NTRU+ and SMAUG-T, and signatures HAETAE and AIMer β replacing the reference memory-unsafe C code. The authors expose all seven KEM parameter sets and four signature modes through a single pluggable provider demonstrated across three real deployment front-ends: a rustls TLS 1.3 key-exchange group, an OQS/liboqs-compatible C ABI, and an analytical CCSDS/SDLS satellite constrained-link model, showing SMAUG-T variants are smaller/faster than ML-KEM-768 on constrained space links and a memory-optimized NTRU+ build cuts peak stack by up to 25% at negligible latency cost.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Measuring Parallel Execution of ClassicalβPQC Component Pairs in Hybrid TLS 1.3An IACR ePrint paper benchmarks whether running the classical and post-quantum components of hybrid TLS 1.3 key exchange (ECDHEβML-KEM) and Composite ML-DSA signatures in parallel on separate pthread worker threads reduces handshake latency versus sequential execution. Across three RFC 10024 ECDHEβML-KEM groups with server and mutual authentication, parallelism sped up all six tested conditions on a standard ARM and x86 system (1.04Γβ1.28Γ), with the largest gains in signature stages where component times are balanced, but slowed every condition on a low-power x86 system (0.80Γβ0.92Γ) because thread wake/wait overhead outweighed savings. The authors conclude that component independence alone doesn't guarantee a speedup and that parallelization decisions must be validated per target environment.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security
Six defects in one signature verification tool, found from outside in six roundsA forum writeup on ethresear.ch describing a "predictions-first" testing methodology for verification logic, applied against the author's own repository and against a live third-party MCP server (nsgoods Workbench, which offers offline signature verification over the x402 payment catalogue). Six rounds of testing surfaced concrete defects: a false negative caused by a stripped field list, a tamper-accepted body via a service-selection parameter that let callers choose which fields were excluded from the signed message, schema-rejection and signature-failure returning byte-identical error text, and a logging/privacy gap in the operator's system that was fixed after disclosure. The author ships a companion tool, exactzk-verification-guards, which captures both a passing and an actually-reproduced failing run as regression evidence rather than a fabricated example.
ethresear.chwriteupPublished and added 2 Oct 2026π‘οΈ Security
[AINews] Gemini 4 Argon: GDMβs answer to Astra/Fable, with 1M outputLatent Space's AINews digest for 9/29-9/30/2026 leads with Google DeepMind's Gemini 4 Argon, a frontier model in limited Fairwind Program cyber-defense/government preview claiming SOTA on 13 of 19 benchmarks and an industry-first 1M-token output via Long Decode Continuation, with detailed head-to-head evals against GPT-6 Astra, GPT-6.1 Sol and Claude Opus 5.5 from Artificial Analysis, Vals and Arena. It also covers other releases (Cohere Embed 5, Ideogram 4.5, GLM-5.3-Flash llama.cpp support, Solar Mini 4), research (Meta's Context Language Models, a Nature paper on superhuman Stratego AI), inference/systems news, and a safety section on hidden-reasoning-extraction attacks and GLM-5.3 cyber-capability risk.
latent.spacearticlePublished and added 1 Oct 2026π§ AI
Kettle: Short Post-Quantum Threshold Signatures from the HAWK Signature Schemetest
eprint.iacr.orgpaperAdded 4 Oct 2026, published 1 Oct 2026π‘οΈ Security
[Security Disclosure] MetaMask Staking Precautionary Out of Order ExitsLido Finance's governance forum discloses that MetaMask Staking (formerly Consensys Staking), one of its Ethereum validator node operators, detected an infrastructure compromise and is precautionarily exiting its operated validators from the Lido protocol. The post details the exit/withdrawal/re-entry timeline (~45 days), the non-custodial nature of Lido staking (MetaMask does not hold withdrawal keys), and the protocol's ad hoc reserve fund (6,750+ stETH) as a mitigation mechanism while a full investigation continues.
research.lido.fiadvisoryAdded 3 Oct 2026, published 30 Sep 2026π‘οΈ Security- Introducing SynthID Bio
SynthID Bio is Google DeepMind's watermarking technique extended from digital media into synthetic biology, embedding an imperceptible, verifiable signature into AI-designed protein sequences (via a modified ProteinMPNN alongside AlphaProteo) and 3D structures (via a fine-tuned AlphaFold 3 diffusion network) without compromising biological function. Wet-lab tests on protein binders against VEGF-A, SARS-CoV-2 spike RBD, and PD-L1 matched hit rate and binding affinity of unwatermarked designs, and the approach was also extended experimentally to watermark an Evo 2-designed bacteriophage genome with Stanford's Hie lab and Arc Institute. The work targets biosecurity gaps in DNA synthesis screening and public sequence databases (Protein Data Bank, UniProt, GenBank), with DeepMind open-sourcing code, in vitro data, and model weights alongside a methods paper.
deepmind.googlearticlePublished and added 30 Sep 2026π§ AI - Trail of Bits (@trailofbits) on X
Announcement tweet for Trail of Bits's September "Tribune" newsletter, which fact-checks 1Password's AI-powered patching benchmark, details a signature-forgery bug found in Miden's zkVM and a string-slicing bug in the Lean theorem prover/language, and reports 27 advisory submissions to OpenClaw plus seven new completed security reviews. It links out to the full newsletter on Mailchimp (mailchi.mp/trailofbits).
x.comthreadAdded 1 Oct 2026, published 30 Sep 2026π‘οΈ Security
A Clever RSA Attack Fooled a Hardware VaultβHere's What It Means for CryptoResearchers at UC San Diego and INRIA demonstrated a chosen-message oracle attack that forges RSA signatures on a 1,024-bit key held inside a hardware security module (HSM) without ever extracting the key, by disabling the HSM's FIPS mode to get it to sign unpadded/unformatted values roughly 4 billion times and then computing the private-key operation from the responses (1,380 CPU core-years of work). The attack only applies to unpadded RSA signing oracles β standard PKCS#1 v1.5/PSS padding blocks it β so it doesn't threaten Bitcoin/Ethereum (which use ECDSA) but is relevant to anyone auditing HSM key-custody assumptions or RSA-based blind-signature schemes like Privacy Pass. The authors frame it as further classical evidence to accelerate migration away from RSA ahead of the post-quantum transition.
decrypt.coarticleAdded 30 Sep 2026, published 28 Sep 2026π‘οΈ Security
PQ spending for Stealth Address ProtocolThird in a series on post-quantum upgrades to the Stealth Address Protocol (ERC-5564/ERC-6538), this ethresear.ch post proposes a new schemeId=6 that replaces ECDH with ML-KEM for quantum-safe payment discovery and replaces ECDSA with either a lattice-based signature (SPIRIT, an ML-DSA/Dilithium variant) or a novel construction called HSAP that uses ML-KEM key delivery plus a ZK proof over hash-preimages for spending authorization. It works through the exact key-generation/derivation math for both schemes, discusses on-chain verification costs (citing ETHDILITHIUM benchmarks and draft EIP-8051's ~4500-gas ML-DSA-44 precompile), and sketches how the extended ERC-5564 announcer/registry interface and smart-account spending path would look under quantum attack assumptions.
ethresear.charticleAdded 29 Sep 2026, published 28 Sep 2026π‘οΈ Security
Don't let TEEs break your MPCTrail of Bits explains why running threshold-signature MPC protocols inside TEEs (Intel TDX, AMD SEV-SNP, AWS Nitro Enclaves) is not automatically secure: a malicious host can roll back enclave filesystem state to force reuse of deleted pre-signature nonces, leaking a signer's private key share. The post catalogs recurring audit pitfalls β incomplete attestation measurements (citing the WhatsApp Private Inference LD_PRELOAD bypass), missing verification steps, weak hardening, stale-backup/rollback risks (including LUKS2 header manipulation in confidential VMs), and physical/side-channel attacks like TEE Fail and DDRop against DDR5 memory β and gives best practices such as binding attestation to MPC party identities and using multiple TEE vendors for defense-in-depth.
blog.trailofbits.comarticlePublished and added 25 Sep 2026π‘οΈ Security
EIP-8425: Quantum Freeze and Account RecoveryA detailed reply on the Ethereum Magicians forum thread for EIP-8425 ("Quantum Freeze and Account Recovery"), which specifies how Ethereum accounts should transition authority when their legacy ECDSA key could be broken by a quantum adversary. The author formalizes a FROZEN/CLAIMED/RESOLVED-CONTESTED-UNRESOLVED/SUCCESSOR recovery state machine, replay-resistant claim hashes bound to a per-account recoveryEpoch, and two core invariants preventing a compromised ECDSA key from unilaterally establishing successor authority, closing an attack case where a quantum adversary obtains the key before the protocol's SAFE_RECOVERY_TIME cutoff. It also references related EIPs on signature-algorithm agility (EIP-7932) and PQ/STARK signature aggregation (EIP-8288).
ethereum-magicians.orgthreadAdded 29 Sep 2026, published 24 Sep 2026π‘οΈ Security
Proactive Defense: Hardening Code Pipelines and CI/CD InfrastructureMandiant's guidance for hardening the software supply chain across five pillars: endpoint, code repositories, artifact management, CI/CD and deployment. It covers a seven-day dependency cooldown, pinning images and actions by digest or commit SHA, ephemeral runners, OIDC short-lived tokens, build cache isolation, signed SBOMs, SLSA provenance and admission-time signature checks. It responds to campaigns using cache poisoning, OIDC token theft and mutable action tags.
cloud.google.comarticleAdded 29 Oct 2026, published 24 Sep 2026π‘οΈ Security- Jev introduces a new shape of LLM - System One, aka Decision Models
Simon Willison reviews Jev, a new class of model from TypeSafe AI dubbed "System One models" (or "decision models"): instead of generating text, it takes a text/structured "state" plus one or more yes/no ("Noul"), multiple-choice, or scored-range questions and returns floating point probabilities/confidence scores, priced at $0.042/million input tokens with free output. The post covers real use cases (classification, spam detection, search reranking over BM25 candidates), community experiments (jevchat, jev-leftpad, jev-2048), open-weight recreations built on Qwen 3.5 (the Kev models and JevBench benchmark), and raises concerns about the model's black-box nature and bias risk, plus Willison's own llm-typesafe plugin for the LLM CLI tool.
simonwillison.netarticleAdded 29 Sep 2026, published 21 Sep 2026π§ AI - SAML: A fractal of bad design
A Trail of Bits researcher (ex-Duo Security engineer) traces SAML's history from its 2002 OASIS committee origins through recurring XML signature wrapping (XSW) and canonicalization/round-trip parser-differential attacks, arguing its reliance on brittle XML signature validation (libxmlsec) makes it fundamentally unsound. The post catalogs SAML's five structural flaws β XML complexity, canonicalization, enveloped signatures, kitchen-sink design, and protocol ossification β and recommends organizations deprecate SAML in favor of OIDC, citing Fly.io and Tailscale as vendors already holding the line on OIDC-only SSO.
blog.trailofbits.comarticlePublished and added 21 Sep 2026π‘οΈ Security
Auditing in the age of (good enough) AITrail of Bits describes preparing for a six-month audit of the Miden zkVM (a zero-knowledge VM with its own custom assembly language, MASM) by having AI agents (Claude and Codex) build an LSP server, a decompiler, an abstract-interpretation-based static analysis engine, and a Lean formal model of the VM executor, none of which previously existed for MASM. These tools surfaced a high-severity bug in the mod_12289 procedure where an underconstrained prover-supplied advice value allowed a malicious prover to forge Falcon signatures and drain Miden accounts, plus over 400 type-validation issues, while the Lean proof effort produced 95 machine-checked correctness proofs and caught two additional subtle arithmetic bugs (rotr, wrapping_mul) missed by unit tests.
blog.trailofbits.comwriteupPublished and added 18 Sep 2026π‘οΈ Security
Closed-World Resolution Against Tool Hallucination in LLM AgentsThis arXiv paper identifies tool hallucination β LLM agents calling nonexistent tools or passing undeclared arguments β as a structural blind spot that existing tool-selection and tool-gating defenses cannot catch, since a hallucinated call was never a real gating decision. The authors propose a five-class taxonomy (H1-H5) of tool hallucination and a training-free closed-world resolver (the Resolution Rung, based on registry membership plus signature checking) that must run before any causal gate, then extend the analysis to the Model Context Protocol where merging multiple servers into one namespace creates a second hallucination class (M1-M5) from tool collisions and shadowing. Across ten hosted models they measure 322 hallucinations on single-registry tool calls and 154 on a live MCP surface, and release the versioned Hallucinated-Tools Benchmark (HTB) for comparing resolvers.
arxiv.orgpaperAdded 2 Oct 2026, published 16 Sep 2026π‘οΈ Security
Closed-World Resolution Against Tool Hallucination in LLM AgentsThis arXiv paper studies tool hallucination in tool-augmented LLM agents, where agents call tools that do not exist or pass arguments no schema declares, arguing existing tool-selection and tool-gating defenses structurally cannot catch it since a hallucinated call was never a decision a gate made. The authors give a five-class taxonomy (H1 to H5), propose the Resolution Rung, a training-free closed-world resolver based on registry membership plus a signature check that must run before any causal gate, and extend the analysis to the Model Context Protocol with a second taxonomy (M1 to M5) covering collisions and shadowing when multiple servers are merged into one namespace. Across ten hosted models they measure 322 hallucinations on two invocation surfaces and 154 on a live MCP surface, and release the versioned Hallucinated-Tools Benchmark for comparing resolvers.
arxiv.orgpaperAdded 2 Oct 2026, published 16 Sep 2026π§ AI
Pass-the-Passkey Family of AttacksSpecterOps research introduces "Pass-the-Passkey," a family of 20+ attack techniques against passkey/WebAuthn authentication, including three zero-days: Windows 11 logging complete WebAuthn assertions to an Event Log readable by unprivileged users (patched July 2026), Microsoft Entra ID historically failing to enforce WebAuthn anti-replay protections (challenge reuse, session binding, signature counters), and local malware that calls the native Windows WebAuthn API directly to phish users with a convincing native-looking passkey prompt. The write-up argues these implementation failures mirror classic credential-relay attacks like Pass-the-Hash and NTLM Relay, and recommends device-bound passkeys with attestation enforcement for high-value accounts.
specterops.iowriteupAdded 2 Oct 2026, published 16 Sep 2026π‘οΈ Security
STUART: Sequence Triage and qUAntification of Read Transcripts for Rapid Ionizing Radiation Exposure AssessmentSTUART is a mapping-free machine learning framework for biological dosimetry that converts raw sequencing reads into k-mer-based numerical feature profiles (NLP-inspired), bypassing traditional alignment-based bioinformatics. Using the FDXR gene as a radiation biomarker, the authors compare Logistic Regression, Random Forest, and XGBoost, reducing a 1024-dimensional feature space by over 98% to as few as 17 signatures while achieving 95-100% F1/balanced accuracy and over 99% specificity on external validation, enabling real-time triage compatible with portable sequencers.
arxiv.orgpaperAdded 22 Sep 2026, published 16 Sep 2026π§ AI
Post-Quantum: Lattice or Hash-Based (one question, two right answers)A deep-dive field guide to choosing between lattice-based (ML-DSA/FN-DSA) and hash-based (SLH-DSA) post-quantum signatures, built from interviews with the designers and implementers behind both NIST standards and their deployments. It walks through Mosca's-inequality-style migration timing, CNSA 2.0's split between lattice signatures and stateful hash-based LMS/XMSS for firmware, the stateful-signature "footgun," and why the broader internet (TLS/WebPKI, via Merkle Tree Certificates) is converging on lattices while Ethereum's post-quantum consensus roadmap (leanXMSS, EIP-8292, EIP-8288 aggregation) and Algorand's live Falcon-1024 state proofs lean hash-based or scheme-neutral because of aggregation and on-chain storage constraints. It closes with a decision framework and a rundown of NIST's round-3 "onramp" signature candidates (MAYO, SQIsign, HAWK, etc.).
ethresear.charticleAdded 3 Oct 2026, published 15 Sep 2026π‘οΈ Security
From Algebra to Noise: Why Post-Quantum Cryptography Looks DifferentOpenZeppelin Security's technical explainer on why post-quantum cryptography looks so different from classical crypto: Shor's algorithm exploits the abelian hidden-subgroup structure underlying RSA, Diffie-Hellman, ECDSA, EdDSA and pairing-based schemes, while Grover's algorithm only halves the effective security of hashes and symmetric keys (256-bit hashes stay at a comfortable 128-bit level). It then walks through NIST's finalized lattice/hash-based PQC standards β ML-KEM (Kyber) for key establishment, ML-DSA (Dilithium) for general signatures, SLH-DSA (SPHINCS+) as a conservative hash-based backup, plus future Falcon/FN-DSA and code-based HQC β mapping each to blockchain use cases and covering real deployment (Starknet's Falcon-512 Cairo account contracts), Ethereum account-abstraction/hybrid-signature migration paths, Bitcoin's UTXO/consensus constraints, Ethereum's LeanSig consensus-signature research, and a concrete institutional crypto-asset-inventory and PQC audit checklist.
openzeppelin.comarticleAdded 29 Sep 2026, published 14 Sep 2026π‘οΈ Security
AI-Generated Malware Risk: A Practical Guide for Developers | Blog | Endor LabsAn Endor Labs guide explaining how AI-generated and AI-enhanced malware (citing Check Point's VoidLink, Google TIG's PROMPTFLUX/PROMPTSTEAL, and HYAS Labs' BlackMamba/EyeSpy) differs from traditional threats by dynamically mutating code at runtime to evade signature-based detection. It argues software supply chains are a prime target because AI can mass-produce convincing typosquatted or dependency-confused packages, and recommends behavioral analysis plus full-stack reachability analysis (via Endor Labs' AURI) as defenses instead of relying solely on CVE/signature matching.
endorlabs.comarticlePublished and added 11 Sep 2026π‘οΈ Security
Artifactory Under Attack: In-the-Wild Exploitation of CVE-2026-42016, CVE-2026-42018 & CVE-2026-82329Wiz Research documents active in-the-wild exploitation of three JFrog Artifactory vulnerabilities: CVE-2026-42018 (exposes an internal anonymous-user JWT via POST /access/api/v1/aws/token/), CVE-2026-42016 (token scope validation flaw allowing that JWT to be escalated to admin via POST /access/api/v1/tokens), and CVE-2026-82329 (unauthenticated admin access via POST /access/api/v1/registry/join, added to CISA KEV). Attackers chained the first two to create persistent admin accounts, deploy malicious Groovy plugins for RCE, and drop Rust-based C2 backdoors, while CVE-2026-82329 was exploited independently for configuration exfiltration, cluster join-key theft, and credential/SSH-key persistence. The post includes exact request sequences, detection signatures, affected/fixed version ranges, and remediation guidance.
wiz.ioadvisoryPublished and added 10 Sep 2026π‘οΈ Security
ClearFake WebDAV infection chain delivers Amatera stealer, ZigCryptoStealer, and NetSupport ManagerCisco Talos reconstructs two related WebDAV-based infection chains (tracked actor UAT-10820) that use a ClickFix fake-CAPTCHA lure, EtherHiding on BNB Smart Chain to stage JavaScript via a malicious Cloudflare Worker, and WebDAV-delivered disguised DLLs executed via rundll32 ordinal calls to drop the Amatera stealer. Depending on the C2 configuration, Amatera then deploys either a NativeAOT-loaded ZigCryptoStealer with a BYOVD EDR-killer driver and a Go-based Yamux reverse proxy, or a PowerShell stager that installs a trojanized NetSupport Manager RAT pointed at Russian C2 infrastructure. The post details loader internals, Amatera's dead-drop C2 resolution via Telegraph and Steam, and provides ClamAV signatures plus a full IOC list.
blog.talosintelligence.comwriteupAdded 7 Oct 2026, published 8 Sep 2026π‘οΈ Security- ForgeGuardian
ForgeGuardian is an open-source (Apache 2.0) supply chain security scanner covering 9 package ecosystems (npm, PyPI, Go, Maven, RubyGems, Cargo, NuGet, Hugging Face, GitHub Actions) via 8 concurrent scan engines and 223+ built-in malicious-package detection signatures. It runs fully offline/local-first, offers a CLI (fgctl) and self-hosted SOC-style dashboard, generates CycloneDX/SPDX SBOMs, supports Sigstore keyless signing and provenance tracking, policy-as-code rules, dependency topology/attack-surface mapping, drift detection with auto-quarantine, and SARIF output for GitHub Actions CI integration, plus optional AI-powered advisory/patch-agent triage.
github.comrepoPublished and added 5 Sep 2026π‘οΈ Security
Axonal delay dispersion decides whether a neuron detects an event or a sequence, and predicts cortical column diameterThis arXiv preprint proposes a "delay-signature" framework where the dispersion of axonal conduction delays converging on a dendritic branch determines whether a neuron acts as an event detector (coincidence) or an order-selective sequence detector, using simulations of an integrator-neuron model. The authors find a single scalar (delay dispersion) governs this computational transition, sets a millisecond-scale timing tolerance, and together with conduction velocity predicts cortical column diameter β linking myelination to what a neuron computes, not just how fast it signals.
arxiv.orgpaperAdded 22 Sep 2026, published 3 Sep 2026π§ AI- SAST for AI-Generated Code: What Static Analysis Catches and Misses | Blog | Endor Labs
Endor Labs blog post arguing traditional signature-based SAST misses the logic and business flaws AI coding assistants introduce, since those flaws are "not pattern-shaped." It contrasts AI-assisted SAST (rules plus a thin AI layer) with AI-native SAST that traces dataflow across files and uses reachability analysis plus evidence-based triage to cut false positives, citing that Endor Labs' own tool (built on Opengrep with AI-agent triage) found a zero-day, CVE-2026-55407, in Anthropic's Rust buffa library and that only ~1 in 5 AI-recommended dependency versions are safe.
endorlabs.comarticleAdded 3 Sep 2026, published 2 Sep 2026π‘οΈ Security
Showing 120 of 161
Show more