Determine the correct rate threshold for one-bit local leakage resilience
Determine the smallest rate threshold R^* such that every Shamir secret-sharing scheme over a prime field with rate at least R^* is one-bit locally leakage resilient, and establish whether the conjectured threshold can be an arbitrarily small positive constant.
References
What is the ``correct'' rate threshold for LLR for Shamir schemes? That is, what is the smallest $R*$ so that any Shamir scheme with rate at least $R*$ is one-bit LLR? A conjecture of posits that $R*$ can be an arbitrarily small constant; we have shown that $R*$ can be less than $1/2$, but there is a long way to go.
The full BDIR conjecture remains open, in particular at threshold rate 1/3.
At smaller thresholds, Nielsen and Simkin give an inefficient one-bit leakage attack when k is of order $n /\log p$, which is n/\log n when p=poly(n). Closing this gap remains an open problem.
The intermediate range is open.