62 search results - page 2 / 13 » Multiparty Computation from Threshold Homomorphic Encryption |
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
CORR
2010
Springer
14 years 9 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...
IACR
2011
13 years 9 months ago
2011
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...