1066 search results - page 37 / 214 » Computing Private Set Operations with Linear Complexities |
70
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
108
click to vote
CODASPY
2011
14 years 1 months ago
2011
—Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users’ personal schedules. Users also access popular contextbase...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...