Security and Communication Networks

Cover image for Vol. 7 Issue 4

April 2014

Volume 7, Issue 4

Pages i–iv, 685–811

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. You have free access to this content
      Issue Information (pages i–iv)

      Version of Record online: 20 MAR 2014 | DOI: 10.1002/sec.886

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. Detecting and mitigating interest flooding attacks in content-centric network (pages 685–699)

      Kai Wang, Huachun Zhou, Hongbin Luo, Jianfeng Guan, Yajuan Qin and Hongke Zhang

      Version of Record online: 10 APR 2013 | DOI: 10.1002/sec.770

      Thumbnail image of graphical abstract

      In this paper, we give a comprehensive taxonomy for different types of interest flooding attacks in CCN based on the type of victim and propose a threshold-based detecting and mitigating (TDM) scheme to counter one type of the interest flooding attacks called denial of service against content source (DACS attack). The performance analysis results show that TDM achieves high detection ability and good effect on mitigating malicious traffic while bringing in small overhead on countering DACS attack.

    2. Analysis of the effect of InfoRanking on content pollution in peer-to-peer systems (pages 700–713)

      P. Zhang, N. Fotiou, B. E. Helvik, G. F. Marias and G. C. Polyzos

      Version of Record online: 28 JUN 2013 | DOI: 10.1002/sec.773

      Thumbnail image of graphical abstract

      InfoRanking is a mechanism that tries to mitigate content pollution by ranking content items. In this paper, we show through analysis, fluid modeling, and simulation that when InfoRanking is used, attackers can deceive users only when they share corrupted copies of legitimate file versions. Nevertheless, as corrupted files can be immediately detected after being downloaded, this attack is only effective when users enter the system at very low rate and leave relatively fast.

    3. Attack modelling and security evaluation based on stochastic activity networks (pages 714–737)

      Ali Sedaghatbaf and Mohammad Abdollahi Azgomi

      Version of Record online: 26 APR 2013 | DOI: 10.1002/sec.774

      Thumbnail image of graphical abstract

      This paper proposes hierarchical and coloured extension of stochastic activity network-based attack modelling (HCSAM) for modelling multistage attacks following the attack tree paradigm. By using HCSAM, attacker behaviour can be modelled as a strategic decision-making process regarding the following factors affecting the attacker's decisions: (1) the goals of attack; (2) the cost and risk associated with available strategies; and (3) the target system's possible responses. Furthermore, we put forward an analytic solution method to measure security attributes and estimate mean time to security failure and attack success probability.

    4. On the mobile relay placement in hybrid MANETs with secure network coding (pages 738–749)

      Jin Wang and Kejie Lu

      Version of Record online: 30 MAY 2013 | DOI: 10.1002/sec.775

      Thumbnail image of graphical abstract

      In this paper, we study a mobile relay placement problem to maximize the secure network throughput of hybrid mobile ad-hoc networks with secure network coding capability. Specifically, we formulate the optimal relay placement problem as an integer linear programming problem, and we propose an efficient near-optimal approximation algorithm based on linear programming-relaxation. We also conduct extensive simulation experiments, which demonstrate the effectiveness of the proposed algorithms.

    5. Two novel biometric features in keystroke dynamics authentication systems for touch screen devices (pages 750–758)

      Cheng-Jung Tasia, Ting-Yi Chang, Pei-Cheng Cheng and Jyun-Hao Lin

      Version of Record online: 10 MAY 2013 | DOI: 10.1002/sec.776

      Thumbnail image of graphical abstract

      Two novel keystroke features are found in touch screen handheld mobile devices, which are called “pressure” features and “size” features. A computation efficient statistical classifier is built for low-power mobile devices to authenticate the user's identity. The result shows that the size features or the pressure features can effectively promote the utility of KDA system in PIN-based authentication schemes for touch screen handled mobile devices. The combination of time features and pressure features is the best one for authenticating users.

    6. Distributed access control with adaptive privacy preserving property for wireless sensor networks (pages 759–773)

      Changsha Ma, Kaiping Xue and Peilin Hong

      Version of Record online: 30 APR 2013 | DOI: 10.1002/sec.777

      Thumbnail image of graphical abstract

      The architecture of adaptive privacy-preserved distributed access control schemes for WSNs.

    7. Binary and prime field multiplication for public key cryptography on embedded microprocessors (pages 774–787)

      Hwajeong Seo, Yeoncheol Lee, Hyunjin Kim, Taehwan Park and Howon Kim

      Version of Record online: 9 MAY 2013 | DOI: 10.1002/sec.779

      Thumbnail image of graphical abstract

      In this paper, we focus on a further optimization of binary and prime field multiplication, using several innovative methods: carry-once, optimized multiplication and accumulation, unbalanced comb, and optimized comb-window. These methods yield further performance improvements of 2%, 17%, 4.5%, and 9.5%, respectively, on representative modern microprocessors including ATmega128 and MSP430.

    8. Optimal incentive policy in delay tolerant networks with limited cost (pages 788–799)

      Yahui Wu, Su Deng and Hongbin Huang

      Version of Record online: 19 APR 2013 | DOI: 10.1002/sec.781

      Thumbnail image of graphical abstract

      The main objective of this paper is to explore efficient incentive policies for the source to use its limited cost (maximal fees that the source can afford is limited) to maximize the probability that the destination obtains the message before the deadline of the message.

      We explore the optimal incentive policy through Pontryagin's maximal principle and prove that the optimal policy conforms to threshold form in certain cases.

    9. A blind chaos-based watermarking technique (pages 800–811)

      Mohammad Ghebleh, Ali Kanso and Hala S. Own

      Version of Record online: 30 APR 2013 | DOI: 10.1002/sec.783

      Thumbnail image of graphical abstract

      A blind frequency domain watermarking scheme is proposed to embed a black and white logo. Each watermark bit is embedded into a small block of selected second level subbands of the host image. This image demonstrates the scaled absolute difference between a host image (Lena) and its resulting watermarked image.

SEARCH

SEARCH BY CITATION