Sciweavers

1255 search results - page 55 / 251
» On Simple and Secure Key Distribution
Sort
View
SASN
2006
ACM
15 years 9 months ago
Location-aware key predistribution scheme for wide area wireless sensor networks
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean ...
130
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
218
Voted
GIS
2009
ACM
16 years 4 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
ACMSE
2005
ACM
15 years 9 months ago
On developing a simple in-house digital library archive
Digital libraries (DLs) have become a major focus of information technology resources for organizations from academia, to the US Department of Defense to the archeological efforts...
Eric L. Brown, Luis G. Velazco, G. Kirksey, S. Ram...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 3 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel