26 search results - page 5 / 6 » Efficient Two Party and Multi Party Computation Against Cove... |
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
CCS
2009
ACM
14 years 5 months ago
2009
ACM
In distributed systems users need the ability to share sensitive content with multiple other recipients based on their ability to satisfy arbitrary policies. One such system is el...
IACR
2011
12 years 4 months ago
2011
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
TDP
2010
13 years 10 hour ago
2010
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...