5606 search results - page 312 / 1122 » Randomization Techniques for Graphs. |
142
click to vote
CHES
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in critical operations such as modular exponentiati...
170
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
189
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
270
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
A major trend in a modern system-on-chip design is a growing system complexity, which results in a sharp increase of communication traffic on the on-chip communication bus architec...
158
click to vote
VMV
2008
15 years 8 months ago
2008
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...