91 search results - page 10 / 19 » Multiparty Communication Complexity of Disjointness |
240
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
125
Voted
CRYPTO
2012
Springer
13 years 4 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
92
Voted
PKC
2007
Springer
15 years 8 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
121
Voted
CRYPTO
2007
Springer
15 years 8 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...
106
click to vote
LREC
2010
15 years 3 months ago
2010
In this paper, we describe our experience with collecting and creating an annotated corpus of multi-party online conversations in a chat-room environment. This effort is part of a...