Joint work with: Peihan Miao (UC Berkeley, USA), Akshayaram Srinivasan (UC Berkeley, USA).

Partial abstract. In this work, we present local leakage resilient threshold secret sharing schemes with constant rate for any threshold. Furthermore, our scheme has optimal leakage-resilience rate, i.e., the ratio between the leakage tolerated and the size of each share can be made arbitrarily close to 1. We implement a variant of our scheme (that has worse rate and leakage-resilience rate, but better computational efficiency), and present comparisons of its performance to that of Shamir’s secret sharing scheme (Shamir, Commun. ACM 1979). Our construction generalizes to a rate-preserving compiler that adds local leakage-resilience to any secret sharing scheme for any monotone access structure.

(Click the above image to see video on Youtube)