96 search results - page 11 / 20 » Covert Multi-Party Computation |
167
Voted
CCS
2009
ACM
16 years 4 days ago
2009
ACM
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
168
click to vote
CRYPTO
2007
Springer
15 years 11 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...
164
Voted
EUROCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
145
Voted
JOC
2010
15 years 4 days ago
2010
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
150
click to vote
DSN
2008
IEEE
15 years 11 months ago
2008
IEEE
Exploiting packets’ timing information for covert communication in the Internet has been explored by several network timing channels and watermarking schemes. Several of them em...