Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the size of monotone span programs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Communication efficient secure linear algebra
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.01 |
Monotone span programs are a linear-algebraic model of computation. They are equivalent to linear secret sharing schemes and have various applications in cryptography and complexity. A fundamental question is how the choice of the field in which the algebraic operations areperformed effects the power of the span program. In this paper we prove that the power of monotone span programs over finite fields of different characteristics is incomparable; we show a super-polynomial separation between any two fields with different characteristics, answering an open problem of Pudlák and Sgall 1998. Using this result we prove a super-polynomial lower bound for monotone span programs for a function in unifrom-NC2 (and therefore in P), answering an open problem of Babai, Wigderson, and Gál 1999. (All previous lower bounds for monotone span programs were for functions not known to be in P.) Finally, we show that quasi-linear schemes, a generalization of linear secret sharing schemes introduced in Beimel and Ishai 2001, are stronger than linear secret sharing schemes. In particular, this proves, without any assumptions, that non-linear secret sharing schemes are more efficient than linear secret sharing schemes.