321 search results - page 25 / 65 » Secure Multiparty Computation of Approximations |
112
click to vote
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
112
Voted
CCS
2005
ACM
15 years 6 months ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
111
click to vote
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
148
click to vote
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...