Sciweavers

Share
56 search results - page 2 / 12
» On the practical importance of communication complexity for ...
Sort
View
IACR
2016
43views Biometrics» more  IACR 2016»
3 years 6 months ago
Constant-Round Asynchronous Multi-Party Computation
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchrono...
Sandro Coretti, Juan A. Garay, Martin Hirt, Vassil...
IACR
2011
111views more  IACR 2011»
7 years 10 months ago
Secure Multi-Party Sorting and Applications
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...
Kristján Valur Jónsson, Gunnar Kreit...
CSE
2009
IEEE
9 years 1 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum
JIPS
2007
131views more  JIPS 2007»
8 years 10 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
9 years 4 months ago
On Secure Multi-party Computation in Black-Box Groups
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...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
books