The local leakage-resilience conjecture for Massey schemes

Let CC be an MDS code over a prime field Fp\mathbb{F}_p, and let the Massey scheme be the secret-sharing scheme defined by CC. A scheme is one-bit local leakage resilient if it remains secure when each participant reveals one bit of locally computed leakage; its rate is the ratio of the secret length to the total share length. The local leakage-resilience conjecture. The Massey scheme defined with CC is one-bit local leakage resilient for any positive rate. This conjecture is the main conjecture in local leakage resilience and was first stated for Shamir's scheme. The supplied text gives no resolution status for the prime-field statement, so its status is recorded as open.

Sources & referencesView supporting material

Primary source

Yihang Sun and Mary Wootters, “On Worst-Case Optimal Polynomial Intersection”, arXiv:2604.09533 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.