Sciweavers

49 search results - page 9 / 10
» Lower Bounds on Signatures From Symmetric Primitives
Sort
View
DCC
2002
IEEE
14 years 5 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 5 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
INFOCOM
2011
IEEE
12 years 9 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
SRDS
1999
IEEE
13 years 10 months ago
On Diffusing Updates in a Byzantine Environment
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
Dahlia Malkhi, Yishay Mansour, Michael K. Reiter
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 2 months ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis