1816 search results - page 10 / 364 » Trace oblivious computation |
EUROCRYPT
2007
Springer
14 years 1 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...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We consider a collection of robots which are identical (anonymous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they a...
CLUSTER
2009
IEEE
14 years 4 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
