Abstract
We prove that for every n and 1 < t < n any t-out-of-n threshold secret sharing scheme for one-bit secrets requires share size log(t + 1). Our b......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
