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
BiLoCo: Binary Low-Rank Corrections for Post-Training QuantizationBiLoCo is a post-training quantization method for FP4 LLMs that adds low-rank corrections whose left and right factors are stored as binary Β±1 sign vectors instead of BF16. This uses 16x less storage per rank-one component and lets the correction run on CUDA cores alongside the FP4 tensor-core GEMM. On 4B to 72B LLMs it matches or improves memory-matched SVDQuant. A fused B300 kernel is at most 11% slower than FP4-only GEMM at batch size 1 for ranks up to 512.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026π§ AI- MPQ: A Message-Passing View of Post-Training Quantization
MPQ (Message-Passing Quantization) is a post-training quantization method that treats row-wise PTQ as posterior inference over discrete codebooks. It keeps soft posteriors across weight blocks using vector approximate message passing, then refines a hard-decision initialization with exact block coordinate descent. Tested at 2-bit lattice and 3- and 4-bit scalar quantization on Llama, Qwen and Mistral models, it improves perplexity and zero-shot accuracy over GPTQ-style baselines.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026π§ AI - Efficient Laconic Oblivious Transfer with Malicious Security
Efficient Laconic Oblivious Transfer with Malicious Security is an ePrint paper (2026/2593, ASIACRYPT 2026 revision) giving the first maliciously secure laconic OT that uses its primitives only as black boxes. It adds equivocal vector commitments and maliciously secure witness encryption to the commitment-plus-witness-encryption paradigm. Security is proven in the UC model against malicious senders and in the context model against malicious receivers. Instantiations use LWE and bilinear Diffie-Hellman assumptions in the standard model.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026π‘οΈ Security - Sotto Maschera: Masking the Sota-Voce Fixed-Weight Vector Sampling
Sotto Maschera is a masked implementation of the Sota Voce sparse fixed-weight vector sampler (Sota support sampler and MWSupport conversion) for embedded devices, protecting against power side-channel attacks. It bitslices sorting, merging and compaction and masks only in the Boolean domain, avoiding slow conversions. TVLA evaluations show no leakage, and HQC runs up to 45x faster than previous masked work.
eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026π‘οΈ Security - Combining Long-Term Memory and LLMs Comes at a High Cost: From Prompt Injection to Persistent Compromise
Paper on memory injection, where prompt injection persists across sessions through the long-term memory of LLM-as-a-service platforms. It presents a general threat model and shows all NIST attack goals are achievable on ChatGPT Instant 5.3, Claude Sonnet 4.6 and Gemini 3 Flash. Vectors include personal memories, projects, skills, organization instructions and MCP resources. On Claude, shared memory lets an attacker compromise multiple users in an organization and exfiltrate prompts. Nearly half of the derived mitigations are unimplemented.
arxiv.orgpaperAdded 24 Oct 2026, published 20 Oct 2026π‘οΈ Security - Beyond 4 bits: Data-Centric Post-training Quantization and Recovery
This paper studies 2-bit post-training quantization (PTQ) of six dense and mixture-of-experts models from 3.8B to 32B parameters. It finds the quantization representation matters most: vector codebooks give usable models where scalar PTQ falls to chance. Calibration and recovery data must be chosen jointly. The recipe uses about 2.3 effective bits per weight, keeps 89 to 97% of full-precision QA accuracy, and needs 1.4 to 30x less compute than the strongest QAT baseline.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026π§ AI - Membership Inference in Privacy-Preserving Vector Search
Membership Inference in Privacy-Preserving Vector Search is an IACR ePrint paper (2026/2570) that attacks backend-compatible protections for embedding databases using one snapshot and known plaintexts. It breaks the Scale-and-Perturb scheme of Fuchsbauer et al. (advantage 0.997 on MS-MARCO) and analyzes Rotate-and-Perturb, ideal DCRE and an encrypted HNSW index. It also tests shuffling and secret projection as mitigations.
eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026π‘οΈ Security - Further Elaborations on the Provable Dual Attack
Further Elaborations on the Provable Dual Attack is an October 2026 ePrint paper by Kaveh Bashiri presenting a provable dual attack on LWE that recovers a subvector of the secret, with an explicit success-probability bound and no heuristic assumptions. It unifies the analyses of Pouly and Shen (EUROCRYPT 2024) and Bashiri and Wiemers (2025). Applied to ML-KEM it improves the first provable dual attack by 22 to 100 bits; it is also applied to ML-DSA and tested on small instances. The author states ML-KEM and ML-DSA are not threatened.
eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026π‘οΈ Security - Fake News, Real Crashes: Information Injection Attacks on LLM Financial Trading Agents
Fake News, Real Crashes is an October 2026 arXiv paper presenting a benchmark for information injection attacks on LLM financial trading agents. It spans five injection vectors, seven event categories and about 10,000 decisions on 15 U.S. stocks. Fabricated news reached 62% attack success versus 14% for prompt injection, and two 30-word templates hit 100%. Only hierarchical aggregation reduced success among the defenses tested.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026π‘οΈ Security - Concrete LDVR Attacks with Fewer Signers
Concrete LDVR Attacks with Fewer Signers is an ePrint paper by Renas Bacho on the low-dimensional vector representation (LDVR) problem behind adaptive security of threshold Schnorr. It combines a Chinese remainder theorem construction with a generalized birthday search to attack 488 signers with 173 corruptions over the Curve25519 scalar field, down from 5,020 signers. For adversarial evaluation points, it reaches optimal success probability and breaks 228 signers with 114 corruptions in 168.60 seconds.
eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026π‘οΈ Security - Optimizing HQC with Enhanced Parallel Binary Polynomial Multiplication on GPUs
This paper presents an end-to-end GPU implementation of the HQC code-based key encapsulation mechanism. It speeds up GF(2) polynomial multiplication with a parallel Frobenius additive FFT and a Toeplitz matrix-vector mapping onto INT1 tensor cores. On an RTX 4090 the multiplier reaches 3,828k polymul/s, about 2.9x the earlier HIGH implementation. Full KEM throughput is 1.56x, 1.55x and 2.03x higher for keygen, encaps and decaps. Five thread-to-KEM mapping variants are tested on RTX 3090 and Jetson AGX Orin.
eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026π‘οΈ Security - Sparse Secrets, Dense Problems: Efficiently Masking HQC in Hardware
ePrint paper presenting the first fully masked hardware implementation of HQC (key generation, encapsulation, decapsulation) on FPGA. It introduces a mixed Boolean/arithmetic masking for sparse-dense vector multiplication, proven first-order secure in the transition- and glitch-robust probing model and PINI-composable, at only 3% extra cycles and 81 random bits per cycle. It also shows a profiled horizontal side-channel attack on Rotate-and-Add multipliers that recovers support indices within Β±8 positions from 200 traces despite TVLA showing no leakage after 10 million traces, and adds integrated hiding countermeasures costing 1.7% latency.
eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026π‘οΈ Security - PrairieFire: Igniting High-Throughput Updates in Large-Scale Approximate Nearest Neighbor Search
PrairieFire is an SSD-based approximate nearest neighbor search system for billion-scale vectors, built for high update throughput. It uses buffered updates and batched local rebuilds, with cascaded adjustments, concurrency control and CPU-GPU-SSD cooperation. Against state-of-the-art systems it reports about 3-35x update throughput, 3-5x search throughput and 1.5-8.7x cost efficiency. It has run in RedNote production for two months.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026π§ AI - The importance of tensor handling and implementation of physics-informed DeepONets
Proposes a modified Physics-informed DeepONet (PI-DeepONet) architecture that removes redundancy in how the Branch network processes input functions across collocation points. It is mathematically equivalent to the original but uses smaller input tensors and fewer Branch evaluations. The authors derive training-time scaling laws, then test on 1D, 2D and 3D linear advection problems. Accuracy matches the original, the maximum speed-up is 3.75Γ in 2D, and a 3D model trains on an NVIDIA A100 only with the new formulation, because the original runs out of memory.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026π§ AI - Efficient Vectorized Implementation of MQOM
ePrint 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 - Compile the Table: Query-Calibrated Operator Compression for Tabular In-Context Learning
Proposes QCOC (Query-Calibrated Operator Compression) for tabular in-context learning. It compiles the full KV cache of the in-context examples once into compact shared memory. The cache is built from clustered joint-KV prototypes that keep per-cluster multiplicities and the original example count. Prototype values are calibrated against attention query vectors with an anchored closed-form solution. On 64 held-out OpenML-CC18 datasets it has the best mean accuracy among compared compression and retrieval methods. On seven long tables it averages 0.23 points below full context. Compressing 8,192 examples to 512 slots gives 10.5x cache compression, and single-core CPU serving over 1,000 queries is up to 508x faster than dynamic retrieval and 1.98x faster than full context.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026π§ AI - A Universal Forgery Attack on the Origami Signature Scheme from the Public Key Alone
This 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 - Faster Provable Lattice Sieving with Spherical Codes
Aggarwal, Morolia, and Stephens-Davidowitz present a new lattice-sieving algorithm for ΞΌ-SVP (finding an approximate shortest nonzero vector) that combines fast nearest-neighbor subroutines from heuristic sieving with a perturbation argument that yields a formally proven correctness guarantee. Its running time, roughly 2^0.3066n under a plausible spherical-code-size assumption (and 2^0.6078n using only proven bounds), is far faster than the prior best provable algorithm (2^0.802n, Liu-Wang-Xu-Zheng 2011) and close to the best heuristic rate (~2^0.2925n), narrowing the long-standing gap between proven and heuristic lattice attack runtimes. This matters for setting conservative, defensible hardness estimates and parameter choices in lattice-based post-quantum cryptography.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026π‘οΈ Security - The Lattice Isomorphism Problem with Hints
This 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 - K-LMS: Design, Implementation, and Evaluation of LeightonβMicali Signatures with Korean Cryptographic Primitives
An 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 - Area-Efficient Hardware Architecture of the Post-Quantum HQC Cryptosystem with Side-Channel Protection
This IACR eprint paper presents a resource-efficient FPGA hardware architecture for the NIST-selected HQC post-quantum KEM that defends against power-based side-channel attacks by reusing otherwise-idle KECCAK hardware to inject scrambling dynamic power during decoding, adding less than 0.5 percent area overhead compared to masking/shuffling countermeasures. The fully parameterized design supports HQC-128/192/256 and was prototyped on a Xilinx Artix-7 FPGA (139 MHz, 11,489 LUTs, 6,785 FFs, 4 DSPs), with functional correctness verified via NIST Known Answer Tests and leakage suppression confirmed via Test Vector Leakage Assessment.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security - Bounded Provisional Visibility: Controlling Poisoning Exposure in Continuously Ingested RAG Vector Stores
This paper proposes a fail-closed "bounded provisional visibility" protocol for continuously ingested RAG vector stores, which admits new content under a verification deadline and hides items whose vetting hasn't committed in time, bounding how long unvetted (potentially poisoned) content can be retrieved. Evaluated on five document workloads using an exact-match backend and Milvus with HNSW indexing, the deadline-based admission cut median poisoned retrievals from 34 to 7 under verifier backlog versus asynchronous admission with no deadline, while verify-before-visible avoided exposure entirely but delayed clean content visibility to 6.3s versus 3ms for provisional admission. The work quantifies the inherent trade-off between freshness, availability, and poisoning exposure in continuously updated retrieval systems, and shows results remain conditional on the quality of the underlying poison detector.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026π‘οΈ Security - X-Wing on Cortex-M85: Architecture-Aware Integration and End-to-End Evaluation
An IACR ePrint paper presenting an architecture-aware implementation of the X-Wing hybrid KEM (ML-KEM-768 plus X25519) for the ARM Cortex-M85, using its M-profile Vector Extension NTT and a shared-inversion trick during encapsulation to cut cycle counts by 12 to 19 percent versus a baseline, at a cost of about 35KB extra flash. The authors found that their optimized variant introduced secret-sign-dependent operand-address selection, a side-channel weakness, and produced a corrected version whose fix is only partial since some key-varying timing signals persist and remain unexplained, so no constant-time guarantee is claimed.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026π‘οΈ Security - From Patching to Pruning Visual Computation in Vision Language Models
Patch-to-Prune (P2P) is a training-free framework that repurposes activation patching from mechanistic interpretability into an inference-time compute bypass for vision-language models, replacing unnecessary visual-token projections in certain decoder layers with fixed neutral proxy vectors while preserving sequence length, token order, and residual pathways. Tested on Qwen2.5-VL and LLaVA family models across seven multimodal benchmarks, P2P at 3 percent tolerance retains about 94 percent of dense accuracy while cutting FLOPs by 55 percent, and reveals that intermediate decoder layers do most of the task-relevant visual integration while early and late layers need little token-specific visual computation.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026π§ AI - EmoRES-TTS: Residual-Enhanced Vector Steering for Emotional Speech Generation
EmoRES-TTS introduces a training-free vector steering method for emotion-conditioned text-to-speech that decomposes an emotion direction into a shared 'away-from-neutral' component and a residual 'toward-target-emotion' component, controlling each separately without retraining the backbone model. Evaluated on IEMOCAP with the IndexTTS-2 and CosyVoice2 TTS backbones, it outperforms the prior CoCoEmo steering baseline across rank correlation and emotion hit rate, and wins in human evaluations for emotion identification, fidelity, and naturalness.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026π§ AI - LLM Inference in a Flash! (UC Berkeley)
This UC Berkeley paper designs LLM inference algorithms for Compute-in-Flash devices, which move computation into SSD memory to overcome bandwidth limits but lack floating-point support and have limited write endurance. It presents an end-to-end integer-only quantization scheme and a dictionary-based KV cache compression method (sparse dictionary coding representing KV vectors as linear combinations of static dictionary vectors), reducing dynamic KV cache traffic 15x on Llama-3.1-8B and Qwen-2.5-7B with limited accuracy loss.
arxiv.orgpaperAdded 26 Sep 2026π§ AI - A Blind Trust, the Bloody Thrust: When Attacker-Controlled Hook Updates Steer AI Agent Harnesses towards Malicious Behaviors
This paper identifies lifecycle-hook configuration updates as a trojan vector in AI agent harnesses: hooks bind shell commands to runtime events (session start, tool calls, file edits) and run with host privileges, but harnesses blindly trust plugin-metadata updates that silently rebind these commands to attacker-chosen code. The authors built HookPry, an open-source automated attack framework realizing ten attack objectives, and across 25 harness/backend combinations in 1,000 runs it compromised all seven evaluated harnesses (up to 92.5% per-harness success), while Microsoft Defender caught none of the malicious artifacts and combined static defenses still missed 47.5%.
arxiv.orgpaperAdded 26 Sep 2026π‘οΈ Security - Quantization as a Malicious Task: Removing Quantization-Conditioned Backdoors via Task Arithmetic
This paper introduces QVec, a defense against Quantization-Conditioned Backdoors (QCBs) β a threat where a neural network behaves normally in full precision but activates hidden malicious behavior only after quantization. QVec treats the weight difference between the full-precision and quantized model as a "malicious task vector" (via task arithmetic) and applies a lightweight parameter correction before deployment to cancel it out, requiring no retraining, no trigger samples, and only one quantization pass plus a small hyperparameter search. It's evaluated across image classification benchmarks and multiple LLM backdoor attack scenarios, suppressing backdoor activation while preserving clean-model performance.
arxiv.orgpaperAdded 26 Sep 2026π‘οΈ Security - Minimally Invasive Steering of Language Models
Minimally Invasive Steering Vector Optimization (MISVO) regularizes pre-logit activation steering using the local KL/Fisher geometry of the token distribution, letting a frozen model be adapted to a test-time reward without badly distorting its outputs. Across 1B-14B parameter models on preference and code-generation tasks, MISVO gets highest mean reward in six of seven settings while keeping diversity and coherence close to Best-of-N.
arxiv.orgpaperAdded 26 Sep 2026, published 24 Sep 2026π§ AI
Showing 30 of 32
Show more