Sciweavers

4438 search results - page 111 / 888
» On the Distribution of Keys by Hashing
Sort
View
CJ
2002
67views more  CJ 2002»
15 years 6 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
FTDB
2011
98views more  FTDB 2011»
14 years 9 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
INFOCOM
2006
IEEE
16 years 10 days ago
Leveraging Channel Diversity for Key Establishment in Wireless Sensor Networks
— As the use of sensor networks increases, security in this domain becomes a very real concern. One fundamental aspect of providing confidentiality and authentication is key dis...
Matthew J. Miller, Nitin H. Vaidya
ICNP
2003
IEEE
15 years 11 months ago
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jaj...
PDCN
2007
15 years 7 months ago
Modified collision packet classification using counting bloom filter in tuple space
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
Mahmood Ahmadi, Stephan Wong