Security and Communication Networks

Cover image for Vol. 6 Issue 3

March 2013

Volume 6, Issue 3

Pages i–iv, 257–384

  1. Issue Information

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

      Version of Record online: 25 FEB 2013 | DOI: 10.1002/sec.655

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    4. Call for Papers
    1. Blind detection of spread spectrum flow watermarks (pages 257–274)

      Weijia Jia, Fung Po Tso, Zhen Ling, Xinwen Fu, Dong Xuan and Wei Yu

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

      Thumbnail image of graphical abstract

      This figure shows that the mean-square autocorrelation-based approach is effective in detecting direct sequence spread spectrum watermarks. It also shows that peaks indeed appear at multiples of the bit period.

    2. Towards reducing false alarms in network intrusion detection systems with data summarization technique (pages 275–285)

      Neminath Hubballi, Santosh Biswas and Sukumar Nandi

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

      Thumbnail image of graphical abstract

      State-of-the-art clustering-based anomaly detection systems require more than one pass on the training dataset to build normal system behavior. As networks become faster in operation, the amount of data that need to be processed is increasing and these clustering algorithms become expensive to work with. In this article, we use a data summarization-based algorithm to handle vast training data. Experimental results on three different datasets illustrate the efficacy of this method for handling large data and increasing accuracy.

    3. A more secure and scalable routing protocol for mobile ad hoc networks (pages 286–308)

      Liana Khamis Qabajeh, Miss Laiha Mat Kiah and Mohammad Moustafa Qabajeh

      Version of Record online: 10 MAY 2012 | DOI: 10.1002/sec.563

      Thumbnail image of graphical abstract

      A new routing protocol, ARANz, has been proposed in this work. ARANz introduces a hierarchical and distributed routing algorithm, which improves performance and scalability of the routing protocol by dividing the area into zones. ARANz aims to achieve robustness, increase network security and solve the single point of failure and attack problems by introducing multiple local certificate authorities. Our preliminary simulation results show that ARANz is able to effectively discover secure routes within relatively large networks with large number of mobile nodes, while maintaining the minimum packet routing load.

    4. Improving intrusion detection for imbalanced network traffic (pages 309–324)

      Ciza Thomas

      Version of Record online: 10 JUL 2012 | DOI: 10.1002/sec.564

      Thumbnail image of graphical abstract

      The issues of base-rate fallacy and accuracy paradox are addressed in this paper. The data-dependent decision fusion architecture, which learns from the data and then appropriately gives weighting to the decisions of various intrusion detection systems, is proposed for reduced false positive rate and improved overall detection rate and, also, the detection rate of minority class types in particular. The proposed technique is demonstrated to outperform other existing fusion techniques such as OR, AND, SVM and ANN.

    5. Predicate encryption for multi-inner-products (pages 325–339)

      Dongdong Sun, Colin Boyd and Juan Manuel Gonzalez Nieto

      Version of Record online: 21 JUN 2012 | DOI: 10.1002/sec.566

      In this paper, we present encryption schemes that can be used to evaluate a wide class of predicates, including multi-inner products. Our system is proven secure under standard model. We extensively show how to improve the efficiency of our system.

    6. Secure SIP authentication scheme supporting lawful interception (pages 340–350)

      Qiong Pu, Jian Wang and Shuhua Wu

      Version of Record online: 5 JUN 2012 | DOI: 10.1002/sec.568

      Thumbnail image of graphical abstract

      We show that the SIP authentication scheme of Arshad et al. is still vulnerable to offline dictionary attacks and propose a new authentication and key agreement scheme for SIP with provable security. Moreover, we also provide an extended scheme capable of protecting media stream's privacy even against SIP servers while supporting lawful interception.

    7. Efficient chosen ciphertext secure public-key encryption under factoring assumption (pages 351–360)

      Baodong Qin and Shengli Liu

      Version of Record online: 21 JUN 2012 | DOI: 10.1002/sec.571

      Thumbnail image of graphical abstract

      In EUROCYPT 2009, Hofheinz and Kiltz proposed the first public-key encryption scheme that simultaneously enjoys practicality and IND-CCA security under factoring assumption in the standard model. In this paper, we present a variant of their scheme that performs better at decryption while having the same efficiency at encryption. By remarking that over a semismooth subgroup, we were able to construct a new scheme that performs extremely efficient decryption.

    8. A privacy-preserving acceleration authentication protocol for mobile pay-TV systems (pages 361–372)

      Xuefeng Liu and Yuqing Zhang

      Version of Record online: 27 JUN 2012 | DOI: 10.1002/sec.584

      Thumbnail image of graphical abstract

      This paper proposes an efficient privacy-preserving authentication mechanism for mobile pay-TV systems based on the batch signature technique, which allows the service provider to multiple requests from different subscribers in a batch manner. In addition, a hand-off authentication mechanism without involving the head end system is also proposed to secure the mobile pay-TV systems.

    9. Designing role-based access control using formal concept analysis (pages 373–383)

      Ch. Aswani Kumar

      Version of Record online: 27 JUN 2012 | DOI: 10.1002/sec.589

      Thumbnail image of graphical abstract

      This paper proposes a method for designing role-based access control (RBAC) using formal concept analysis. By formalizing RBAC triadic matrix as a dyadic security context, we could apply the attribute exploration process in formal concept analysis. The resultant lattice structure represents the role hierarchy and follows separation of duties in RBAC. The proposed method helps to derive the dependencies between the non-mutually exclusive roles, document types, and access permissions.

  3. Call for Papers

    1. Top of page
    2. Issue Information
    3. Research Articles
    4. Call for Papers

SEARCH

SEARCH BY CITATION