Backend






Functional Converses for Private Matrix-Product Retrieval under Library-Wide Decoder-Side Correlation
arXiv math.IT0 views
arXiv:2611.07325v1 Announce Type: new Abstract: We consider private retrieval of the matrix product $A^\top B^{(\theta)}$ from replicated $P_c$-colluding servers when $B^{(\ell)}=A+N^{(\ell)}$, with the innovations mutually independent and independent of the user-held $A\in\mathbb{F}_q^{m\times m}$. The servers store the full library, correlated with $A$, which changes both the communication problem and the security definition: a secrecy condition including the stored library cannot hold, as the library itself partly reveals $A$. We therefore measure only additional leakage and require index privacy conditioned on $A$; both reduce to classical notions under independence. For $A$ of rank $kSource:https://arxiv.org/abs/2611.07325
PreviousLossless Source Coding with Marginal Distribution ConstraintNextEnergy-Time Optimal Decoding Using Expander-Graph LDPC Codes and Mesh Network Architecture
Related posts
Cargo formater command not working for me
0Rust Users Forum
Automake 1.20 Brings New Features, Desires To Re-Establish GNU As Leading Build System
0Phoronix
Catch secrets before they reach git: a pre-commit check for Node repos
0dev.to
One codebase, two renderers: live previews in the browser, final renders in the cloud
0dev.to
Controversy Gate Second Model Check
0dev.to

RabbitMQ's Default Prefetch Is Unlimited. One Slow Worker Can Hoard the Whole Queue
0dev.to
show = false, 2600)"
x-show="show" x-cloak x-transition.opacity.duration.200ms
class="fixed bottom-8 left-1/2 z-[80] -translate-x-1/2 rounded-lg border border-line bg-card px-4 py-2.5 text-sm text-heading shadow-card-hover"
role="status" aria-live="polite">