Security and Communication Networks

Cover image for Vol. 7 Issue 1

January 2014

Volume 7, Issue 1

Pages i–iv, 1–244

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. Issue Information (pages i–iv)

      Article first published online: 26 DEC 2013 | DOI: 10.1002/sec.883

  2. Review Article

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. Securing virtual private LAN service by efficient key management (pages 1–13)

      Madhusanka Liyanage and Andrei Gurtov

      Article first published online: 18 MAR 2013 | DOI: 10.1002/sec.701

      Thumbnail image of graphical abstract

      We proposed a secure and scalable VPLS network VPLS architecture based on Host Identity Protocol. It integrates a session key mechanism with HIP to provide extra security and scalability.

  3. Research Article

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. A scalable certificateless architecture for multicast wireless mesh network using proxy re-encryption (pages 14–32)

      Hongbing Wang, Zhenfu Cao and Lifei Wei

      Article first published online: 30 MAY 2013 | DOI: 10.1002/sec.720

      Thumbnail image of graphical abstract
      1. We propose a novel certificateless architecture for multicast wireless mesh network by exploiting certificateless proxy re-encryption.
      2. The size of transformation ciphertexts is greatly reduced in our methodology.
      3. The scheme used in our architecture is newly constructed, and it is against adaptive chosen-ciphertext attacks in the standard model.
  4. Editorials

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. You have free access to this content
  5. Special Issue Papers

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. Design and implementation of a versatile cryptographic unit for RISC processors (pages 36–52)

      Kazim Yumbul, Erkay Savaş, Övünç Kocabaş and Johann Großschädl

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

      Thumbnail image of graphical abstract

      We design, implement, and realize a cryptographic unit (CU) that can easily be integrated to any reduced instruction set computing-type processor for the safe and efficient execution of cryptographic algorithms. The CU provides new instructions to accelerate cryptographic algorithms, and its associated cost, in terms of area, is justified by the improvement in the performance and efficiency. The CU can also be instrumental in protecting the cryptographic computation against active and passive attacks and other malicious processes running simultaneously.

    2. Algebraic construction of cryptographically good binary linear transformations (pages 53–63)

      Bora Aslan and Muharrem Tolga Sakallı

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

      Thumbnail image of graphical abstract

      In this paper, we propose a new algebraic construction method to generate 8 × 8 and 16 × 16 involutory and non-involutory binary matrices of maximum branch numbers 5 and 8, respectively, which can be used as diffusion layers for block ciphers. By using this construction method, we also show some examples of these constructed matrices.

  6. Research Articles

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. Efficient homomorphic sealed-bid auction free of bid validity check and equality test (pages 64–76)

      Kun Peng

      Article first published online: 17 MAY 2012 | DOI: 10.1002/sec.549

      Two costly operations prevent homomorphic e-auction from being applied to efficiency-sensitive applications. Three new homomorphic e-auction protocols are proposed to get rid of them in homomorphic e-auction. As a result, efficiency of e-auction is greatly improved.

  7. Special Issue Papers

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. On robust key agreement based on public key authentication (pages 77–87)

      Feng Hao

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

      Thumbnail image of graphical abstract

      The paper presents the first comprehensive investigation on the state of the art in public key infrastructure (PKI)-based authenticated key exchange protocols. It uncovers a number of practical and theoretical flaws of existing protocols that were not reported before. In addition, it proposes a new protocol called YAK. Among all the available PKI-based authenticated key exchanges to date, the YAK protocol appears to be the simplest and the most robust.

    2. A secure many-to-many routing protocol for wireless sensor and actuator networks (pages 88–98)

      Son T. Nguyen, Erdal Cayirci and Chunming Rong

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

      Thumbnail image of graphical abstract

      The paper introduces a new secure power aware many-to-many routing protocol for wireless sensor and actuator networks. Sensor nodes can change their power consumption while multicasting data to actuators. The protocol increases energy efficiency and prolongs network life-time while still keeps the communications secure.

  8. Research Articles

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. A UTP approach towards probabilistic protocol verification (pages 99–107)

      Riccardo Bresciani and Andrew Butterfield

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

      Thumbnail image of graphical abstract

      We encode protocol runs as predicates, in the style of the Unifying Theories of Programming, in the form of homogeneous relations between probability distributions on the state space at the beginning and at the end of the protocol. The attacker model is a variation of the classical Dolev–Yao model, where cryptographic primitives can be broken probabilistically. We obtain a lattice of traces, ordered by safety with respect to a given goal.

    2. Exploiting convergence characteristics to tackle collusion attacks in OLSR for Security and Communication Networks (pages 108–122)

      Manoj Singh Gaur, Rajbir Kaur, Lalith P. Suresh and Vijay Laxmi

      Article first published online: 17 APR 2012 | DOI: 10.1002/sec.545

      Thumbnail image of graphical abstract

      Collusion attack in Optimised Link State Routing requires malicious node to be the only multipoint relay (MPR) node of the victim. After its initiation, the attack converges in [TC interval, Topology Holding Time]. A node having only one MPR sends scruple packets to its neighbourhood. Absence or limited presence of acknowledgement of scruple by three-hop neighbours indicates attack. Countermeasure is affected through forcing at least two nodes in MPR set of every node.

  9. Special Issue Papers

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. BioPSTM: a formal model for privacy, security, and trust in template-protecting biometric authentication (pages 123–138)

      Alper Kanak and Ibrahim Sogukpinar

      Article first published online: 5 OCT 2012 | DOI: 10.1002/sec.626

      Thumbnail image of graphical abstract

      BioPSTM presents a formal privacy–security–trust model for biometric identity management systems where the decision makers can see the overall features of any system before deployment. Because it is impossible to foresee the privacy and security threats, the proposed model enables a prediction of privacy–security tradeoff through analyzing equivocation between any pairs of the system components. BioPSTM then reflects the relation between privacy–security tradeoff and trust through public willingness and the weight indicating how much privacy or security is needed practically in a biometric identity management system. The case study presents how BioPSTM can be applied to various biometric applications that have been deployed in 12 countries.

    2. Policy override in practice: model, evaluation, and decision support (pages 139–156)

      Steffen Bartsch

      Article first published online: 16 MAY 2012 | DOI: 10.1002/sec.547

      Thumbnail image of graphical abstract

      Our case study shows that policy override is a promising approach in increasing the flexibility of authorization measures. However, additional technical and non-technical support, such as user guidance, is necessary for effective security.

  10. Editorials

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. You have free access to this content
  11. Special Issue Papers

    1. Top of page
    2. Issue Information
    3. Review Article
    4. Research Article
    5. Editorials
    6. Special Issue Papers
    7. Research Articles
    8. Special Issue Papers
    9. Research Articles
    10. Special Issue Papers
    11. Editorials
    12. Special Issue Papers
    1. Why securing smart grids is not just a straightforward consultancy exercise (pages 160–174)

      Maria B. Line

      Article first published online: 21 FEB 2013 | DOI: 10.1002/sec.703

      Thumbnail image of graphical abstract

      From an information security point of view, certain concerns need to be addressed in order for the implementation of smart grids to succeed: a unified terminology, a fusion of cultures, improved methods for assessing risks in complex and interdependent systems, preserving end users' privacy, securing communications and devices, and being well prepared for managing unwanted incidents in a complex operating environment.

    2. SCADA communication and security issues (pages 175–194)

      Jingcheng Gao, Jing Liu, Bharat Rajan, Rahul Nori, Bo Fu, Yang Xiao, Wei Liang and C. L. Philip Chen

      Article first published online: 24 JAN 2013 | DOI: 10.1002/sec.698

      Thumbnail image of graphical abstract

      We provide a review for many documented standards in SCADA, and we also review its state-of-the-art communication and security aspects.

    3. A framework for intrusion detection system in advanced metering infrastructure (pages 195–205)

      Nasim Beigi Mohammadi, Jelena Mišić, Vojislav B. Mišić and Hamzeh Khazaei

      Article first published online: 28 NOV 2012 | DOI: 10.1002/sec.690

      Thumbnail image of graphical abstract

      Advanced Metering Infrastructure (AMI), one of the key elements in smart grid, facilitates the communication of metering data and control messages. To ensure reliability and security of AMI, attack prevention techniques and intrusion detection systems (IDSs) should be in place. In this paper, we discuss security requirements and vulnerabilities of AMI and review the existing threat prevention and detection solutions. We propose an IDS for neighborhood area network (NAN) in AMI, taking into account the NAN-specific requirements.

    4. On preserving user privacy in Smart Grid advanced metering infrastructure applications (pages 206–220)

      Nico Saputro and Kemal Akkaya

      Article first published online: 18 JAN 2013 | DOI: 10.1002/sec.706

      Thumbnail image of graphical abstract

      In this paper, we provide a thorough survey and propose a classification of the existing efforts to protect user data privacy. We also investigate and compare the impact of privacy solutions on the performance of AMI applications that utilize data aggregation. The results indicated that the end-to-end latency of end-to-end homomorphic aggregation approach is superior to hop-by-hop concatenation and comparable with hop-by-hop aggregation. However, hop-by-hop aggregation does not provide privacy by itself even though it has the lowest bandwidth requirements.

    5. Password-authenticated cluster-based group key agreement for smart grid communication (pages 221–233)

      Hasen Nicanfar and Victor C. M. Leung

      Article first published online: 1 MAR 2013 | DOI: 10.1002/sec.726

      Thumbnail image of graphical abstract

      In this paper, we present an efficient group key (GK) management scheme aimed at securing the group communications, based on the X.1035 standard, and also follow the cluster-based approach to reduce the costs of the GK construction and maintenance for large groups. Our work is motivated by security of the multiparty systems supporting group-based and cloud-based applications that have been proposed in the context of smart grid.

    6. SESA: an efficient searchable encryption scheme for auction in emerging smart grid marketing (pages 234–244)

      Mi Wen, Rongxing Lu, Jingsheng Lei, Hongwei Li, Xiaoghui Liang and Xuemin (Sherman) Shen

      Article first published online: 18 JAN 2013 | DOI: 10.1002/sec.699

      Thumbnail image of graphical abstract

      This paper proposes an efficient searchable encryption scheme for auction (SESA) in emerging smart grid marketing. Specifically, SESA uses a public key encryption with keyword search technique to enable the energy sellers (eg., DERs) to inquire suitable bids, while preserving the privacy of the energys buyers. SESA and its extension, respectively, can support one keyword and conjunctive keywords search.

SEARCH

SEARCH BY CITATION