91 search results - page 2 / 19 » Multiparty Communication Complexity of Disjointness |
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
13 years 12 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...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...