Sciweavers

60 search results - page 2 / 12
» Is multiparty computation any good in practice
Sort
View
TASLP
2011
13 years 22 days ago
Estimating Dominance in Multi-Party Meetings Using Speaker Diarization
—With the increase in cheap commercially available sensors, recording meetings is becoming an increasingly practical option. With this trend comes the need to summarize the recor...
Hayley Hung, Yan Huang, Gerald Friedland, Daniel G...
IACR
2011
111views more  IACR 2011»
12 years 5 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...
EUROCRYPT
2008
Springer
13 years 7 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
13 years 11 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton