Learn More
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several pairwise key schemes have been proposed for large distributed sensor networks. These schemes randomly select a set of keys from a key pool and install the keys in the memory of(More)
In 1982, and Taylor proposed an elegant solution to rhe partially ordered multilevel key distribution problem, using a cryptographic approach. Since then, continuing research has been conducred to try to realize and simplify their scheme. Generally speaking, there are two problems associated with their scheme. First, a large value associated with each(More)
2601 where s(k) is any function such that 1 s(k) k. Encoding and decoding require T = O(ks(k) + k log k) bit operations and the area is A = O(s 3 (k) + k) memory bits. If, for example, we let s(k) = log 2 k, then the proposed scheme has the same complexity as the codes given in [10] and a redundancy of N (k) 0 k = 3 log 2 k + 2:5 log 2 log 2 k + O(log log(More)
In a (t, n) secret sharing scheme, a secret s is divided into n shares and shared among a set of n shareholders by a mutually trusted dealer in such a way that any t or more than t shares will be able to reconstruct this secret; but fewer than t shares cannot know any information about the secret. When shareholders present their shares in the secret(More)
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently , several pairwise key schemes have been proposed for large distributed sensor networks. These schemes randomly select a set of keys from a key pool and install the keys in the memory of(More)