Sciweavers

388 search results - page 26 / 78
» Robust Lower Bounds for Communication and Stream Computation
Sort
View
INFOCOM
2012
IEEE
14 years 4 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
172
Voted
INFOCOM
2008
IEEE
16 years 12 days ago
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhya...
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
FOCS
2009
IEEE
16 years 23 days ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff
SPAA
2009
ACM
16 years 24 days ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski