#### Filter Results:

#### Publication Year

1989

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

(NIST) has published a series of security standards under Federal Information Processing Standard (FIPS). Standard for key agreement is still missing in the current standards. Arazi proposed integrating Diffie–Hellman (DH) key exchange into the Digital Signature Algorithm (DSA). However, the protocol was attacked by Nyberg et al. We propose three different… (More)

A (t, n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t, n) secret sharing scheme and give a formal definition on the (n, t, n) secret sharing scheme based on Pedersen's (t, n) secret… (More)

Masquerading and eavesdropping are major threats to the security of wireless communications. To provide proper protection for the communication of the wireless link, contents of the communication should be enciphered and mutual authentication should be conducted between the subscriber and the serving network. Several protocols have been proposed by… (More)

- Joon Ki Paik, L. Harn
- 2009

Fig. 6 Real 256 X 256 photographically out-offocus blurred image, estl-muted 2D PSF, and reJtored image a Real image b Estimated 2D PSF c Restored image .IsusJ Conclusions; We propose a fully digital auto-focusing system based on novel out-of-focus blur estimation and restoration algorithms. The main advantages of the proposed PSF estimation algorithm are… (More)