Sciweavers

5374 search results - page 368 / 1075
» The induction of communication protocols
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
ICC
2007
IEEE
102views Communications» more  ICC 2007»
16 years 1 months ago
Noncooperative Routing with Cooperative Diversity
— Routing in wireless networks confronts more diverse and more rapidly varying characteristics associated with wireless links. Several recent protocols have tried to exploit coop...
Benjamin R. Hamilton, Xiaoli Ma
TACAS
2001
Springer
119views Algorithms» more  TACAS 2001»
15 years 11 months ago
Compositional Message Sequence Charts
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
Elsa L. Gunter, Anca Muscholl, Doron Peled
INFOCOM
1997
IEEE
15 years 11 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 11 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman