Separating the power of monotone span programs over different fields

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 428-437

  Beimel, Amos ^a   Weinreb, Enav ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CRYPTOGRAPHY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; VECTORS;

MONOTONE SPAN PROGRAMS; SUPER POLYNOMIAL SEPARATION;

COMPUTATIONAL COMPLEXITY;

EID: 0345412672     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. G. Buntrock, C. Damm, U. Hertrampf, and C. Meinel. Structure and importance of the logspace-mod class. Math. Systems Theory, 25:223-237, 1992.
2. S. J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett., 18:147-150, 1984.
3. L. Babai and P. Frankl. Linear Algebra Methods in Combinatorics. University of Chicago, 1992. Preliminary Version 2.
4. A. Beimel, A. Gál, and M. Paterson. Lower bounds for monotone span programs. Computational Complexity, 6(1):29-45, 1997.
5. L. Babai, A. Gál, and A. Wigderson. Superpolynomial lower bounds for monotone span programs. Combinatorica, 19(3):301-319, 1999.
6. E. Ben-Sasson and R. Impagliazzo. Random CNF's are Hard for the Polynomial Calculus. In 40th FOCS, pages 415-421, 1999.
7. A. Beimel and Y. Ishai. On the power of nonlinear secret-sharing. In Conf. on Computational Complexity, pages 188 - 202, 2001.
8. G. R. Blakley. Safeguarding cryptographic keys. In Proc. of the 1979 AFIPS National Computer Conference, volume 48 of AFIPS Conference proceedings, pages 313-317 AFIPS Press, 1979.
9. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines. Bulletin of the AMS (new series), 21, (1);1-46, 1989.
10. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 316-334. Springer, 2000.
11. C. Damm, M. Krause, C. Meinel, and S. Waack. On relations between counting communication complexity classes. J. of Computer and System Sciences, 2003. To appear. Prelimenary version: STACS '92.
12. A. Gál. A characterization of span program size and improved lower bounds for monotone span programs. In 30th STOC, pages 429-437, 1998.
13. C. Godsil and G. Royle. Algebraic Graph Theory, volume 207 of Graduate Texts in Mathematics. Springer, 2001.
14. M. Ito, A. Saito, and T. Nishizeki Secret sharing schemes realizing general access structure. In Proc. of the IEEE Global Telecommunication Conf., Globecom 87, pages 99-102, 1987 Journal version: Multiple Assignment Scheme for Sharing Secret. J. of Cryptology, 6(1):15-20, 1993.
15. S. Jukna Extremal Combinatorics with Applications in Computer Science. Texts in Theoretical Comp. Sci. Springer-Verlag, 2001.
16. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge Univ. Press, 1997.
17. M. Karchmer and A. Wigderson. On span programs. In Proc. of the 8th Structure in Complexity Theory, pages 102-111, 1993.
18. K. Mehlhorn and E. M. Schmidt Las vegas is better than determinism in vlsi and distributed computing. In Proc. of the 14th STOC, pages 330-337, 1982.
19. K. Mulmuley A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica, 7:101-104, 1987.
20. M. Naor, B. Pinkas, and O. Reingold Distributed pseudo-random functions and KDCs. LNCS, 1592:327-337, 1999.
21. P. Pudlák and J. Sgall Algebraic models of computation and interpolation for algebraic proof systems. In Proof Complexity and Feasible Arithmetic, volume 39 of DIMACS Series in Discrete Mathematics and Theor. Comp. Sci., pages 279-296, AMS, 1998.
22. A. A. Razborov. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica, 10(1):81-93, 1990.
23. A. Shamir How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
24. G. J. Simmons. An introduction to shared secret and/or shared control and their application. In G. J. Simmons, editor, Contemporary Cryptology, The Science of Information Integrity, pages 441-497 IEEE Press, 1992.
25. R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proceedings of the 19th STOC, pages 77-82, 1987.
26. D. R. Stinson An explication of secret sharing schemes. Designs, Codes and Cryptography, 2:357-390, 1992.