80 search results - page 6 / 16 » Zero-knowledge from secure multiparty computation |
HICSS
2009
IEEE
14 years 5 months ago
2009
IEEE
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
ESORICS
2010
Springer
13 years 10 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
IACR
2011
12 years 10 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...