562 search results - page 7 / 113 » Secure Multiparty Computation with General Interaction Patte... |
143
Voted
CRYPTO
2007
Springer
15 years 10 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...
128
Voted
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
145
Voted
CRYPTO
2012
Springer
13 years 6 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...
124
click to vote
CTRSA
2006
Springer
15 years 7 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
122
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...