100 search results - page 8 / 20 » Asynchronous Secure Multiparty Computation in Constant Time |
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...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
EUROCRYPT
2000
Springer
14 years 6 days ago
2000
Springer
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...