12194 search results - page 2275 / 2439 » Numberings Optimal for Learning |
152
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES-128 circuit in three different ways. One variant takes und...
158
click to vote
ISSTA
2012
ACM
13 years 7 months ago
2012
ACM
Over the last decade, there has been a significant increase in the number and sophistication of malware-related attacks and infections. Many detection techniques have been propos...
176
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
149
click to vote
EUROCRYPT
2012
Springer
13 years 7 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
158
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...