scholarly journals Square Span Programs with Applications to Succinct NIZK Arguments

Author(s):  
George Danezis ◽  
Cédric Fournet ◽  
Jens Groth ◽  
Markulf Kohlweiss
Keyword(s):  



Author(s):  
Ventzislav Nikov ◽  
Svetla Nikova ◽  
Bart Preneel




Author(s):  
Robert Robere ◽  
Toniann Pitassi ◽  
Benjamin Rossman ◽  
Stephen A. Cook


1994 ◽  
Vol 1 (46) ◽  
Author(s):  
Amos Beimel

The model of span programs is a linear algebraic model of computation. Lower bounds for span programs imply lower bounds for contact schemes, symmetric branching programs and for formula size. Monotone span programs correspond also to linear secret-sharing schemes. We present a new technique for proving lower bounds for monotone span programs. The main result proved here yields quadratic lower bounds for the size of monotone span programs, improving on the largest previously known bounds for explicit functions. The bound is asymptotically tight for the function corresponding to a class of 4-cliques.



Author(s):  
Stasys Jukna
Keyword(s):  




2014 ◽  
Vol 43 (3) ◽  
pp. 1206-1219 ◽  
Author(s):  
Ben W. Reichardt




2005 ◽  
Vol 34 (5) ◽  
pp. 1196-1215 ◽  
Author(s):  
Amos Beimel ◽  
Enav Weinreb


Sign in / Sign up

Export Citation Format

Share Document