Sciweavers

174 search results - page 23 / 35
» Attack-Resilient Random Key Distribution Scheme for Distribu...
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
Recursive Secret Sharing for Distributed Storage and Information Hiding
Abstract--This paper presents a recursive computational multisecret sharing technique that hides k - 2 secrets of size b each into n shares of a single secret S of size b, such tha...
Abhishek Parakh, Subhash Kak
IPPS
1997
IEEE
13 years 11 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
PODC
2009
ACM
14 years 10 days ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
EUROCRYPT
1999
Springer
13 years 12 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold