156 search results - page 12 / 32 » On the Round Complexity of Covert Computation |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
ICNS
2007
IEEE
14 years 1 months ago
2007
IEEE
Complexity of distributed real-time applications such as automotive electronics has increased dramatically over the last couple of years. As a result, developing communication pro...
ARCS
2010
Springer
13 years 7 months ago
2010
Springer
Processor speed and available computing power constantly increases, enabling computation of more and more complex problems such as numerical simulations of physical processes. In t...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Measurement of the delay is an important and common problem in communication over packet networks. The endto-end and the round trip delay are among the factors directly impacting ...