The core of security proofs quantum key distribution (QKD) is the estimation a parameter that determines amount privacy amplification users need to apply in order distill secret key. To estimate this using observed data, one needs concentration inequalities such as random sampling theory or Azuma's inequality. latter can be straightforwardly employed wider class QKD protocols, including those d...

Early researches focused on the security of homogenous sensor networks. However, recent works have demonstrated that the presence of heterogeneous sensor nodes gives better performance than homogenous ones in terms of energy consumptions, storage overhead, and network connectivity. In this paper, we propose a hierarchical key management scheme named HERO which is based on random key pre-distrib...

Key pre-distribution is a well-known technique for ensuring secure communication among sensors deployed in an ad-hoc manner to form a sensor network. Secure paths can be established between any two sensors, where adjacent sensors on the path share a (predistributed) secret key. Several results have been presented recently on random key predistribution schemes [6] and [2]. In this paper, we prop...

This paper describes how one can reduce the memory access time with pre-emphasis (PE) pulses even in non-volatile random-access memory. Optimum PE pulse widths and resultant minimum word-line (WL) delay times are investigated as a function of column address. The impact process variation constant WL, cell current, resistance deciding path on optimum discussed. WL modeled fitting curves address a...