404 search results - page 2 / 81 » Robust Multiparty Computation with Linear Communication Comp... |
EUROCRYPT
2004
Springer
14 years 27 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
14 years 2 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
SCN
2010
Springer
13 years 5 months ago
2010
Springer
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...