Upper bound for the size of monotone span programs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 284-

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

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; DATA ACQUISITION; DATA STRUCTURES; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; SET THEORY; THEOREM PROVING;

ACCESS STRUCTURE; LINEAR SECRET SHARING SCHEME; MONOTONE SPAN PROGRAMS; SECRET SHARING SCHEMES;

SECURITY OF DATA;

EID: 0142008281     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228299     Document Type: Conference Paper

References (4)

1. R. Cramer, S. Fehr, Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups, Proc. CRYPTO 2002, LNCS, Springer-Verlag, vol. 2442, pp. 272-287.
2. M. van Dijk, Secret Key Sharing and Secret Key Generation, Ph.D. Thesis, 1997, TU Eindhoven.
3. L. Babai, A. Gal, A. Wigderson, Superpolynomial Lower Bounds for Monotone Span Programs, 28th ACM STOC 96.
4. M. Karchmer, A. Wigderson, On Span Programs, Proc. of 8th Annual Structure in Complexity Theory Conference, San Diego, California, 18-21 May 1993, IEEE Computer Society Press, pp. 102-111.