111 search results - page 5 / 23 » Characterization of Secure Multiparty Computation Without Br... |
111
Voted
IEEEARES
2007
IEEE
15 years 7 months ago
2007
IEEE
In [7] we have proposed a model for the robust and private evaluation of a function within a group of cooperating mobile agents, called an agent Alliance. The model has been given...
PKC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
138
click to vote
STOC
2000
ACM
15 years 4 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
110
Voted
P2P
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
115
click to vote
CCS
2008
ACM
15 years 2 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...