Backend
Optimal Additive Integer Masks for One-Guess Vulnerability under an Absolute-Moment Budget
arXiv math.IT0 views
arXiv:2611.16066v2 Announce Type: replace Abstract: We study the average one-guess success probability of an adversary who observes the ordinary integer sum of a finite-support secret and an independent integer-valued mask, subject to an absolute-moment budget on the mask. For a uniform secret on an interval the exact optimum and an explicit optimiser are obtained. For a biased bit the masks that achieve no increase over the prior baseline are characterised, and the entire cost--vulnerability frontier is determined. It is the piecewise-linear interpolation of an explicit sequence of points generated by cost-optimally shifted truncated geometric masks. It has infinitely many affine pieces, which accumulate at the critical cost, where the frontier meets the prior baseline with zero slope. The proof rests on a layer-cake decomposition of an arbitrary mask into truncated geometrics, along which both the vulnerability and the cost are exactly additive. The results give exact design guidance for additive integer noise under the average one-guess metric.
Source:https://arxiv.org/abs/2611.16066PreviousHarnessing Mutual Coupling in Cell-Free mMIMONextA response-adaptive multi-arm design for continuous endpoints based on a weighted information measure
Related posts

Analysing Agentic Hack Bots with AWS: Telemetry, Deception and Behavioural Fingerprinting.
0dev.to AWS
Bootcamp GFT: Fundamentos de Cloud com AWS
0dev.to AWS
Turning On ECR Tag Immutability Breaks Pipelines That Re-Push the latest Tag
0dev.to AWS

Middy middleware for AWS Lambda in TypeScript
0dev.to AWS
What Happens When Your Website Gets More Visitors Than Your Server Can Handle?
0dev.to WebDev
Why 0.1 + 0.2 breaks money calculators (and what to do instead)
0dev.to WebDev