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
Autoscaling Adds Waiters, Not Ovens. Here's What Actually Breaks at 10x Load
0dev.to
[백엔드 모의면접] 중복 결제는 어떻게 막을까?
0dev.to
Server-Side Pagination Looked Easy. It Took Me Longer Than Any React Concept Yet.
0dev.to
Before You Create an AWS Account, Spend 45 Minutes Learning These Security Tools
0dev.to
Claude “Invalid Signature” in a Thinking Block: How to Debug It Safely
0dev.to
How to catch an expiring or broken SSL certificate before your visitors do
0dev.to