65 search results - page 1 / 13 » Efficient Set Operations in the Presence of Malicious Advers... |
PKC
2010
Springer
13 years 6 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
JOC
2010
12 years 11 months ago
2010
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....