筛选条件
共查询到2条结果
排序方式
~
Threshold Secret Sharing Requires a Linear-Size Alphabet
期刊: THEORY OF COMPUTING, 2020; 16 ()
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......
Testing k-Monotonicity The Rise and Fall of Boolean Functions
期刊: THEORY OF COMPUTING, 2019; 15 ()
A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. ......