Sciweavers

315 search results - page 11 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 1 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
ICCI
1993
15 years 1 months ago
Interval-Set Algebra for Qualitative Knowledge Representation
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
Y. Y. Yao
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 11 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
DCC
2000
IEEE
14 years 9 months ago
Relating Differential Distribution Tables to Other Properties of of Substitution Boxes
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
Xian-Mo Zhang, Yuliang Zheng, Hideki Imai
TAMC
2010
Springer
15 years 2 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret