Skip to content

287 results for “ACE”

ListGrid
What you seeeverything
RecentOldestAddedA–Z
All types1166Articles433Papers287Write-ups169Repos136Threads46
Advisories35Talks29Tools22Other5Courses3Videos1
📑 Papers“ACE”Clear all
arxiv.orgpaper🛡️ Security

TextSeal2: Distortion-Free LLM Watermarking with Copula Mixing and Memoryless Races

TextSeal2 is a distortion-free LLM text watermark that merges two or more keys into one virtual key and couples it to fresh noise through AutoMark's Gaussian copula. Under speculative decoding it verifies keyed drafts with an extra exponential race, so output matches the target model and acceptance rate is unchanged. On three LLMs at a 10^-3 false-positive rate, it detects 8 to 22 points more 100-token answers than TextSeal.

TextSeal2TextSealAutoMark+2
Gumbel-max schemespeculative decodingGaussian copula+1

AI Security· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

TextSeal2: Distortion-Free LLM Watermarking with Copula Mixing and Memoryless Races

TextSeal2 is a distortion-free watermark for LLM output that keeps its signal under speculative decoding. It merges two or more keys into one virtual key coupled to fresh noise through AutoMark's Gaussian copula, and verifies drafts with an extra exponential race. On three LLMs it detects 8 to 22 points more 100-token answers than TextSeal at a 10^-3 false-positive rate.

LLMspeculative decodingGumbel-max watermarking+1
TextSeal2TextSealAutoMark+2

research, inference· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

MAServeBench: Benchmarking Multi-Agent LLM Serving Systems with Hierarchical Collaboration Workloads

MAServeBench is a benchmark that treats multi-agent collaboration as a configurable dimension of LLM serving workloads. Its composable stages model how agents coordinate and exchange context in documented multi-agent workflows, and Hierarchical Semantic Traces record operations and dependencies for reproducible comparisons. Task-linked measurements tie workloads to GPU/NPU behavior, showing serving efficiency does not always mean timely task completion. Code is released.

LLM
MAServeBencharXiv

evals, inference, agents· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Beyond the Scope of This Paper: Practical Flash-Accelerator and Cache-Collision Timing Attacks on Microcontrollers

Colin O'Flynn's paper shows that the flash accelerator in most microcontrollers produces the same timing collisions as a cache, so cacheless Cortex-M devices remain open to cache-collision attacks on AES. AES keys were recovered from as few as 750 traces across six cryptographic libraries, eight architectures and over twenty devices. It also attacks SPI bootloaders, Ethernet, CTAP2 over USB and 802.15.4, and releases the open-source tool FlashWhisperer.

FlashWhispererARM Cortex-M4SPI+1
cache-collision timing attackColin O'FlynnCTAP2+2

Hardware & RF· Added 31 Oct 2026, published 29 Oct 2026

ethresear.chpaper🛡️ Security

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.

EthereumSafe
BybitEIP-712ERC-1271+5

Blockchain· Published and added 28 Oct 2026

eprint.iacr.orgpaper🛡️ Security

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.

Bitcoin
Shor's algorithmRSA-2048secp256k1+5

other· Published and added 28 Oct 2026

arxiv.orgpaper🧠 AI

When LLM Architectures Meet Smart Contract Vulnerability Detection: a Replication Study

This paper replicates Chen et al.'s study of LLM-based smart contract vulnerability detection, first on GPT-4 and then on Mixture-of-Experts, RNN-like and State Space Models. The exact replication confirms the high-recall, low-precision pattern on GPT-4. The differentiated replication finds the pattern does not transfer uniformly: GPT-4 and Gemma-3 behave alike despite a roughly 100x parameter gap, while two MoE models diverge.

LLMTransformerMixture of Experts+3
Chen et al.GPT-4Gemma 3+1

research, evals· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🛡️ Security

When LLM Architectures Meet Smart Contract Vulnerability Detection: a Replication Study

This arXiv paper (October 2026) replicates Chen et al.'s study of LLM-based smart contract vulnerability detection. It confirms the high-recall, low-precision pattern on GPT-4, then tests Mixture-of-Experts and RNN-like models plus a preliminary State Space Model run. Gemma-3 matches GPT-4's profile despite far fewer parameters, while two Mixture-of-Experts models diverge, so architecture family alone does not predict detection behavior.

GPT-4GemmaLLM
Chen et al.

AI Security, AppSec· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🧠 AI

FlatCake: A Flat KVCache Storage Architecture for LLM Serving

FlatCake is a KV cache storage architecture for LLM serving that treats host DRAM and NVMe SSD as peer media in one 64-bit address space, instead of a DRAM-over-SSD tier. Blocks are placed once, in session-contiguous, layer-major order, and streamed via GPUDirect Storage. On a Claude Code trace with DeepSeek-V4-Flash it holds a 94% hit rate (Mooncake: 64%) and cuts peak-load mean TTFT 1.6x.

GPUDirect StorageNVMe SSDLLM+3
FlatCakeMooncakeMooncake-GDS+3

inference, research· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🧠 AI

Improving the Dependency on Fine-Tuning Data in Transfer Learning for Speech Emotion Recognition

This paper proposes an fMLLR-based compensation mechanism that cuts the fine-tuning data needed in transfer learning for speech emotion recognition under train-test acoustic mismatch. An autoencoder reduces trainable parameters, and an affine transform in the encoder latent space models rotations and shifts. In a human-robot interaction task, mean CCC rose 16.8% with 12.9% of the training set and 14.4% with 50%.

fMLLRautoencoder
arXiv

research, multimodal, training· Added 30 Oct 2026, published 27 Oct 2026

eprint.iacr.orgpaper🛡️ Security

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.

FPGAASIC

Hardware & RF· Added 28 Oct 2026, published 27 Oct 2026

arxiv.orgpaper🧠 AI

EnvSched: Environment-Aware Scheduling for Rollout-Efficient Agent Reinforcement Learning

EnvSched is an online scheduler for agentic reinforcement learning that picks which environment-task pairs to roll out next. It builds a dual-relation graph over environments and tasks, propagates past rollout statistics to predict within-task reward variance, and adds environment quotas and a similarity penalty. On Qwen3-8B it scores 48.81 average on BFCL-v3, tau-Bench and ACEBench-Agent after 40 steps, above random selection at 120 steps.

Qwen3
BFCL-v3tau-BenchACEBench-Agent+1

training, agents, research· Added 28 Oct 2026, published 27 Oct 2026

arxiv.orgpaper🧠 AI

When Visual Evidence Is Insufficient: How Instructions, Post-Training, and Internal Activations Shape Refusal in Multimodal Language Models

This paper studies how multimodal LLMs refuse questions that an image cannot answer, using the MoHoBench benchmark on three MLLMs. It varies the meaning and placement of refusal instructions, compares supervised and preference-based post-training, and intervenes on a refusal-related activation direction. Instructions change refusal at the sample level in ways aggregate rates hide. Post-training raises refusal most but can mix refusal with attempted answers. Activation intervention gives smaller, transferable changes.

vision-language modelLLM
MoHoBencharXiv

ai-safety, multimodal, research· Added 28 Oct 2026, published 27 Oct 2026

eprint.iacr.orgpaper🛡️ Security

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.

ML-DSA
Fisher-Yates shuffleFIPS 204

Hardware & RF· Added 28 Oct 2026, published 27 Oct 2026

eprint.iacr.orgpaper🛡️ Security

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.

SMAUG-TSTM32F415
Poly2MsgLeakschosen-ciphertext attackpolynomial-to-message leakage+1

Hardware & RF· Added 28 Oct 2026, published 27 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Falcon Key Recovery from Joint Sampler Leakages

Falcon 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.

FalconFN-DSAARM Cortex-M4+1
SamplerZc-fn-dsasoftplus interval regression+1

Hardware & RF· Added 28 Oct 2026, published 27 Oct 2026

huggingface.copaper🧠 AI

Trial by Trace: Benchmarking AI Agent Harnesses for Reliability and Failure Attribution

TraceTrial-Bench is a benchmark that scores agent task performance and agent harness reliability separately. It has 95 mechanism-oriented tasks across seven components: context, execution, governance, lifecycle, observability, tools and verification. Across 4 harnesses, 9 models and 3,420 runs, macro-averaged harness scores range from 59.8% to 72.0%, and 31.1% of runs succeed despite failing at least one harness criterion.

LLMHugging Face
TraceTrial-Bench

evals, agents, research· Added 27 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Non-profiled Single-Trace ML-DSA Secret Key Recovery by Horizontal Distribution Analysis

Non-profiled single-trace side-channel attack on ML-DSA-65 (Dilithium) running on ARM Cortex-M4, by Linus Backlund and Elena Dubrova (KTH). It compares observed sample distributions with expected Hamming weight leakage using a Gaussian mixture model, and stacks partitioned trace segments for multiple observations. Information-set decoding corrects misclassifications; with a 2^70 enumeration budget, the full secret key is recovered from one trace in 99% of attacks, using secret key unpacking as the attack point.

ML-DSAARM Cortex-M4
Hamming weight leakagehorizontal attacknon-profiled attack+4

Hardware & RF· Published and added 26 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Subexponential Algorithms for LWE via Rejection Sampling on Superlattices

Subexponential Algorithms for LWE via Rejection Sampling on Superlattices is an ePrint paper by Ligeng Fan, Changpeng Shao, Hongbo Li and Dingkang Wang. It extends the Ducas, Engelberts and Loyer superlattice framework to give a provable classical search-LWE algorithm for prime q in [n^2, 2n^2], using m=4n samples and time and space exp(O(n/ln ln n)). A second variant runs in 2^((1/2+o(1))n/ln R) for general parameters. It resolves a gap left by Kirchner and Fouque.

Ducas, Engelberts and LoyerKirchner and FouqueBKW algorithm+1

other· Published and added 26 Oct 2026

arxiv.orgpaper🛡️ Security

Scope-Gap Injection: Exploiting Evaluator Channel Blind Spots in the OpenClaw Agent Security Competition

Scope-Gap Injection (SGI) is an indirect prompt injection method for multi-stage LLM-agent safety pipelines, tested in the IJCAI 2026 OpenClaw Agent Security Attack Competition. The visible task and skill stay benign while target identifiers, bypass parameters and authorization steps sit in an attachment written as a business worklist, which the S2 LLM judge appears not to inspect. SGI bypassed all three stages (static scan, LLM judge, live audit) for 5 of 19 targets, best F = 0.385. Attachment placement had 78% S2 acceptance versus 23% in-skill. The paper closes with defenses that align evaluator scope with agent channels.

OpenClawLLM
Scope-Gap Injectionindirect prompt injectionIJCAI 2026 OpenClaw Agent Security Attack Competition

AI Security· Added 27 Oct 2026, published 26 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Private Information Retrieval with Accountability at Erasure-Optimal Server Redundancy

SynTrace is a single-round compiler that adds accountability to linear private information retrieval (PIR). The client mixes the retrieval query with m audit queries, so audit syndromes identify up to d deviating servers among t colluding ones before reconstruction. The paper proves perfect query privacy and zero false identification within the threshold. For Shamir-based PIR it needs k=t+d+1 servers. For a 32 KiB record from a 1 GiB database it uses 2.25 MiB, against 8.96 MiB for the Eriguchi, Kurosawa and Nuida (TCC 2022) homomorphic-MAC construction.

SynTraceEriguchi-Kurosawa-Nuida homomorphic MACTCC 2022

other· Published and added 26 Oct 2026

arxiv.orgpaper🛡️ Security

SymLift: Neural Semantic Lifting for Compile-Free Vulnerability Detection in Context-Incomplete Code Fragments

SymLift is a compile-free vulnerability detection framework for context-incomplete code fragments. A fine-tuned LLM lifts control-flow, data-flow, memory and resource relations into a constrained LLVM-like IR. A parser turns the IR into facts, and Datalog rules derive findings with derivation traces. On Juliet function-level fragments Clang compilation success falls to 12.00%, while SymLift's completion rate drops only 1.17 points. SymLift-Qwen-7B reaches Target-F1 94.41% on FormAI and 91.66% micro-F1 on MegaVul.

LLMQwenLLVM+2
SymLiftFormAIJuliet+2

AppSec, AI Security· Added 28 Oct 2026, published 25 Oct 2026

arxiv.orgpaper🧠 AI

SymLift: Neural Semantic Lifting for Compile-Free Vulnerability Detection in Context-Incomplete Code Fragments

SymLift is a compile-free vulnerability detection framework for code fragments that lack project context. A fine-tuned LLM reconstructs control-flow, data-flow, memory and resource relations as a constrained LLVM-like IR, and a deterministic parser turns it into facts for Datalog rules that give findings with derivation traces. SymLift-Qwen-7B reaches 94.41% Target-F1 on FormAI and 91.66% micro-averaged Target-F1 on MegaVul.

LLMQwenDatalog+3
SymLiftSymLift-Qwen-7BFormAI+2

research, training· Added 28 Oct 2026, published 25 Oct 2026

arxiv.orgpaper🧠 AI

Detecting and Understanding Ambiguity in Visualizations with Role-Playing Vision Language Model Interpretations

This paper presents a pipeline that uses persona-conditioned vision language models to surface interpretive ambiguity in visualizations. Topic-relevant personas elicit candidate takeaways, and a Target-Pattern-Scope framework lets LLM judges label statement pairs as Compatible, Disjoint or Opposing, which are summarized in an ambiguity profile. The authors benchmark VLMs on chart comprehension per chart type, check labeling against human annotations, and run case studies on public visualizations and a redesign.

vision-language modelLLM
arXiv

research, multimodal, evals· Added 27 Oct 2026, published 25 Oct 2026

arxiv.orgpaper🧠 AI

HerHealthGPT: An Evidence-Grounded Conversational AI System for Women's Reproductive Health Copy title

HerHealthGPT is a conversational AI system for women's reproductive health that combines retrieval-augmented generation, context-aware clarification and source validation in a web interface. Evidence retrieval raises concern-category accuracy from 54.1% to 59.3% over fine-tuning alone on 540 messages from 90 cases. The clarification router reaches 85.6% recall and 86.2% specificity. In a 30-adult study, 83.3% preferred the retrieval-enabled version. The authors say clinical validation is still needed.

RAGLLM
HerHealthGPTarXiv

research, llm-apps· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

Build, Don't Play: Self-Improving LLM Research Agents Develop a Hearthstone Battlegrounds AI That Rivals Top Players

AutoTavern is a self-improving system of specialised LLM research agents with a typed shared memory and verification gates. In 20 days it built TavernGym, a full-content Hearthstone Battlegrounds simulator, and 23 versions of TavernAgent, a PPO-trained player. TavernAgent averaged placement 1.60 with 80% first places over its last 20 live games, beating the top ten players (2.34, 59%). On TavernBench (960 tasks), it answered 91% of play tasks against at most 63% for frontier LLMs.

PPOLLM
AutoTavernTavernGymTavernAgent+3

agents, research, training, evals· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

Unlocking the Specialization Capability of PPG Foundation Models for Wearable Signals through Structured Pruning and Adaptive Fine-Tuning

SPAFT is a structured prune-then-finetune framework for PPG (photoplethysmography) foundation models used on wearable signals. It finds that pretrained PPG models have inherent sparsity and redundancy, then restricts fine-tuning to a compact parameter subspace chosen by parameter importance and structural redundancy. Across four PPG foundation models, five datasets and ten tasks, it wins 82.8% of regression and 87.5% of classification comparisons.

SPAFTarXiv

research, training· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

DualPace: Decoupled Scheduling and Cooperative GPU--CPU Decoding for LLM Serving

DualPace is an LLM serving runtime that treats the host as an independently scheduled decode engine. A GPU engine runs prefills and GPU-resident decodes, while an AMX-enabled CPU engine batches and advances CPU-resident decodes, optionally calling GPU Dense Assist for dense stages. In decode-oriented scenarios it raises throughput 6.9 to 43.2% over NEO and 11.5 to 90.6% over vLLM at similar latency.

vLLMNEOIntel AMX+1
DualPacearXiv

inference, research· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

Small Edits, Shifting Decisions: Benchmarking LLM Accuracy and Reliability on French Input Variants

This paper builds a controlled French surface-variant benchmark with seven task types and 4,200 original-low-high triplets (12,600 inputs), covering missing apostrophes and diacritics and keyboard typos. Six models from two LLM families lose accuracy and show worse Brier score and NLL as perturbation grows. Keyboard typos hurt most. Calibration temperatures fitted on original inputs transfer to variants, and combining them with input restoration improves reliability further.

LLM
arXiv

evals, research· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

AI Alignment for Digital Democracy: Fairer Voters Representation against LLM Biases

This paper studies demographic bias in LLM-emulated electorates, using three U.S. presidential elections and comparing one closed-source and one open-source LLM. Removing gender from the voter profile cuts the largest group error by 22-42%, and removing education cuts it by 64%. Removing self-reported race raises mean group error by over 40%. Repeated queries and fairness instructions do not reduce errors and can double them.

LLM
arXiv

research, ai-safety, evals· Added 27 Oct 2026, published 23 Oct 2026

Showing 30 of 287

Show more