521 search results - page 24 / 105 » Scalable Secure Multiparty Computation |
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
STOC
2010
ACM
14 years 23 days ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
CRYPTO
2005
Springer
14 years 1 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
14 years 2 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...
CCS
2005
ACM
14 years 1 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...