Search arXiv⌕ Search

arXiv · 2610.32685

Identity Amortization: Shared Resources and the Cost of Sybil Attacks

Abstract

Sybil defenses commonly price identities by requiring a resource for each one. When one resource can support several identities, an adversary can pay less per identity than the defense intends. We call this identity amortization: a strict reduction in the minimum cost of provisioning identities when resources may be shared, relative to provisioning each one independently. It is a second route to the gap that a Sybil attack exploits. When influence is assigned per identity, a defense calibrated to the nominal price can overestimate the cost of a Sybil threshold by up to the number of identities one resource supports. For any resource catalogue, we give exact tests for when identity amortization occurs, where it begins, and its largest error; a sharing cap below the onset removes it. Because the tests need only prices and capacities, they apply to any defense that admits identities against a shareable resource, telling designers whether the assumed per-identity cost is paid, how wrong it can be, and which intervention restores it most cheaply for honest participants. On published phone-verification prices, per-account estimates overstate provisioning cost 1.6 to 4.3 times; Tor's raised per-address relay limit cut modeled attack cost by 8 to 72%, depending on the address-to-relay price ratio.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Homayoun Maleki, Nekane Sainz, Jon Legarda, Igor Santos-Grueiro. 2026-10-23. Identity Amortization: Shared Resources and the Cost of Sybil Attacks. https://arxiv.org/abs/2610.32685

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

TensorCommitments: A Lightweight Verifiable Inference for Large Language Models

Most large language models (LLMs) run on external clouds: users send a prompt, pay for inference, and must trust that the remote GPU executes the LLM without any adversarial tampering. We critically ask how to achieve verifiable LLM inference, where a prover (the service) must convince a verifier (the client) that an inference was run correctly without rerunning the LLM. Existing cryptographic works are too slow at the LLM scale, while non-cryptographic ones require a strong verifier GPU. We propose TensorCommitments (TCs), a tensor-native proof-of-inference scheme. TC binds the LLM inference to a commitment, an irreversible tag that breaks under tampering, organized in our multivariate Terkle Trees. For LLaMA2, TC adds only 0.97% prover and 0.12% verifier time over inference while improving robustness to tailored attacks by up to 48\% over the best prior work requiring a verifier GPU.

cs.CR↗

Differential Fault Analysis of Lilliput under Random-Location Nibble Faults

Lilliput is a lightweight block cipher based on a Type-2 Extended Generalized Feistel Network (EGFN). Although it has been studied under conventional cryptanalytic techniques, its resistance to fault attacks remains largely unexplored. We present a theoretical differential fault analysis of Lilliput under a random-location nibble fault model. A nonzero nibble fault is injected at the input to round 27, with the injection location uniformly distributed among the 16 state branches and unknown to the adversary. We analyze fault propagation through the EGFN and derive ciphertext-difference conditions to identify the faulty branch. A DDT-weighted calculation yields an overall branch-identification accuracy of approximately 99.9980% under independent uniform sampling of plaintexts, nonzero fault values, and fault locations; simulations of 2^20 random faults give 99.9983%. After identifying the faulty branch, we classify propagation patterns using the injected difference and the intermediate S-box output difference. We then derive DDT-based constraints on last-round and penultimate-round subkeys and intersect candidate sets from multiple faulty ciphertexts. In 2^15 simulation trials, key-recovery success rates exceed 90%, 95%, and 99% with 32, 36, and 46 faulty ciphertexts, respectively. These simulation-based results are not claims of physical fault-injection performance but offer insight into practical fault analysis of Lilliput.

cs.CR↗

WebAgentGuard: A Reasoning-Driven Guard Model for Detecting Prompt Injection Attacks in Web Agents

Web agents powered by vision-language models (VLMs) enable autonomous interaction with web environments by perceiving and acting on both visual and textual webpage content to accomplish user-specified tasks. However, they are highly vulnerable to prompt injection attacks, where adversarial instructions embedded in HTML or rendered screenshots can manipulate agent behavior and lead to harmful outcomes such as information leakage. Existing defenses, including system prompt defenses and direct fine-tuning of agents, have shown limited effectiveness. To address this issue, we propose a defense framework in which a web agent operates in parallel with a dedicated guard agent, decoupling prompt injection detection from the agent's own reasoning. Building on this framework, we introduce WebAgentGuard, a reasoning-driven, multimodal guard model for prompt injection detection. We construct a synthetic multimodal dataset using GPT-5 spanning 164 topics and 230 visual and UI design styles, and train the model via reasoning-intensive supervised fine-tuning followed by reinforcement learning. Experiments across multiple benchmarks show that WebAgentGuard consistently outperforms strong baselines while preserving agent utility, without introducing additional latency.

cs.CR↗