رئوس مطالب
- چکیده
- کلیدواژه ها
- 1. مقدمه
- 1.1. آثار مرتبط
- 1.2. سهم کار ما
- 2. پروتکل پیشنهادی
- 3. تجزیه و تحلیل امنیت
- 4. ارزیابی عملکرد
- 5. نتیجه گیری
Abstract
Secure data transmission for the wireless sensor network (WSN) is always an important issue. The technique of traditional authenticated encryption allows a sensor node to generate a ciphertext which can only be decrypted and authenticated by a designated data aggregator. The convertible property further enables the aggregator to announce an ordinary signature for public verification. To alleviate the harm of key exposure, dynamic key systems are especially suitable for implementing in the large-scale deployment environments such as WSNs. Combining the concept of location and the merits of dynamic keys, we propose a location-based data encryption scheme for WSNs. To the best of our knowledge, this is the first concrete construction considering the properties of location and dynamic keys in WSNs. The proposed scheme not only is conversion-free, but also provides unlimited time periods and random-access key-updates. Moreover, we utilize some reduction models to prove the security of our protocol.
Conclusions
Combining the concept of location with the merits of key insulated systems, we introduced the first location-based data encryption for WSNs using dynamic keys. Our scheme allows a sensor node to generate a flexible ciphertext for some packet composed of many datagrams such that only the designated data aggregator has the ability to decrypt. To demonstrate the authenticity of some packet, the data aggregator is capable of revealing an ordinary signature for public verification. Our proposed protocol is conversion free and provides unlimited time periods and random-access key-updates. In the proposed scheme, each sensor node can periodically update its private key while the corresponding public one remains unchanged. The underlining security assumption of our scheme is based on the well known BDHP along with CDHP over elliptic curves. We also addressed detailed security proofs and precise advantage analyses to show the feasibility of our work.