37 search results - page 2 / 8 » Secure Multi-party Computation Minimizing Online Rounds |
IACR
2011
12 years 4 months ago
2011
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...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...