Sciweavers

1674 search results - page 36 / 335
» On the Optimality of the ARQ-DDF Protocol
Sort
View
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
SECON
2010
IEEE
13 years 6 months ago
Trajectory-Aware Communication Solution for Underwater Gliders Using WHOI Micro-Modems
The predictable trajectory of underwater gliders can be used in geographic routing protocols. Factors such as drifting and localization errors cause uncertainty when estimating a g...
Baozhi Chen, Patrick C. Hickey, Dario Pompili
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
12 years 8 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
ICDCN
2010
Springer
14 years 24 days ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
INFOCOM
2010
IEEE
13 years 7 months ago
Optimal SINR-based Random Access
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong, Robe...