Security and Communication Networks

Cover image for Vol. 6 Issue 2

February 2013

Volume 6, Issue 2

Pages i–iv, 129–256

  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: 28 JAN 2013 | DOI: 10.1002/sec.654

  2. Review Article

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    1. Information geometric security analysis of differential phase-shift quantum key distribution protocol (pages 129–150)

      Laszlo Gyongyosi and Sandor Imre

      Article first published online: 19 JUN 2012 | DOI: 10.1002/sec.542

      Thumbnail image of graphical abstract

      This paper analyzes the information-theoretical security of the of Differential Phase Shift (DPS) Quantum Key Distribution (QKD) protocol, using efficient computational information geometric algorithms. The protocol was introduced for practical reasons, since the earlier QKD schemes were too complicated to implement in practice. The DPS QKD protocol can be an integrated part of current network security applications; hence its practical implementation is much easier with the current optical devices and optical networks. The proposed algorithm could be a very valuable tool to answer the still open questions related to the security bounds of the DPS QKD protocol.

  3. Research Articles

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    1. Performance enhancement of TinyECC based on multiplication optimizations (pages 151–160)

      Hwajeong Seo, Kyung-Ah Shim and Howon Kim

      Article first published online: 27 JAN 2012 | DOI: 10.1002/sec.422

      Thumbnail image of graphical abstract

      In this paper, we propose a novel multiplication operation based on the cached operands and reordered partial products. The proposed method shows that the latency of the polynomial multiplication, which is the core operation of the ECC, is 6% smaller than previously known results.

    2. Introducing proxy zero-knowledge proof and utilization in anonymous credential systems (pages 161–172)

      Hoda Jannati, Mahmoud Salmasizadeh, Javad Mohajeri and Amir Moradi

      Article first published online: 18 APR 2012 | DOI: 10.1002/sec.543

      Thumbnail image of graphical abstract

      In this paper, we present proxy zero-knowledge proof and utilize it in anonymous credential systems. In our proposed system, if a user cannot directly show a credential issued by an organization, instead of giving the secret key to the proxy, the user generates a proxy key based on the desired credential particularly for the proxy. Therefore, the proxy is neither the owner of the user's credential nor uses his or her other credentials.

    3. More efficient CCA-secure unidirectional proxy re-encryption schemes without random oracles (pages 173–181)

      Hongbing Wang and Zhenfu Cao

      Article first published online: 5 JUN 2012 | DOI: 10.1002/sec.552

      Thumbnail image of graphical abstract

      We present a new efficient adaptive chosen-ciphertext secure proxy re-encryption scheme in the standard model. The scheme has less ciphertext and is different from other proxy re-encryption schemes in that it does need any strong unforgeable one-time signatures

    4. Directional spread-spectrum modulation signal for physical layer security communication applications (pages 182–193)

      Tao Hong, Mao-zhong Song and Yu Liu

      Article first published online: 10 MAY 2012 | DOI: 10.1002/sec.554

      Thumbnail image of graphical abstract

      In this paper, we propose a directional spread-spectrum modulation (DSM) signal transmitted by a switched antenna array for physical layer security communication. The main idea is that the antenna hopping scheme is designed according to a spreading sequence.

    5. A scalable NAT-based solution to Internet access denial by higher-tier ISPs (pages 194–209)

      Marwan Abu-Amara, Abdulaziz Al-Baiz, Ashraf S. Mahmoud, Mohammed H. Sqalli and Farag Azzedin

      Article first published online: 10 MAY 2012 | DOI: 10.1002/sec.557

      Thumbnail image of graphical abstract

      A network address translation-based solution is proposed and used to countermeasure an intentional denial of Internet access by higher-tier Internet service providers. The proposed solution is scalable, is transparent, and has negligible impact on network performance.

    6. Computer virus propagation model based on bounded rationality evolutionary game theory (pages 210–218)

      Cong Jin, Shu-Wei Jin and Hua-Yong Tan

      Article first published online: 9 MAY 2012 | DOI: 10.1002/sec.558

      Thumbnail image of graphical abstract

      In this paper, we proposed the propagation model of the computer virus based on bounded rationality evolutionary game theory. Unlike classical computer virus propagation models, this model was built from the view of the evolutionary game process between normal users and potential attackers, and the loss of the users was also described accurately and quantitatively. By considering bounded rationality and information incomplete of the participators, the proposed model can describe the actual situation of the network virus spreading, and find key factors of influencing the spread of computer viruses on the network.

    7. Enabling interoperation between Shibboleth and Information Card systems (pages 219–229)

      Haitham S. Al-Sinani and Chris J. Mitchell

      Article first published online: 21 JUN 2012 | DOI: 10.1002/sec.560

      Thumbnail image of graphical abstract

      We propose a client-based scheme supporting interoperation between Shibboleth and information card systems such as CardSpace and Higgins. The scheme uses a browser extension and does not require any modifications to CardSpace or Higgins identity selectors, and only minimal changes to relying parties and identity providers. A proof-of-concept prototype is also described.

    8. A high efficient node capture attack algorithm in wireless sensor network based on route minimum key set (pages 230–238)

      Guowei Wu, Xiaojie Chen, Mohammad S. Obaidat and Fellow of IEEE and Chi Lin

      Article first published online: 19 JUN 2012 | DOI: 10.1002/sec.570

      Thumbnail image of graphical abstract

      Greedy node captured based on route minimum key set captures node on the basis of an overlapping value that can be obtained through route minimum key set. The route minimum key set is calculated through the max flow of the flow network.

    9. You have free access to this content
      An unknown malware detection scheme based on the features of graph (pages 239–246)

      Zongqu Zhao, Junfeng Wang and Chonggang Wang

      Article first published online: 28 FEB 2012 | DOI: 10.1002/sec.524

      Thumbnail image of graphical abstract

      To detect the unknown malware, the features of graph-based method are predefined from function call graph of software, and then the rules are built with these features to classify an executable as the benign or the malware. The quantity and the contents of these features are independent of testing dataset, and this peculiarity enables our experiment results to nearly reflect the situation of unknown malware detection. The design can provide a high malware detection accuracy by using a small set of training set.

    10. Authenticated RFID security mechanism based on chaotic maps (pages 247–256)

      Zi-Yao Cheng, Yun Liu, Chin-Chen Chang and Shih-Chang Chang

      Article first published online: 28 JAN 2013 | DOI: 10.1002/sec.709

      Thumbnail image of graphical abstract

      Highlights:

      1. We propose a radio frequency identification (RFID) authentication mechanism on the basis of chaotic maps, which has been analyzed under the security model to withstand various attacks.
      2. The use of our authenticated RFID mechanism achieves constantly secret updating for security concerns.
      3. Our proposed mechanism exhibits higher efficiency than previous approaches that is more suitable for RFID environment.

SEARCH

SEARCH BY CITATION