Security and Communication Networks

Cover image for Vol. 6 Issue 6

June 2013

Volume 6, Issue 6

Pages i–iv, 669–796

  1. Issue Information

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

      Article first published online: 22 APR 2013 | DOI: 10.1002/sec.658

  2. Review Article

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    1. Comparative study of trust and reputation systems for wireless sensor networks (pages 669–688)

      Osman Khalid, Samee U. Khan, Sajjad A. Madani, Khizar Hayat, Majid I. Khan, Nasro Min-Allah, Joanna Kolodziej, Lizhe Wang, Sherali Zeadally and Dan Chen

      Article first published online: 5 JUL 2012 | DOI: 10.1002/sec.597

      Thumbnail image of graphical abstract

      In recent years, the basic ideas of trust and reputation have been applied to wireless sensor networks as an additional measure of security. This survey attempts to provide a thorough understanding of trust and reputation monitoring (TRM) systems as well as their applications in the context of wireless sensor networks. The study investigates the recent advances in TRMs and concludes with a concise comparison of various state-of-the-art TRMs.

  3. Research Articles

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    1. Secure identity-based multisignature schemes under quadratic residue assumptions (pages 689–701)

      Lifei Wei, Zhenfu Cao and Xiaolei Dong

      Article first published online: 29 AUG 2012 | DOI: 10.1002/sec.600

      Thumbnail image of graphical abstract

      We first propose an efficient identity-based multisignature scheme with three interactive rounds under quadratic residue assumption. By using the technique of quadratic residue-based multiplicatively homomorphic equivocable commitment, an advanced scheme achieves two interactive rounds. We give formal security proof that our schemes are existentially unforgeable under adaptively chosen message attacks and chosen identity attacks in random oracle model. Compared with previous work, our schemes are featured by the weak assumption and the efficient signing and verification procedures.

    2. FTDA: outlier detection-based fault-tolerant data aggregation for wireless sensor networks (pages 702–710)

      Suat Ozdemir and Yang Xiao

      Article first published online: 13 AUG 2012 | DOI: 10.1002/sec.604

      Thumbnail image of graphical abstract

      This paper presents a fault-tolerant data aggregation scheme that eliminates the false data sent by malfunctioning and/or compromised sensor nodes. To conserve energy while eliminating false data, an in-network outlier detection technique that is based on locality sensitive hashing scheme is used.

    3. A simple and robust anonymous two-factor authenticated key exchange protocol (pages 711–722)

      Xiaowei Li and Yuqing Zhang

      Article first published online: 13 AUG 2012 | DOI: 10.1002/sec.605

      Thumbnail image of graphical abstract

      Two weaknesses of a two-factor authenticated key exchange protocol have been pointed out. A simple and robust anonymous two-factor authenticated key exchange protocol is proposed. The new scheme is provably secure in the random oracle model provided the Elliptic Curve Gap Diffie–Hellman assumption. It has good performance compared with the existing anonymous two-factor authenticated key exchange protocols in terms of computation cost and communication cost.

    4. New construction of affiliation-hiding authenticated group key agreement (pages 723–734)

      Chang Xu, Hua Guo, Zhoujun Li and Yi Mu

      Article first published online: 29 AUG 2012 | DOI: 10.1002/sec.606

      Thumbnail image of graphical abstract

      In this paper, we show that Jarecki, Kim, and Tsudik's affiliation-hiding authenticated group key agreement protocols in CT-RSA 2007 have some drawbacks. We introduce the notion of affiliation-hiding authenticated asymmetric group key agreement (AH-AAGKA) and present an AH-AAGKA protocol. Compared with previous AH-AGKA protocols, if invalid players participate in our protocol, legitimate participants can identify these invalid players. Besides, our protocol holds perfect forward secrecy, and linkable affiliation-hiding property.

    5. Secure group and multi-layer group communication schemes based on polynomial interpolation (pages 735–756)

      Purushothama B. R. and B. B. Amberker

      Article first published online: 29 AUG 2012 | DOI: 10.1002/sec.607

      Thumbnail image of graphical abstract

      We design a secure group key management scheme and multi-layer group key management scheme using polynomial interpolation method. The proposed scheme follows a new approach for key computation. We propose new key structures for managing the group keys for both the secure group and multilayer schemes. We prove the security of the proposed schemes, and the schemes are efficient in terms of rekeying cost compared with few schemes available in the literature.

    6. A novel probabilistic signature based on bilinear square Diffie–Hellman problem and its extension (pages 757–764)

      Tzong-Sun Wu and Han-Yu Lin

      Article first published online: 13 AUG 2012 | DOI: 10.1002/sec.608

      Thumbnail image of graphical abstract

      We proposed a novel probabilistic signature scheme and its extension to a universal designated verifier signature scheme. The latter is useful for forbidding a signature verifier to arbitrarily disseminating the signature, so as to protect the privacy of signature holder. We also demonstrated that the proposed schemes achieve the existential forgery under adaptive chosen-message attacks (EF-CMA) security in the random oracle model.

    7. Digital evidence collection for web image access (pages 765–776)

      Che-Jen Hsieh, Jung-Shian Li and Wei-Cheng Liu

      Article first published online: 28 SEP 2012 | DOI: 10.1002/sec.610

      Thumbnail image of graphical abstract

      The study proposes a novel digital feature retrieval scheme designed to detect unlawful dissemination of preselected JPEG images. The packet-level features of the target JPEG image are collected and are stored in a feature database. The features of all the packets passing through a nominated router are compared on-the-fly with those in the feature database to detect any transmissions of the target images. The experimental results show that our scheme is far more efficient than existing application-level schemes.

    8. A secure IPv6 address configuration scheme for a MANET (pages 777–789)

      Xiaonan Wang and Yi Mu

      Article first published online: 13 AUG 2012 | DOI: 10.1002/sec.611

      Thumbnail image of graphical abstract

      In the proposed scheme, a new node acquires a unique IPv6 address without performing a duplicate address detection process, and the address resources occupied by failed nodes can be reclaimed automatically for reuse. In addition, the identification of a new node/proxy node is confirmed through authentication. Therefore, a secure IPv6 configuration is achieved.

    9. Attribute-based ring signcryption scheme (pages 790–796)

      Zhenzhou Guo, Mingchu Li and Xinxin Fan

      Article first published online: 28 SEP 2012 | DOI: 10.1002/sec.614

      Thumbnail image of graphical abstract

      In this paper, we present attribute-based ring signcryption scheme, which realizes the concept of ring signcryption in the attribute-based encryption frame firstly. In our system, it allows a user to signcrypt a message by a set of attributes that are chosen without revealing its identity. In additional, we propose the security models and prove the confidentiality and unforgeability of our schemes. We also present the efficiency of our scheme by comparisons.

SEARCH

SEARCH BY CITATION