321 search results - page 45 / 65 » Secure Multiparty Computation of Approximations |
ASIACRYPT
2010
Springer
13 years 8 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
ADC
2007
Springer
14 years 5 months ago
2007
Springer
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
ASIACRYPT
2008
Springer
14 years 24 days ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
ESORICS
2010
Springer
13 years 12 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
PAISI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...