Attributed metadata history
Up to 100 retained publisher events per page for 6147fe82c5b391a93473405d98e95ef2f7081511760810029ee4075c97a0d731. Withdrawals and unavailable references remain attributed to their publishers.
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:04 UTC
ePrint Report: The Geometry of Collusion Leakage in Inner-Product Functional Encryption Ferdinando Zullo Inner-product functional encryption (IPFE) allows the holder of a functional key for a vector $y$ to learn $\langle x,y\rangle$ from an encryption of $x$, and nothing more. Keys, however, accumulate: a coalition holding sufficiently many independent keys recovers the plaintext. We model each institution by the span $W_i\leq\F_q^n$ of its authorized key vectors and show that a coalition $I$ determines the plaintext exactly modulo $(\sum_{i\in I}W_i)^\perp$; for a uniform plaintext it learns exactly $\dim\sum_{i\in I}W_i$ field symbols. The resulting leakage function is a representable and entropic polymatroid. We then study authorization spaces of dimension $r$ whose pairwise intersections have dimension at most $h$. We prove that some coalition of size $c\geq2$ always learns at least $\min\{n,2r-h+c-2\}$ dimensions, and we give a Vandermonde-type construction in which every coalition of size $c$ learns exactly this amount, for all $c$ simultaneously. Hence the largest achievable reconstruction thr
Fingerprint: b05bf3e64b14a28932d30b9e56074cd5b780d383024c152ddbf3965f1aec87fe
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:03 UTC
available
Fingerprint: 366cb966e32414edc1db353849a1ee8d6b8462b83786e04001881ba6594765ad