38 search results - page 4 / 8 » Construction of very hard functions for multiparty communica... |
STOC
2010
ACM
14 years 15 days ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
PKC
2007
Springer
14 years 1 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...
P2P
2008
IEEE
14 years 2 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
CTRSA
2009
Springer
14 years 2 months ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...