On the size of monotone span programs

Lecture Notes in Computer Science

Volumn 3352, Issue , 2005, Pages 249-262

  Nikov, Ventzislav ^a   Nikova, Svetla ^b   Preneel, Bart ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; MATHEMATICAL MODELS;

MONOTONE SPAN PROGRAMS (MSP); PROGRAM CONSTRUCTION; SECRET SHARING SCHEME;

SECURITY OF DATA;

EID: 23944508637     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30598-9_18     Document Type: Conference Paper

References (18)

1. E. Allender, R. Beals, M. Ogihara, The Complexity of Matrix Rank and Feasible Systems of Linear Equations, ACM STOC'96, 1996, pp. 161-167.
2. A. Beimel, Secure Schemes for Secret Sharing and Key Distribution, Ph.D. Thesis, Technion, 1996.
3. A. Beimel, A. Gal, M. Paterson, Lower Bounds for Monotone Span Programs, Computational Complexity, 6, 1996/1997, pp. 29-45.
4. A. Beimel, E. Weinreb, Separating the Power of Monotone Span Programs over Different Fields, FOCS'03, 2003, pp. 428-437.
5. L. Babai, A. Gal, A. Wigderson, Superpolynomial Lower Bounds for Monotone Span Programs, Combinatorica 19 (3), 1999, pp. 301-319.
6. E. Brickell, Some Ideal Secret Sharing Schemes, J. of Comb. Math. and Comb. Computing 9, 1989, pp. 105-113.
7. G. Buntrock, C. Damm, H. Hertrampf, C. Meinel, Structure and Importance of the Logspace-mod Class, Math. Systems Theory 25, 1992, pp. 223-237.
8. R. Gramer, I. Damgard, U. Maurer, General Secure Multi-Party Computation from any Linear Secret Sharing Scheme, EUROCRYPT'2000, Springer-Verlag LNCS 1807, 2000, pp. 316-334.
9. R. Cramer, S. Fehr, Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups, CRYPTO 2002, Springer-Verlag LNCS 2442, 2002, pp. 272-287.
10. M. van Dijk, Secret Key Sharing and Secret Key Generation, Ph.D. Thesis, 1997, TU Eindhoven.
11. A. Gal, Combinatorial Methods in Boolean Functions Complexity, Ph.D. Thesis, Chicago, Illinois, 1995.
12. A. Gal, A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs, Computational Complexity, Vol. 10, No. 4, 2001, pp. 277-296.
13. A. Gal, P. Pudlak, Monotone Complexity and the Rank of Matrices, Inform. Proc. Lett. 87, 2003, pp. 321-326.
14. M. Karchmer, A. Wigderson, On Span Programs, Proc. of 8-th Annual Structure in Complexity Theory Conference, 1993, IEEE Computer Society Press, pp. 102-111.
15. V. Nikov, S. Nikova, B. Preneel, J. Vandewalle, Applying General Access Structure to Metering Schemes, WCC 2003, Cryptology ePrint Archive: Report 2002/102.
16. V. Nikov, S. Nikova, B. Preneel, Upper Bound for the Size of Monotone Span Programs, ISIT 2003, 2003, pp. 284.
17. P. Pudlak, J. Sgall, Algebraic Models of Computations and Interpolation for Algebraic Proof Systems, Proof Complexity and Feasible Arithmetic, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 39, 1998, pp. 279-295.
18. A. Shamir, How to Share a Secret, Commun. ACM, 22, 1979, pp. 612-613.