Security and Communication Networks

Cover image for Vol. 6 Issue 5

May 2013

Volume 6, Issue 5

Pages i–iv, 549–668

  1. Issue Information

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

      Version of Record online: 11 APR 2013 | DOI: 10.1002/sec.657

  2. Review Article

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    5. Call for Papers
    1. Analysis on the generalization of proxy signature (pages 549–566)

      Namita Tiwari and Sahadeo Padhye

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

      Thumbnail image of graphical abstract

      In this article, we cover the research progress made on proxy signature and investigate its relationships with other existing signature schemes having continuous progress until now. We also provide real-world scenarios, to understand better the situations, where these schemes are applicable for security purposes. We analyze the security properties of existing schemes and make a comparison among them on the basis of different number theoretic problems. Some open problems are also discussed, to the best of our knowledge.

  3. Research Articles

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    5. Call for Papers
    1. Classifying malicious activities in Honeynets using entropy and volume-based thresholds (pages 567–583)

      Mohammed H. Sqalli, Syed Naeem Firdous, Khaled Salah and Marwan Abu-Amara

      Version of Record online: 3 JUL 2012 | DOI: 10.1002/sec.575

      Thumbnail image of graphical abstract

      The aim of this work is to use an anomaly detection technique to classify different types of malicious activities present in Honeynets with application of entropy-based and traffic volume distributions. The behavior of various anomalies or malicious activities is classified using the selected features and their respective threshold values. Finally, we propose a mapping between the various anomalies and their associated behavior, which can be further used to identify similar anomalies in other Honeynet data sets.

    2. Hash function-based secret sharing scheme designs (pages 584–592)

      Chi Sing Chum and Xiaowen Zhang

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

      Thumbnail image of graphical abstract

      With the cryptographic hash functions and the idea of the herding hash technique, we introduce a new construction for a (t + 1, n) threshold secret sharing scheme, which is ideal and perfect. The method, consisting of efficient setup and secret recovering, can be extended to realize any access structure. The scheme can be further implemented as proactive and verifiable effectively.

    3. Efficient pairing-free provably secure identity-based proxy blind signature scheme (pages 593–601)

      Zuowen Tan

      Version of Record online: 25 JUN 2012 | DOI: 10.1002/sec.582

      Thumbnail image of graphical abstract

      In this paper, we propose an identity-based pairing free proxy blind signature scheme. The proxy blind signature scheme is provably secure upon the discrete logarithm assumptions in the random oracle model. Compared with other proxy blind signature schemes in the literature, the proposed proxy blind signature scheme is more efficient.

    4. Certificateless broadcast authentication for vehicular ad hoc networks (pages 602–611)

      Eun-Kyung Ryu and Kee-Young Yoo

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

      Thumbnail image of graphical abstract

      We propose a new certificateless broadcast authentication scheme for securing beacon messages in vehicular networks, which uses the mechanism of Schnorr signature as an underlying primitive. The main goal of our scheme is not to impose the requirement of the public key infrastructure that makes existing schemes impractical. We also show how the scheme can be extended to provide a practical solution for the problem of key distribution in general-purpose vehicular applications.

    5. Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes (pages 612–630)

      Jingqiang Lin, Peng Liu, Jiwu Jing and Qiongxiao Wang

      Version of Record online: 13 NOV 2012 | DOI: 10.1002/sec.593

      Thumbnail image of graphical abstract

      To provide self-contained Byzantine fault tolerant storage services of self-verifying data, two server protocols integrating of Byzantine quorum systems (BQSs) and threshold signature schemes (TSSs) are proposed in the literature. Motivated by failures in finding a third of valid server protocols, we study the reverse problem and formally prove that it is impossible to find any third family of valid TSS-BQS systems. Two families of server protocols deduced from this theory, match the existing ones.

    6. A new certificateless authenticated key agreement protocol for SIP with different KGCs (pages 631–643)

      Xiaowei Li, Yuqing Zhang and Geifei Zhang

      Version of Record online: 5 JUL 2012 | DOI: 10.1002/sec.595

      Thumbnail image of graphical abstract

      We propose a new certificateless authentication key agreement protocol. The new scheme is based on different Key Generation Centers. A formal security analysis of the proposed scheme is given. It has good performance compared with the corresponding schemes.

    7. Secured and fast handoff in wireless mesh networks (pages 644–657)

      Faouzi Zarai, Ikbel Daly, Mohammad S. Obaidat, Fellow of IEEE, Fellow of SCS and Lotfi Kamoun

      Version of Record online: 5 JUL 2012 | DOI: 10.1002/sec.596

      Thumbnail image of graphical abstract

      Although wireless mesh networks continue to develop, several works are being proposed to secure access to network during the handoff phase. Our contribution in solving this problem consists of proposing a reauthentication protocol that makes it possible to identify the legitimate clients and routers from the intruders. The suggested solution proves its effectiveness following the studies of simulation that are carried out according to different criteria handoff latency, loss and blocking rate, and in cases of mobility stations and routers.

    8. A post-quantum provable data possession protocol in cloud (pages 658–667)

      Liang Chen, Lansheng Han, Jiandu Jing and Dongping Hu

      Version of Record online: 22 FEB 2013 | DOI: 10.1002/sec.691

      Thumbnail image of graphical abstract

      This paper proposes a homomorphic hash-based provable data possession protocol (HH-PDP) from ideal lattice assumptions. We prove that the proposed protocol guarantees data possession in the standard model if the shortest polynomial problem is hard. Experimental result shows that HH-PDP is approximate five times lower in cost in preprocessing and checking proof, half the cost in generating proof compared with the most efficient PDP proposed by Ateniese et al. in 2011.

  4. Call for Papers

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Articles
    5. Call for Papers
    1. Call for Papers for Special Issue on Trusted Network Computing (page 668)

      Yulei Wu, Guojun Wang, Geyong Min and Ahmed Al-Dubai

      Version of Record online: 5 JUL 2012 | DOI: 10.1002/sec.594

SEARCH

SEARCH BY CITATION