11740 search results - page 2105 / 2348 » More Problems in Rewriting |
133
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Large screen displays require new interaction techniques because of their physical size. Even though there are technologies that tackle the problem of interaction with such device...
184
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore process...
173
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
196
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
185
click to vote
PKC
2009
Springer
16 years 7 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...