Security and Communication Networks

Cover image for Vol. 6 Issue 10

October 2013

Volume 6, Issue 10

Pages i–iv, 1177–1299

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. Issue Information (pages i–iv)

      Article first published online: 23 SEP 2013 | DOI: 10.1002/sec.662

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. User-centric secure integration of personal RFID tags and sensor networks (pages 1177–1197)

      Pablo Najera, Rodrigo Roman and Javier Lopez

      Article first published online: 19 FEB 2013 | DOI: 10.1002/sec.684

      Thumbnail image of graphical abstract

      This paper analyzes how to achieve the secure integration of personal radio frequency identification (RFID) tags and sensor networks in the heterogeneous network of personal devices. It proposes a secure architecture for the personal network (PN) designed to accommodate these context-aware technologies including their complete life cycle: device initialization, secure ownership transfer, key management, and enforcement of privacy policies. Secure communication models are provided to enable the access from the Internet of Things and local PN nodes to the RFID tags and sensors.

    2. SENSORLock: a lightweight key management scheme for wireless sensor networks (pages 1198–1210)

      Juliano F. Kazienko, Igor G. Ribeiro, Igor M. Moraes and Célio Vinicius N. Albuquerque

      Article first published online: 26 FEB 2013 | DOI: 10.1002/sec.686

      Thumbnail image of graphical abstract

      This work presents a key management mechanism tailored to sensor networks called SENSORLock. Our main contribution is to propose, analyze, and demonstrate the feasibility of SENSORLock for secure symmetric key distribution solving the stored key exposure problem. Simulation results reveal that such mechanism introduces very low processing overhead, in the order of nanoseconds, and an estimated power consumption quite similar to existing approaches. Besides, practical experiments indicate that the scheme can be deployed by off-the-shelf sensors, such as MicaZ and TelosB.

    3. An efficient intrusion detection framework in cluster-based wireless sensor networks (pages 1211–1224)

      Hichem Sedjelmaci, Sidi Mohammed Senouci and Mohammed Feham

      Article first published online: 30 JAN 2013 | DOI: 10.1002/sec.687

      Thumbnail image of graphical abstract

      In our framework, the intrusion detection process is carried out at three levels (i.e., cluster members, cluster head, and base station) to detect with a high accuracy these four well-known attacks: hello flood, selective forwarding, black hole, and wormhole attacks. According to the simulation results, our detection framework exhibits high detection rate (almost 100%), low number of false positives, less time to detect the attack, and less energy consumption.

    4. Detecting stepping-stone intrusion using association rule mining (pages 1225–1235)

      Han-Wei Hsiao, Huey-Min Sun and Wei-Cheng Fan

      Article first published online: 14 MAR 2013 | DOI: 10.1002/sec.692

      Thumbnail image of graphical abstract

      A detection method of stepping-stone based on the association rule mining of network traffic records is proposed. Empirical evaluation under 5 min of test records shows that the accuracy rate, the precision rate, and the recall rate are 83.81%, 84.26%, and 83.16%. When the test record gathering time is extended to 20 min, with the same detecting method, the three evaluations achieve 99.9%.

    5. Defending return-oriented programming based on virtualization techniques (pages 1236–1249)

      Xiaoqi Jia, Rui Wang, Jun Jiang, Shengzhi Zhang and Peng Liu

      Article first published online: 30 JAN 2013 | DOI: 10.1002/sec.693

      Thumbnail image of graphical abstract

      We propose a hypervisor-based on-the-fly approach to defend return-oriented programming attacks. This approach is transparent to the protected system and does not rely on the operating system kernel's correctness. We implement a proof-of-concept system based on the open source Xen hypervisor. Our evaluation shows that this system is effective and efficient.

    6. Provably secure revocable ID-based signature in the standard model (pages 1250–1260)

      Tung-Tso Tsai, Yuh-Min Tseng and Tsu-Yang Wu

      Article first published online: 18 JAN 2013 | DOI: 10.1002/sec.696

      Thumbnail image of graphical abstract

      In this paper, we adopt Tseng and Tsai's revocation concept to propose the first revocable ID-based signature (RIBS) scheme in the standard model. Under the computational Diffie–Hellman assumption, we demonstrate that the proposed RIBS scheme is provably secure while remaining efficient for signing and verification as compared with previously proposed ID-based signature schemes.

    7. HORME: hierarchical–object–relational medical management for electronic record (pages 1261–1270)

      Chien-Chang Yang, Kuo-Jui Wei, Bo Li and Jung-San Lee

      Article first published online: 18 MAR 2013 | DOI: 10.1002/sec.704

      Thumbnail image of graphical abstract

      Doctors in different departments and locations can check the electronic records of patients without any complicated steps and can even consult together via the Internet. In this paper, we design a hierarchical-object-relational management system for electronic records. Hierarchical-object-relational management system for electronic records can not only achieve the essentials of traditional paper-based record but can also satisfy the requirements of privacy and security according to the factorization problem, which makes it possible to protect the right of the legal doctors, patients, and hospitals.

    8. Novel distributed key revocation scheme for wireless sensor networks (pages 1271–1280)

      Chih-Hung Chao, Ching-Fang Yang, Po-Ting Lin and Jung-Shian Li

      Article first published online: 18 JAN 2013 | DOI: 10.1002/sec.707

      Thumbnail image of graphical abstract

      The paper proposed that any node identified as having a malicious behaviour by t or more sensor nodes is categorized as a compromised node, and its keys are immediately revoked from the entire network. The proposed scheme not only satisfies the rigorous definition of a distributed key revocation protocol but also yields a significant improvement over Chan's revocation scheme in terms of a lower storage space requirement, a reduced communication overhead, and a lower computational cost.

    9. A sealed-bid multi-attribute auction protocol with strong bid privacy and bidder privacy (pages 1281–1289)

      Wenbo Shi

      Article first published online: 22 FEB 2013 | DOI: 10.1002/sec.708

      Thumbnail image of graphical abstract

      In this paper, a sealed-bid multi-attribute auction protocol that mainly focuses on security issues is presented. The proposal preserves the strong privacy of the bids and provides verifiable correctness. According to the security analysis, it satisfies the security requirements of an e-auction. Figure: it is provided by 1.eps.

    10. Lightweight key management on sensitive data in the cloud (pages 1290–1299)

      Zongmin Cui, Hong Zhu and Lianhua Chi

      Article first published online: 28 AUG 2013 | DOI: 10.1002/sec.850

      Thumbnail image of graphical abstract

      Based on a kind of special key that plays the role of a bridge between data owners and users, each user needs only to manage an access key no matter how many data owners there are. By the access key, the user can compute all authorized encryption keys from different data owners. That is, our solution minimizes the user key management cost in the multiple data owners scenario.