Skip to content

262 results for β€œSEC”

What you seeeverything
  1. GPT-Rosalind-6 System Card Addendum

    GPT-Rosalind-6 System Card Addendum is OpenAI's safety documentation for a life-sciences model that shares weights with GPT-6 Astra. It rates the model High in Biological and Chemical and Critical in Cybersecurity under the Preparedness Framework. It reports biology evaluations, trusted-access controls, biosecurity refusal pass rates, a historical cyber jailbreak regression (14.3% task success), and sabotage and monitor-evasion results.

    deploymentsafety.openai.compaperPublished and added 30 Oct 2026πŸ›‘οΈ Security

  2. Don't Lose the Thread: Empowering Long-Horizon LLM Agents with Cognitive Resource Self-Allocation

    CORAL (Cognitive Resource Self-Allocation) is an agent-callable working-memory toolset that lets an LLM agent checkpoint task progress and verified facts, then reset its cluttered context and resume from a clean state. A Multi-episode Agentic Reinforced Policy Optimization algorithm trains the checkpointing. With an 8B model it reaches 42.8% average accuracy on GAIA, uses 6-7x fewer input tokens than a ReAct agent, and adds 8.0 points to a proprietary agent on BrowseComp.

    arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

  3. Turing LLM Post-Training: Calibrated Distillation and Efficient Dynamic-MoE Execution

    Turing LLM post-training combines calibrated multi-teacher on-policy distillation (C-MOPD) with an execution path for dynamically routed mixture-of-experts models. C-MOPD matches each teacher on a local Top-K support with teacher-wise loss normalization and clipping. On Turing-20B-A2B it scores 0.9988 on four-domain integration, beats Qwen3-8B on math and code (85.92 vs 80.33 mean), and cuts consolidation step time from 398.7 to 139.3 seconds in a PPU profile.

    arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

  4. Sparse Autoencoders as Implicit Diversification Regularisers for Cross-Sectional Cryptocurrency Returns

    This arXiv preprint (October 2026) tests a sparse autoencoder as a factor model for daily cryptocurrency returns, with equities as a secondary test. SAE portfolios show consistently lower volatility than common benchmarks, linked to lower correlations among selected assets. They do not beat a simple contrarian strategy on risk-adjusted return, and factor identities change between training runs.

    arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

  5. Cryptography and Security Papers (@FSFG) on X

    PrivacyEvalClaw is a tool-augmented deliberative agent that audits privacy leakage in LLM jailbreak responses. The paper is by Krishna Kanth Nakka and co-authors, and it was accepted to AACL-IJCNLP 2026 (arXiv 2610.36711, cs.CR). The tweet gives only the title, authors and venue, so the method and results are not described.

    x.compaperAdded 30 Oct 2026, published 29 Oct 2026πŸ›‘οΈ Security

  6. Cryptography and Security Papers (@FSFG) on X

    PrivacyEvalClaw is a tool-augmented deliberative agent for auditing privacy leakage in LLM responses produced under jailbreak prompts. By Krishna Kanth Nakka and five co-authors, the paper is on arXiv (cs.CR) and accepted to AACL-IJCNLP 2026. The fetched post gives only the title, authors and venue, so method details and results are not available here.

    x.compaperAdded 30 Oct 2026, published 29 Oct 2026🧠 AI

  7. Addendum to GPT-6 Luna System Card: October 28, 2026 Update

    Addendum to the GPT-6 Luna system card for the model update of 29 October 2026 (the title says October 28). OpenAI keeps the High rating for cybersecurity and biological/chemical capability under its Preparedness Framework. It reports ExploitBench 46.19% and SEC-Bench Pro 51.75% (GPT-6 Astra: 85.4%), higher multiturn jailbreak defender success than the October 7 version, and GPT-Red prompt-injection results. It also reports weaker factuality and dual-use biology refusal.

    deploymentsafety.openai.compaperPublished and added 29 Oct 2026πŸ›‘οΈ Security

  8. Cryptography and Security Papers (@FSFG) on X

    Log-To-Leak is an arXiv paper (cs.CR, cs.AI) by Yuepeng Hu, Chongyu Fan, Sirat Samyoun and Jian Du on prompt injection attacks against tool-using LLM agents through the Model Context Protocol. The title points to a logging-based data leakage channel. The fetched page holds only the title, authors and arXiv link, with no abstract, so the method and results are not visible here.

    x.compaperAdded 29 Oct 2026, published 28 Oct 2026πŸ›‘οΈ Security

  9. Secure Transaction Verification and Authorization (STVA)

    Secure Transaction Verification and Authorization (STVA) is a draft Standards Track ERC (created October 2026) by @MATOBOYCRYPTO65. It proposes structured human-readable metadata and semantic intent for transactions and UserOperations, an independent simulation and verification interface, and scoped, revocable capability tokens for privileged operations. It targets blind signing and frontend supply-chain attacks, citing the February 2025 Bybit Safe multisig theft. The page gives only the abstract, motivation and core concepts.

    ethresear.chpaperPublished and added 28 Oct 2026πŸ›‘οΈ Security

  10. Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days

    Shor's algorithm compiled on cat qubits is an IACR ePrint (2026/2665) giving an end-to-end resource estimate on superconducting cat qubits, using repetition and LDPC cat codes. Factoring RSA-2048 needs about 23,000 cat qubits and 3.14 days, assuming phase-flip noise p_Z = 5e-4 and no bit-flips. secp256k1 ECDLP needs at most 30,000 qubits and 1 hour. A space-for-time trade runs RSA-2048 in 1.25 hours on about 611,000 qubits.

    eprint.iacr.orgpaperPublished and added 28 Oct 2026πŸ›‘οΈ Security

  11. Beyond the Event Horizon of Keccak, Extending the Observation from 2011 and applications

    Beyond the Event Horizon of Keccak extends a 2011 observation that a path in the Keccak sponge from a zero-capacity state back to one yields infinite second-preimage families. Three theorems cover loops from any capacity value x, k-block loops and cycles, and Joux-style multicollisions with search cost independent of k. Verified examples run on Keccak-f[200] and Keccak-f[1600] with c=32; it also proposes bridge-based protocols.

    eprint.iacr.orgpaperPublished and added 28 Oct 2026πŸ›‘οΈ Security

  12. Session-Bound Behavioral Watermarking for Autonomous LLM Agents

    AgentAnchor is a session-keyed behavioral watermark for attributing LLM agent trajectory logs to an owner. It derives per-step keys from a secret key, a fresh public session ID and semantic observation states, and embeds parity evidence through a KL-bounded exponential tilt. The paper formalizes learned cross-session forgery, and a trusted verifier checks disputed logs using wrong-key calibration and abstention.

    arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026πŸ›‘οΈ Security

  13. Session-Bound Behavioral Watermarking for Autonomous LLM Agents

    AgentAnchor is a session-keyed behavioral watermark that lets an agent owner prove ownership of a trajectory log. Each step key comes from a secret key, a fresh public session identifier and semantic states of recent observations. Parity evidence is embedded through a KL-bounded exponential tilt of action choices. A trusted verifier checks disputed logs without rerunning the agent, using wrong-key calibration and abstention. The paper also formulates a learned cross-session forgery threat.

    arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

  14. Structured Security Explanations for Learning-Based Vulnerability Detection

    VulnLens is a framework for binary C/C++ function-level vulnerability detection. A label-blind LLM Explainer describes each function from seven fixed perspectives (data flow, memory access, object lifetime, arithmetic and type behavior, control flow, shared state, external-resource access). A supervised Detector fuses code and explanations by cross-attention. It reaches 75.5% accuracy and 77.2% F1 on a 526-function PrimeVul test set, and 66.4% accuracy on SecVulEval without retraining.

    arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  15. Tractable, Not Truncated: Colored-Noise TRNG Security via Fractional Brownian Motion

    This ePrint paper models oscillator-based TRNG phase noise, both white and flicker, as fractional Brownian motion. It proves a quasi-renewal property that gives closed-form worst-case min-entropy and sampling requirements, and extends spectral and Allan-variance analysis so noise parameters come from a single timing trace. FPGA and ASIC experiments show flicker noise accounts for over 99% of uncertainty at a 0.99 min-entropy target, allowing a bitrate two to three orders of magnitude higher.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  16. Heads of Security: Learned Attention Gates Improve Prompt Injection Robustness

    Heads of Security (HoS) is a prompt injection defense that enforces instruction-data separation with learned per-head attention gates, redistributing attention between trusted and untrusted tokens. Evaluated on Llama-3.3-70B-Instruct and GPT-OSS-20B against SecAlign++ and ASIDE. The black-box RL-Hammer attack reaches 97% ASR on GPT-OSS-20B and 85% on SecAlign but 10% on HoS. The white-box Claudini attack needs 3 times more FLOPs on HoS. HoS keeps base-model utility in few-shot settings, where SecAlign and ASIDE degrade.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  17. Heads of Security: Learned Attention Gates Improve Prompt Injection Robustness

    Heads of Security (HoS) is a prompt injection defense that trains a small set of per-head attention gates to shift attention between trusted and untrusted tokens, separating instructions from data. Tested on Llama-3.3-70B-Instruct and GPT-OSS-20B, the black-box RL-Hammer attack reaches 10% ASR on HoS versus 97% on base GPT-OSS-20B and 85% on SecAlign. HoS keeps base utility in few-shot settings, where SecAlign and ASIDE degrade.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

  18. Radical isogenies on every model

    Radical isogenies on every model is an IACR ePrint paper by Thomas Decru (October 2026). It gives radical isogeny steps of every odd degree N directly on short Weierstrass, Montgomery, twisted Edwards, Huff, Jacobi quartic, twisted Hessian, Legendre and Jacobi intersection curves, plus Kummer lines. In Tate normal form a step drops from 12.5N to 10N multiplications. Montgomery and twisted Edwards curves cost 10.5N+O(1) per step and 2N to push a point. All algorithms are inversion-free, with exact operation counts.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  19. Tessera: Structure-Completed Evidence Units for Web Retrieval-Augmented Generation

    Tessera is a training-free evidence delivery layer for web retrieval-augmented generation. It rebuilds retrieved pages' HTML into fine-grained evidence units, each completed with page title, section path and table headers, then packs the relevant units into the reader context at the same token budget. Tracing evidence over full English Wikipedia shows chunking loses table and infobox content. Tessera adds 5 to 6 accuracy points on three QA benchmarks and carries over to agentic search.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

  20. Alg\{Ossa\}: Decentralized Secure Aggregation with Rotating Committees and Eventual Delivery

    AlgOssa is a decentralized secure aggregation protocol built on Ossa, a generic committee-aided, single-server construction for one-shot clients (following OPA and Willow, CRYPTO 2025). Ossa realizes secure aggregation with non-selective abort against a malicious server. AlgOssa adds Algorand-style sortition to rotate leaders and committees, bounds the chance of an honest server, and gives eventual delivery. Classical and post-quantum routes are evaluated.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  21. Unshuffling Fisher-Yates: Practical Recovery of Length-128 Permutations and Application to ML-DSA

    Paper (IACR ePrint 2026/2658) presenting a single-trace side-channel attack on a software Fisher-Yates shuffle of length 128, the butterfly count in one ML-DSA NTT layer. It removes rejection-sampling timing variation, extracts Hamming weight and identity leakage, and enumerates likely permutations with constraint programming. On a shuffled ML-DSA-44 NTT it recovers secret polynomial s1, fully or up to a few coefficients.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  22. Poly2MsgLeaks: Certified Key Recovery from Polynomial-to-Message Leakage

    Poly2MsgLeaks is a profiled chosen-ciphertext power-analysis attack on the SMAUG-T (TiMER parameter set) post-quantum KEM that recovers the full 512-coefficient PKE secret from six traces on an STM32F415. It recovers 999 of 1,000 unseen secrets and proves an incorrect key is released with probability at most 2^-2095.6. Single-write message assembly and a two-share masked P2M resisted the evaluated six-execution attack.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  23. OblivDGL: Oblivious Deep Graph Learning Made Practical

    OblivDGL is a secure computation framework for GNN training and inference, modelled on Deep Graph Library. It uses an oblivious message-passing paradigm and an oblivious graph representation built on function secret sharing (FSS). It leaks only total node and edge counts. On four benchmark graph datasets it cuts training communication up to 1024x and runtime up to 14.3x against prior secure GNN systems.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  24. OblivDGL: Oblivious Deep Graph Learning Made Practical

    OblivDGL is a framework for secure GNN training and inference in machine-learning-as-a-service settings, modelled on Deep Graph Library. It uses an oblivious message passing paradigm and a new oblivious graph representation built on function secret sharing, revealing only the total node and edge counts. On four benchmark graphs it cuts training communication up to 1024x with up to 14.3x speedup, and inference communication up to 754x with 4.19x speedup.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

  25. Measuring Users' Security and Privacy Concerns About Third-Party Community Bots on Discord

    Measurement study of 23,102 third-party Discord bots and 183,142 user reviews (2021-2026, 49 languages). A fine-tuned DeBERTa classifier plus manual validation yields 8,832 security and privacy reviews, mapped to a 31-theme taxonomy; Data Sharing (30.5%) and Data Collection (16.2%) dominate. Permission count and admin status correlate only weakly with user concerns. The authors build BotLens, an MCP-server auditing framework with six tools.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  26. When Algebraic Structure Meets Too Many Hints

    "When Algebraic Structure Meets Too Many Hints" is an ePrint paper (2026/2654) arguing that DDGR hint classes and too-many-hints thresholds are not standalone side-channel security metrics. In synthetic Kyber-512 experiments, NTT-domain residues recover the full secret with about half the hints the uniform mod-q bound predicts. Finite-precision FFT samples need 25% to 55% of the budget for uniform perfect hints. No new attack optimizations are proposed.

    eprint.iacr.orgpaperPublished and added 27 Oct 2026πŸ›‘οΈ Security

  27. What Victims Take Away: Attack Reuse and Defense Revision after Prompt-Injection Attacks

    What Victims Take Away is an October 2026 arXiv paper analysing 563,349 Tensor Trust attack records to see how players reuse prompt injections they received. Within a week, targets reused 10.0% of attacks that broke their defense, versus 0.03% of matched attacks. Breaches were followed by defense changes that cut same-family attack success by 24.5 points. Received texts made up 23.2% of successful hijacks. The authors propose that AI security tools describe techniques without disclosing full attack text.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026πŸ›‘οΈ Security

  28. Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language Models

    REVA (REal-time Vulnerability Analysis) is a vulnerability detector that puts a module threat model, lightweight static analysis findings and call-graph information into one LLM forward pass. A trained probe reads the model's internal representations of the new function. On PrimeVul's held-out test set, REVA on GLM-5.3-Flash reaches 60.0% accuracy in about one second per function, matching the agentic VulTriage (59.2%) at over 250 times the speed and under a tenth of the cost. The probe is 14% to 17% more accurate than the LLM's own verdict.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🧠 AI

  29. Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language Models

    REVA (REal-time Vulnerability Analysis) is an LLM-based vulnerability detector that screens each new function in one forward pass. It feeds the model a pre-computed module threat model, lightweight static analysis findings and call-graph data, then reads the model's internal representations with a trained probe. On PrimeVul's held-out test set with GLM-5.3-Flash it reaches 60.0% accuracy in about one second per function, matching the agentic VulTriage (59.2%) while over 250 times faster.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026πŸ›‘οΈ Security

  30. LINE-Break: Cryptanalysis and Reverse Engineering of Letter Sealing

    LINE-Break is a security analysis of Letter Sealing v2, the custom end-to-end encryption protocol in the LINE messenger. A TLS man-in-the-middle attacker or malicious server can replay, reorder and block messages undetected, and colluding users can forge message authorship in one-to-one and group chats. Stickers and URL previews leak plaintext. The attacks were verified on the real iOS app and an independent implementation.

    eprint.iacr.orgpaperPublished and added 26 Oct 2026πŸ›‘οΈ Security

Showing 30 of 262

Show more