Security and Communication Networks

Cover image for Vol. 6 Issue 1

January 2013

Volume 6, Issue 1

Pages i–iv, 1–128

  1. Issue Information

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

      Version of Record online: 26 DEC 2012 | DOI: 10.1002/sec.653

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. Trust modeling for message relay control and local action decision making in VANETs (pages 1–14)

      Jie Zhang, Chen Chen and Robin Cohen

      Version of Record online: 15 FEB 2012 | DOI: 10.1002/sec.519

      Thumbnail image of graphical abstract

      This paper presents a trust modeling framework for message propagation and evaluation in vehicular ad-hoc networks. In the framework, peers share information regarding road condition or safety and others provide opinions about whether the information can be trusted. Experimental results demonstrate that our proposed trust modeling framework promotes network scalability and system effectiveness in information propagation and evaluation under the pervasive presence of false information, which are the two essentially important factors for the popularization of vehicular ad-hoc networks.

    2. Network specific vulnerability based alert reduction approach (pages 15–27)

      Humphrey Waita Njogu, Luo Jiawei and Jane Nduta Kiere

      Version of Record online: 29 MAR 2012 | DOI: 10.1002/sec.520

      Thumbnail image of graphical abstract

      The proposed approach reduces the massive number of redundant alerts generated by signature based IDS using two major components. The verifier component improves the quality of alerts by validating them with vulnerabilities contained in the dynamic threat profile. The alert merger component reduces the redundancy in validated alerts. Experiment conducted in our test bed demonstrates the success of this approach in reducing most of the unnecessary alerts with high accuracy while closely maintaining the detection rate of IDS.

    3. Further analysis of pairing-based traitor tracing schemes for broadcast encryption (pages 28–32)

      Tsu-Yang Wu and Yuh-Min Tseng

      Version of Record online: 24 FEB 2012 | DOI: 10.1002/sec.522

      Thumbnail image of graphical abstract

      In this paper, we present a security claim for the design of pairing-based traitor tracing schemes. For a pairing-based traitor tracing scheme with constant size ciphertexts and private keys, if the decryption key is obtained by some pairing operations in pairing-based public key systems, the scheme will suffer from a linear attack and cannot provide the traitor tracing functionality.

    4. What you see predicts what you get—lightweight agent-based malware detection (pages 33–48)

      Wei Wang, Ilona Murynets, Jeffrey Bickford, Christopher Van Wart and Gang Xu

      Version of Record online: 18 APR 2012 | DOI: 10.1002/sec.528

      Thumbnail image of graphical abstract

      Because of the increasing threat of mobile malware, we propose a lightweight malware detection system for mobile devices to detect, analyze, and predict malware propagating via SMS and MMS messages. Using hidden agent contacts on a device and message-filtering techniques within the network, we show how to detect and analyze malware propagating throughout the network. Incoming propagation messages are also utilized to predict the current state of infection within the mobility network.

    5. Virtual private key generator based escrow-free certificateless public key cryptosystem for mobile ad hoc networks (pages 49–57)

      Xixiang Lv, Hui Li and Baocang Wang

      Version of Record online: 9 MAY 2012 | DOI: 10.1002/sec.529

      Thumbnail image of graphical abstract

      A certificateless public key cryptosystem can make a special contribution to building key distribution and management architecture in MANETs. In this paper, we present a virtual private key generator-based escrow-free certificateless public-key cryptosystem as a novel combination of certificateless and threshold cryptography. The proposed scheme is given the same trust level as is enjoyed in the traditional public key infrastructure because we bind a user's public key with its identity and partial private key, respectively.

    6. Immunizing mobile ad hoc networks against collaborative attacks using cooperative immune model (pages 58–68)

      Tao Gong and Bharat Bhargava

      Version of Record online: 26 APR 2012 | DOI: 10.1002/sec.530

      Thumbnail image of graphical abstract

      A security problem of cooperative immunization against collaborative attacks such as blackhole attacks and wormhole attacks, in the mobile ad hoc networks such as the Worldwide Interoperability for Microwave Access (WiMAX) networks, was discussed. With the inspiration from the human immune system, a tri-tier cooperative immune model was built to detect and eliminate the collaborative attacks (i.e., nonselfs) in the mobile ad hoc networks. NS2-based experimental results demonstrate the validation and effectiveness of the proposed immune model.

    7. Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model (pages 69–77)

      Zhenhua Liu, Yupu Hu, Xiangsong Zhang and Fagen Li

      Version of Record online: 7 MAR 2012 | DOI: 10.1002/sec.531

      An efficient identity-based signature scheme from lattices is constructed. The scheme's strong unforgeablity is proven in the standard model and rests on the hardness of the small integer solution problem. Then we extend it to obtain a hierarchical identity-based signature scheme.

    8. Toward early warning against Internet worms based on critical-sized networks (pages 78–88)

      Emmanouil Magkos, Markos Avlonitis, Panayiotis Kotzanikolaou and Michalis Stefanidakis

      Version of Record online: 21 MAR 2012 | DOI: 10.1002/sec.534

      Thumbnail image of graphical abstract

      In this paper, we introduce the notion of the critical size of a network, which is the minimum network size that needs to be monitored in order to correctly project the behavior of a fast-spreading worm in substantially larger networks. We provide a method for the theoretical estimation of a critical-sized network and validate it with simulation results. On the basis of the notion of critical-sized networks, we propose a logical framework for a distributed early warning system against unknown and fast-spreading worms.

    9. Modeling and security analysis of enterprise network using attack–defense stochastic game Petri nets (pages 89–99)

      Yuanzhuo Wang, Jingyuan Li, Kun Meng, Chuang Lin and Xueqi Cheng

      Version of Record online: 17 APR 2012 | DOI: 10.1002/sec.535

      Thumbnail image of graphical abstract

      According to the characteristics of the network attack and defense actions, we extend the previous work by proposing attack-defense stochastic game Petri nets (or ADSGNs), which can be used to model and analyze the competitive game issues by using classical methods from stochastic Petri nets. ADSGN are suitable to investigate the complex and dynamic game-related issues in network attack. In this paper, we use ADSGN to model and analyze the enterprise network attacks, compute the Nash equilibrium to deduce the best-response strategies to defend the attacks. We believe that ADSGN can open a new avenue to handle the game-related issues in network security.

    10. You have full text access to this OnlineOpen article
      Secure multicast key protocol for electronic mail systems with providing perfect forward secrecy (pages 100–107)

      Hsing-Chung Chen

      Version of Record online: 17 MAY 2012 | DOI: 10.1002/sec.536

      Thumbnail image of graphical abstract

      Electronic mail (e-mail) systems are widely used in the Internet. A user usually needs to send an e-mail to a group of users. In this paper, a secure multicast key protocol for e-mail systems with providing perfect forward secrecy is proposed to ensure confidentiality and authentication of this kind of e-mail system. The protocol employs the Chinese Remainder Theorem, RSA public key cryptosystems, and one-way hash functions. The protocol can save redundant key materials used for the e-mails. Via the security analysis, the protocol can satisfy the security requirements. In addition, we analyze the computation complexity of the protocol. The result showed that the protocol can save the computation cost for each e-mail sender.

    11. A security-enhanced key agreement protocol based on chaotic maps (pages 108–114)

      Tzung-Her Chen, Bing-Jian Wang, Tai-Yuan Tu and Chih-Hung Wang

      Version of Record online: 21 MAR 2012 | DOI: 10.1002/sec.537

      Thumbnail image of graphical abstract

      This paper pointed out the drawback in the scheme by Tseng et al. and, further, proposed a security-enhanced scheme by overcoming the drawback with slight modifications.

    12. Feature-based Type Identification of File Fragments (pages 115–128)

      Mehdi Chehel Amirani, Mohsen Toorani and Sara Mihandoost

      Version of Record online: 17 APR 2012 | DOI: 10.1002/sec.553

      Thumbnail image of graphical abstract

      In this paper, a content-based method for type identification of computer files and file fragments is proposed. The basic feature space is the histogram of byte values. Principle component analysis and neural networks have been used for the feature extraction. Extracted features are then applied to a classifier for the type detection. The proposed method has very good accuracy and speed in comparison with related works.