156 search results - page 5 / 32 » On the Round Complexity of Covert Computation |
FOCS
2003
IEEE
14 years 20 days ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
STOC
2010
ACM
14 years 6 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...