5484 search results - page 187 / 1097 » Almost-Everywhere Secure Computation |
142
click to vote
WIKIS
2009
ACM
15 years 11 months ago
2009
ACM
Suffr uses Wiki to facilitate corporate governance. Suffr allows a group's members to administer a computer system and its information resources collectively. Categories and ...
140
click to vote
ASIACRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
150
click to vote
NIXDORF
1992
15 years 8 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
121
click to vote
JPDC
2006
15 years 4 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
134
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
This work studies the security of ten popular package managers. These package managers use different security mechanisms that provide varying levels of usability and resilience to...