Security and Communication Networks

Cover image for Vol. 8 Issue 8

Early View (Online Version of Record published before inclusion in an issue)

Edited By: Hsiao-Hwa Chen and Hamid R. Sharif

Impact Factor: 0.433

ISI Journal Citation Reports © Ranking: 2013: 66/78 (Telecommunications); 116/135 (Computer Science Information Systems)

Online ISSN: 1939-0122

  1. Research Article

    1. A remote attestation protocol with Trusted Platform Modules (TPMs) in wireless sensor networks

      Hailun Tan, Wen Hu and Sanjay Jha

      Article first published online: 28 JAN 2015 | DOI: 10.1002/sec.1162

      Thumbnail image of graphical abstract

      This paper implements the remote attestation protocol with the hardware Trusted Platform Module. It can defend several memory-based attacks. In addition, we have provided the extensive evaluations for this protocol.

  2. Special Issue

    1. CDMCR: multi-level fault-tolerant system for distributed applications in cloud

      Weizhong Qiang, Changqing Jiang, Longbo Ran, Deqing Zou and Hai Jin

      Article first published online: 28 JAN 2015 | DOI: 10.1002/sec.1187

      Thumbnail image of graphical abstract

      A multi-level fault-tolerant system for distributed applications in cloud named CDMCR is presented. The CDMCR system backups the complete state of applications periodically with a snapshot-based distributed checkpointing protocol, including file system state. Thus, not only the processes can be recovered, but also the related data can be roll-backed. A multi-level recovery strategy is proposed, which includes process-level recovery, virtual machine recreation, and host rescheduling, enabling comprehensive and efficient fault tolerance for different components in cloud.

  3. Review Article

    1. Mathematical modeling of the propagation of malware: a review

      Angel Martín del Rey

      Article first published online: 28 JAN 2015 | DOI: 10.1002/sec.1186

      Thumbnail image of graphical abstract

      The majority of mathematical models proposed to simulate malware spreading are based on ordinary differential equations. These models do not take into account the individual characteristics of the devices and it is not possible to simulate the individual dynamic of the system. The use of models bases on cellular automata or agent-based models is proposed to overcome these drawbacks.

  4. Review Articles

    1. A survey on reversible watermarking techniques for relational databases

      Saman Iftikhar, M. Kamran and Zahid Anwar

      Article first published online: 28 JAN 2015 | DOI: 10.1002/sec.1196

      Thumbnail image of graphical abstract

      Distortion-based reversible watermarking techniques introduce less distortion in the underlying data and are highly robust against malicious attacks. Distortion-free fragile watermarking techniques introduce zero distortion in the underlying data and are not robust against malicious attacks. Distortion-free robust watermarking techniques introduce zero distortion in the underlying data and are less robust against malicious attacks.

  5. Research Article

    1. A general two-party bi-input private function evaluation protocol

      Yi Sun and Qiaoyan Wen

      Article first published online: 28 JAN 2015 | DOI: 10.1002/sec.1197

      Thumbnail image of graphical abstract

      In this paper, we further consider a general case, two-party bi-input private function evaluation, where P1 holds a private input x while P2 holds a private input y as well as the circuit Cf, and their goal is to securely compute Cf(x,y) without revealing x, y, and Cf.

  6. Special Issue Paper

    1. SAKE: scalable authenticated key exchange for mobile e-health networks

      Weiran Liu, Jianwei Liu, Qianhong Wu, Willy Susilo, Hua Deng and Bo Qin

      Article first published online: 28 JAN 2015 | DOI: 10.1002/sec.1198

      Thumbnail image of graphical abstract

      We model Mobile e-Health Networks (MHN) and formalize a hierarchical network architecture mirroring MHNs in the real world. We present a virtual MHN architecture and propose an efficient authenticated key exchange framework based on the virtual MHN architecture to secure MHNs. Theoretical analyses and experimental results show that scalable authenticated key exchange is secure and scalable, and hence is practical for MHNs.

  7. Research Articles

    1. A framework for protecting personal information and privacy

      Hongying Zheng, Quan Yuan and Jianyong Chen

      Article first published online: 26 JAN 2015 | DOI: 10.1002/sec.1212

      Thumbnail image of graphical abstract

      A privacy protection model is proposed to evaluate property risk of users. Sensitivity of the property and requester's level of assurance are taken into account. Sensitivity of the property can be effectively evaluated by expectation-maximization algorithm.

    2. A second preimage attack on zipper hash

      Shiwei Chen and Chenhui Jin

      Article first published online: 26 JAN 2015 | DOI: 10.1002/sec.1210

      Thumbnail image of graphical abstract

      In this paper, we develop a new technique called inverse-diamond structure, which starts from one fixed point and ends with many points to guarantee that the corresponding message blocks in the two passes be identical. Then, combining the multicollision, with the expandable message and the inverse-diamond structure together, we present a second preimage attack on zipper hash, which is the first valid result of the second preimage attack on it.

    3. Differential fault attack on Zorro block cipher

      Danping Shi, Lei Hu, Ling Song and Siwei Sun

      Article first published online: 26 JAN 2015 | DOI: 10.1002/sec.1207

      Thumbnail image of graphical abstract

      We propose a differential fault attack on block cipher Zorro, which is presented at the CHES 2013 conference. With two fault injections in the 20th round, a candidate set for the key with at most224 elements can be efficiently obtained in a low time complexity with a probability of at least 96.29%. In this attack, the position of the fault can be easily determined by the difference of the correct and the faulty ciphertexts.

    4. Improved Biba model based on trusted computing

      Gang Liu, Jing Zhang, Jinhui Liu and Yuan Zhang

      Article first published online: 26 JAN 2015 | DOI: 10.1002/sec.1201

      Thumbnail image of graphical abstract

      Biba model is hard to implement because the rules are too strict to meet the flexibility of system. To enhance the flexibility, the low-water-mark policy based on Biba model is proposed by supporting the dynamic change of subject tags. However, the biggest drawback of low-water-mark policy is that the integrity level of the subjects in a system decreases monotonously, which results that some subjects cannot access most of the objects and the system life cycle is cut down. An improved model is proposed based on the Biba model, which not only describes the infection degree of subjects by separating the subject into uninfected and infected subjects and introducing the confidence interval but also reduces the decline rate of integrity level of the subject and prolongs the life time cycle by adopting trusted computing to adjust subject tags. Theory analysis and experiment show that the improved model enhances the availability of system.

    5. New efficient batch verification for an identity-based signature scheme

      Jung Yeon Hwang, Doo Ho Choi, Hyunsook Cho and Boyeon Song

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1194

      Thumbnail image of graphical abstract

      We propose a new efficient batch verifier for an identity-based signature (IBS) scheme. We also prove formally that the proposed batch verifier is secure. Then, we analyze the computation cost of the proposed batch verifier using concrete parameters and compare it with well-known batch verifiers. The comparison shows that our batch verifier can significantly outperform the existing batch verifiers of IBS schemes in terms of computation.

  8. Special Issue Papers

    1. A formal analysis of Trusted Platform Module 2.0 hash-based message authentication code authorization under digital rights management scenario

      Fajiang Yu, Huanguo Zhang, Bo Zhao, Juan Wang, Liqiang Zhang, Fei Yan and Zhenlin Chen

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1193

      Thumbnail image of graphical abstract

      The authors use the typed pi calculus to describe the Trusted Platform Module (TPM) 2.0 hash-based message authentication code authorization and its security properties under the digital rights management scenario, and use ProVerify to reason that the key handle manipulation attack for TPM 1.2 does not exist anymore in TPM 2.0. But the vulnerability of key blob substitution still exists in TPM 2.0.

  9. Research Articles

    1. Analysis of the information theoretically secret key agreement by public discussion

      Qiuhua Wang, Xiaojun Wang, Qiuyun Lv, Xueyi Ye, Yi Luo and Lin You

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1192

      Thumbnail image of graphical abstract

      This contribution analyzes the restrictive relationship among three phases of the information theoretically secret key agreement by public discussion. In this paper, the Winnow protocol is analyzed in detail for the first time, and the mutual restrictive relationship between the parameters of the advantage distillation phase and the information reconciliation phase is also presented. The selection of parameters in advantage distillation and information reconciliation phases to maximize the total secret key agreement efficiency is further addressed.

    2. PDA: a privacy-preserving dual-functional aggregation scheme for smart grid communications

      Chen Li, Rongxing Lu, Hui Li, Le Chen and Jie Chen

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1191

      Thumbnail image of graphical abstract

      A privacy-preserving dual functional aggregation (PDA) scheme for smart grid communication is proposed in this paper. The proposed PDA scheme can not only protect users' private data from detecting by a CPA, but also achieve dual functional aggregation. To the best of our knowledge, PDA is the first dual functional aggregation scheme from lattice, and compared with previous single function aggregation schemes, PDA is low in both computation cost and communication overhead.

  10. Special Issue Papers

    1. An approach of security testing for third-party component based on state mutation

      Jinfu Chen, Jiamei Chen, Rubing Huang, Yuchi Guo and Yongzhao Zhan

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1189

      Thumbnail image of graphical abstract

      In this paper, two test cases generation algorithms are proposed on the basis of state mutation and extended finite state machine, that is, Operations Conflict Sequences Generation Algorithm and Conditions Conflict Sequences Generation Algorithm, which are designed to generate inaccessible sequences of behavior and condition conflicts. These conflict sequences are run. Furthermore, the security detecting algorithms are addressed to detect implicit vulnerabilities of third-party components, and then, testing report of component security is obtained.

  11. Research Articles

    1. RAND - STEG: an integer wavelet transform domain digital image random steganography using knight's tour

      V. Thanikaiselvan and P. Arulmozhivarman

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1185

      Thumbnail image of graphical abstract

      In this paper, a new steganography method with constant bit embedding and adaptive bit embedding in Haar Integer Wavelet Transform domain is proposed. The adaptive bit embedding provides more security than the constant bit embedding. Multiple security is ensured by formulating Knight's Tour algorithm for random traversing and selecting the order of sub-bands to provide high capacity, security, and robustness.

    2. A resilient identity-based authenticated key exchange protocol

      Ibrahim Elashry, Yi Mu and Willy Susilo

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1172

      Thumbnail image of graphical abstract

      We present a new security notion for key exchange (KE) protocols called resiliency. That is, if a shared secret between two parties P1 and P2 is compromised or leaked, they can generate another completely new shared secret without the need to set up a new KE session. We present an identity-based authenticated KE protocol that satisfies the resiliency security property.

    3. An enhanced authentication protocol for WRANs in TV white space

      Cong Wang, Maode Ma and Zenghua Zhao

      Article first published online: 23 JAN 2015 | DOI: 10.1002/sec.1171

      Thumbnail image of graphical abstract

      The drawbacks of the authentication protocol in IEEE 802.22 standard has been explored followed by the presentation of the proposed enhanced authentication protocol (ECA). The ECA protocol has been evaluated in terms of security functionality and the performance.

    4. New packing method in somewhat homomorphic encryption and its applications

      Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama and Takeshi Koshiba

      Article first published online: 12 JAN 2015 | DOI: 10.1002/sec.1164

      Thumbnail image of graphical abstract

      New packing method in somewhat homomorphic encryption and its applicationsMasaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama and Takeshi Koshiba The figure shows an overview of our secure protocol for privacy-preserving biometric authentication by homomorphic encryption.

    5. A test of intrusion alert filtering based on network information

      Teodor Sommestad and Ulrik Franke

      Article first published online: 9 JAN 2015 | DOI: 10.1002/sec.1173

      Thumbnail image of graphical abstract

      This paper presents a test of 18 filters that use static properties of a computer network (e.g., its software vulnerabilities) to reduce the number of false alarms produced by a signature-based intrusion detection system. None of the filters are able to increase precision without significantly reduced recall.

SEARCH

SEARCH BY CITATION