Security and Communication Networks

Cover image for Vol. 4 Issue 1

Special Issue: Trusted Computing and Communications

January 2011

Volume 4, Issue 1

Pages 1–108

Issue edited by: Kouichi Sakurai, Laurence T. Yang, Guojun Wang

  1. Guest Editorials

    1. Top of page
    2. Guest Editorials
    3. Special Issue Papers
    1. You have free access to this content
      Guest editorial: Trusted computing and communications (pages 1–2)

      Guojun Wang, Laurence T. Yang and Kouichi Sakurai

      Version of Record online: 5 FEB 2010 | DOI: 10.1002/sec.195

  2. Special Issue Papers

    1. Top of page
    2. Guest Editorials
    3. Special Issue Papers
    1. Enhanced correlation power analysis attack against trusted systems (pages 3–10)

      Huiyun Li, Keke Wu and Fengqi Yu

      Version of Record online: 13 JAN 2010 | DOI: 10.1002/sec.176

      Thumbnail image of graphical abstract

      Figure (a) demonstrates the probability distribution of Hamming distance (HD) (0 [RIGHTWARDS ARROW] 1) of DES S-box 4-bit output; Figure (b) demonstrates the probability distribution of Hamming weight (HW) in DES S-box 4-bit output. In our proposed enhanced power model, HD can be approximated as equation image.

    2. Better security enforcement in trusted computing enabled heterogeneous wireless sensor networks (pages 11–22)

      Yanjiang Yang, Jianying Zhou, Robert H. Deng and Feng Bao

      Version of Record online: 11 JAN 2010 | DOI: 10.1002/sec.179

      Thumbnail image of graphical abstract

      Trusted computing technology can be applied to wireless sensor networks.

    3. Hybrid pattern matching for trusted intrusion detection (pages 33–43)

      Benfano Soewito, Lucas Vespa, Ning Weng and Haibo Wang

      Version of Record online: 9 DEC 2009 | DOI: 10.1002/sec.175

      Thumbnail image of graphical abstract

      The key requirements of trusted intrusion detection are accurate pattern matching, adaptive, and reliable reconfiguration for new patterns. To address these requirements, this paper presents trusted intrusion detection by utilizing hybrid pattern matching engines: FPGA-based and multicore-based pattern matching engines. To achieve synchronization of these two pattern matching engines, methodologies including multi-threading DFA and clustered state coding have been developed.

    4. FineTrust: a fine-grained trust model for peer-to-peer networks (pages 61–69)

      Yizhi Ren, Mingchu Li and Kouichi Sakurai

      Version of Record online: 21 DEC 2009 | DOI: 10.1002/sec.165

      Thumbnail image of graphical abstract

      This paper presents a fine-grained trust computation model for P2P networks, in which related coefficients are defined to reflect the recommender's current status, history behavior, and the gap between them. Also, we firstly introduce the Gauss-bar function to measure the preference similarity between peers. All those will result in a flexible model which represents trust in a manner more close to human intuitions and satisfies the diverse QoS requirements of peers in P2P networks.

    5. Enhancing identity trust in cryptographic key management systems for dynamic environments (pages 79–94)

      Anne V. D. M. Kayem, Patrick Martin and Selim G. Akl

      Version of Record online: 15 JAN 2010 | DOI: 10.1002/sec.164

      Thumbnail image of graphical abstract

      Combining cryptographic key management (CKM) with identity management is a method of securing data access. However, CKM handles updates inefficiently in dynamic environments and this can create delays that make the data vulnerable to security attacks. Adaptive CKM can address this issue, but the cost/benefit tradeoff needs to be justified in comparison to standard CKM approaches. We discuss the challenges involved and analyze results from a proof-of-concept implementation of an attack prevention algorithm that is adaptive.

    6. Secure reputation monitoring system—a novel connected dominating set-based framework for WSNs (pages 95–108)

      A. Srinivasan, F. Li and J. Wu

      Version of Record online: 1 JUN 2010 | DOI: 10.1002/sec.160

      Thumbnail image of graphical abstract

      Secure Reputation monitoring system has been proposed. The proposed model exploits the connected dominating set property of a network graph. The proposed model not only enables secure reputation monitoring but also provides certificateless secure node mobility and robustness to node replication and ID spoofing attacks as a byproduct.