321 search results - page 17 / 65 » Secure Multiparty Computation of Approximations |
CRYPTO
2012
Springer
12 years 26 days ago
2012
Springer
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
CTRSA
2009
Springer
14 years 5 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...
STOC
2000
ACM
14 years 2 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...
CSE
2009
IEEE
14 years 5 months ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
CANS
2008
Springer
14 years 12 days ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...