16 search results - page 1 / 4 » Cryptographic Complexity of Multi-Party Computation Problems... |
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
13 years 11 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
2004
ACM
14 years 4 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
CSFW
2010
IEEE
13 years 7 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
For the tasks of classification, two types of patterns can generate problems: ambiguous patterns and outliers. Furthermore, it is possible to separate classification algorithms in...