Abs t rac t . Path keys are secrets established between communicating devices that do not share a pre-distributed key. They are required by most key pre-distribution schemes for sensor networks, because topology is unknown before deployment and storing complete pairwise-unique keys is infeasible for low-cost devices such as sensors. Unfortunately, path keys have often been neglected by existing...

Establishment of pairwise keys between sensor nodes in a sensor network is a difficult problem due to resource limitations of sensor nodes as well as vulnerability to physical captures of sensor nodes by the enemy. Public-key cryptosystems are not much suited for most resource-constrained sensor networks. Recently, elliptic curve cryptographic techniques show that public key cryptosystem is als...

Access control in sensor networks is used to authorise and grant users the right to access the network and data collected by sensors. Different users have different access right due to the access restriction implicated by the data security and confidentiality. Even though symmetric-key scheme, which has been investigated extensively for sensor networks, can fulfil the requirement, public-key cr...

Wireless Sensor Networks (WSNs) are used in many commercial, military, industrial, research and medical applications. Because of the limited resources of the sensor nodes in the wireless environment, these networks impose special security requirements besides to the security needs in traditional networks. This study presents the security problems in WSNs and discusses the security protocols bas...

Yamaguchi, Okayama, and Miyahara proposed a simple but efficient authentication system, SPLICE/AS. In this article, we show that their method is vulnerable to the guessing attack. An attacker can obtain the password, private-key, and public-key of the user. To overcome the vulnerability of SPLICE/AS to the guessing attack, we propose an improvement of their system. In our scheme, we not only pr...

In this paper, a high dimensional chaotic systems based mixed keystream generator is proposed to secure the voice data. As the voice-based communication becomes extensively vital in the application areas of military, voice over IP, voice-conferencing, phone banking, news telecasting etc. It greatly demands to preserve sensitive voice signals from the unauthorized listening and illegal usage ove...

An Order-Revealing Encryption (ORE) scheme gives a public procedure by which two ciphertext can be compared to reveal the order of their underlying plaintexts. The ideal security notion for ORE is that only the order is revealed — anything else, such as the distance between plaintexts, is hidden. The only known constructions of ORE achieving such ideal security are based on cryptographic multil...

Data security protection is essential for most multimedia data transmissions today. Classical multimedia content protection is dominated by symmetric encryption methods. This paper explores the possibility of public-key media content encryption. The key problem to the asymmetric selective encryption is formalized and defined as the “bounded plaintext problem”. Possible solutions to this problem...

A key agreement (or distribution) protocol is a set of communication rules whereby two users can establish a shared common key. The shared key can be used by the users in future secure communications. We analyze a key agreement protocol presented by Leighton and Micali at the CRYPTO'93 conference, which is based on tamper-proof hardware, and show that the protocol fails in that a common key sha...

A method for remote user authentication is proposed that requires only public information to be stored at the verifying host. Like the S/KEY scheme, the new technique uses only symmetric cryptography and is resistant to eavesdropping, but, unlike S/KEY, it is resistant to host impersonation attacks. The avoidance of asymmetric cryptographic techniques makes the scheme appropriate for low cost u...