On the Size of Monotone Span Programs

Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties of monotone span programs related to their size. Using the results of van Dijk (connecting codes and MSPs) and a construction for a dual monotone span program proposed by Cramer and Fehr we prove a non-trivial upper bound for the size of monotone span programs. By combining the concept of critical families with the dual monotone span program construction of Cramer and Fehr we improve the known lower bound with a constant factor, showing that the lower bound for the size of monotone span programs should be approximately twice as large. Finally, we extend the result of van Dijk showing that for any MSP there exists a dual MSP such that the corresponding codes are dual.

[1]  Anna Gál,et al.  Lower bounds for monotone span programs , 2005, computational complexity.

[2]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[3]  Anna Gál.  A characterization of span program size and improved lower bounds for monotone span programs , 1998, STOC '98.

[4]  Pavel Pudlák,et al.  A note on monotone complexity and the rank of matrices , 2003, Inf. Process. Lett..

[5]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[6]  Christoph Meinel,et al.  Structure and importance of logspace-MOD class , 1992, Mathematical systems theory.

[7]  Anna Gál,et al.  Combinatorial methods in boolean function complexity , 1995 .

[8]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[9]  R. Cramer,et al.  Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002 .

[10]  Jirí Sgall,et al.  Algebraic models of computation and interpolation for algebraic proof systems , 1996, Proof Complexity and Feasible Arithmetics.

[11]  Eric Allender,et al.  The complexity of matrix rank and feasible systems of linear equations , 1996, STOC '96.

[12]  Eric Allender,et al.  The complexity of matrix rank and feasible systems of linear equations , 1999, computational complexity.

[13]  B. Preneel,et al.  Upper bound for the size of monotone span programs , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[14]  Joos Vandewalle,et al.  Applying General Access Structure to Metering Schemes , 2002, IACR Cryptol. ePrint Arch..

[15]  van Me Marten Dijk.  Secret key sharing and secret key generation , 1997 .

[16]  Pavel Pudlák.  Monotone complexity and the rank of matrices , 2002, Electron. Colloquium Comput. Complex..

[17]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

[18]  Enav Weinreb,et al.  Separating the power of monotone span programs over different fields , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[19]  Avi Wigderson,et al.  Superpolynomial Lower Bounds for Monotone Span Programs , 1996, Comb..