5374 search results - page 78 / 1075 » The induction of communication protocols |
147
click to vote
ASIACRYPT
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
154
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
158
click to vote
ICOIN
2003
Springer
15 years 11 months ago
2003
Springer
Timed token medium access protocols are widely adopted in real-time multiple access networks because of bounded access time. However, timed token protocols inadequately provide per...
174
click to vote
JSAC
2006
15 years 6 months ago
2006
We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectivel...
146
click to vote
IPL
2008
15 years 6 months ago
2008
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...