Security and Communication Networks

Cover image for Vol. 7 Issue 8

August 2014

Volume 7, Issue 8

Pages i–iii, 1189–1309

  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–iii)

      Version of Record online: 25 JUL 2014 | DOI: 10.1002/sec.890

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. A security key distribution scheme based on energy efficiency for hybrid wireless sensor networks (pages 1189–1198)

      Jie Huang and Bei Huang

      Version of Record online: 26 FEB 2013 | DOI: 10.1002/sec.700

      Thumbnail image of graphical abstract

      In this paper, at first, the number range of cluster heads is determined according to the change of the average path length with the probability that the nodes are selected as the cluster heads. Next, a novel security mechanism is respectively proposed for the vital link and the ordinary link. At last, in order to balance the energy consumption over all nodes, a selecting cluster head algorithm is proposed to rotate periodically cluster heads.

    2. The design and implementation of a secure CAPTCHA against man-in-the-middle attacks (pages 1199–1209)

      Umberto Ferraro Petrillo, Giovanni Mastroianni and Ivan Visconti

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

      Thumbnail image of graphical abstract

      A novel cryptographic protocol for dealing with man-in-the-middle CAPTCHA attacks, based on the use of a family of collision-resistant hash functions modeled as random oracles, is proposed. The security of the protocol is proved through a formal analysis. The real feasibility of the proposed protocol has been explored by developing a reference implementation.

    3. A secure authentication scheme for session initiation protocol by using ECC on the basis of the Tang and Liu scheme (pages 1210–1218)

      Azeem Irshad, Muhammad Sher, Muhammad Shahzad Faisal, Anwer Ghani, Mahmood Ul Hassan and Shehzad Ashraf Ch

      Version of Record online: 10 JUL 2013 | DOI: 10.1002/sec.834

      Thumbnail image of graphical abstract

      Session initiation protocol provides the basis for establishing the voice over internet protocol sessions after the authentication and exchange of signaling messages. In this regard, a recently proposed scheme by Tang and Liu (2012) has been found under threat by an adversary that may impersonate a server if the user password gets compromised. We have proposed an improved protocol for session initiation protocol authentication by using elliptic curve cryptography that encounters this threat with enhanced security.

    4. RCCA security for KEM+DEM style hybrid encryptions and a general hybrid paradigm from RCCA-secure KEMs to CCA-secure encryptions (pages 1219–1231)

      Chen Yuan and Dong Qingkuan

      Version of Record online: 1 SEP 2013 | DOI: 10.1002/sec.853

      Thumbnail image of graphical abstract

      This paper adapts replayable chosen-ciphertext attack security to the most popular hybrid paradigms, KEM+DEM and Tag-KEM/DEM. We find some interesting results for Tag-KEM/DEM and introduce a new hybrid paradigm, named as KEM/Tag-DEM, where the ciphertext of KEM is used as a tag for Tag-DEM scheme rather than reversely in Tag-KEM/DEM.

    5. PPGJ: A privacy-preserving general join for outsourced encrypted database (pages 1232–1244)

      Sha Ma, Bo Yang and Mingwu Zhang

      Version of Record online: 24 OCT 2013 | DOI: 10.1002/sec.854

      Thumbnail image of graphical abstract

      We propose a solution of a privacy-preserving general join supporting both equality test and simple non-equality tests on ciphertexts by using the revised Boneh–Goh–Nissim encryption algorithm and a Bloom filter. Finally, we analyze its advantages and disadvantages by comparing the existing method on the performance and the newly introduced security notions.

    6. Secret sharing scheme with dynamic size of shares for distributed storage system (pages 1245–1252)

      Bo Wang, Jianyong Chen, Songsong Jia, Chunli Lv, Xiaomin Wang and Hongying Zheng

      Version of Record online: 15 AUG 2013 | DOI: 10.1002/sec.856

      Thumbnail image of graphical abstract

      We proposed a novel iterative scheme based on a modified secret sharing scheme to partition one file into file shares with different sizes. User could store only one small piece of share personally, such as smart phone, as a secret key and let other shares stored and transmitted at cloud platform, while user data stay secret.

    7. An efficient fair UC-secure protocol for two-party computation (pages 1253–1263)

      Ou Ruan, Jing Chen, Jing Zhou, Yongquan Cui and Mingwu Zhang

      Version of Record online: 26 JUL 2013 | DOI: 10.1002/sec.857

      Thumbnail image of graphical abstract

      In this paper, we propose an efficient fair universally composable (UC)-secure Yao's garbled circuit protocol for secure 2PC in the malicious model, which does not require any third party and is more efficient than any other fair secure Yao's protocols within the standard simulation framework. Furthermore, the security is proven within the UC framework; thus, our protocol is more secure than other fair Yao's protocols.

    8. A practical anonymous authentication protocol for wireless roaming (pages 1264–1273)

      Qi Xie, Xiao Tan, Duncan S. Wong, Guilin Wang, Mengjie Bao and Na Dong

      Version of Record online: 28 NOV 2013 | DOI: 10.1002/sec.858

      Thumbnail image of graphical abstract

      In this paper, we demonstrate the adversarial model of anonymous authentication protocol for wireless roaming and show that the Hsieh-Leu scheme does not provide user privacy and is vulnerable to off-line password guessing attack. To fix these weaknesses, we propose a new practical scheme and use the formal verification tool ProVerif to prove its security. The experimental results confirm that the proposed scheme achieves many desirable properties and provides robustness against all those attacks that the Hsieh-Leu protocol does not resist.

    9. Equivalent public keys and a key substitution attack on the schemes from vector decomposition (pages 1274–1282)

      Seongan Lim, Eunjeong Lee and Cheol-Min Park

      Version of Record online: 1 SEP 2013 | DOI: 10.1002/sec.860

      Thumbnail image of graphical abstract

      Most of public key cryptographic schemes assume that there are one-to-one correspondences among the set of users, public keys, and private keys. It is easy to check if two public keys correspond to the same user (or private key). However, we found that this does not hold for recent public key cryptographic schemes based on the vector decomposition problem(VDP). In this paper, we introduce the notion of equivalent public keys and formalize a security issue from the existence of equivalent public keys and investigate the security impacts of the equivalent public keys in the schemes based on the VDP. We also present a strong key substitution attack to the signature scheme based on the VDP.

    10. Steganalysis of least significant bit matching using multi-order differences (pages 1283–1291)

      Zhihua Xia, Xinhui Wang, Xingming Sun and Baowei Wang

      Version of Record online: 16 AUG 2013 | DOI: 10.1002/sec.864

      Thumbnail image of graphical abstract

      A learning-based steganalysis method is proposed in this paper. In the training process, feature vectors are extracted from original image set and stego image set with a certain “feature extraction” method. The images are represented by these feature vectors. Then the extracted feature vectors are used to train a “classifier” with a certain classification algorithm such as support vector machine. In the testing process, we first extract the feature vector with the same extraction method from the testing image. Then the classifier is used to judge whether the feature vector is extracted from a stego image or not. Feature extraction is key for learning-based steganalysis. In this paper, we calculate multi-order differences horizontally and vertically. Then co-occurrence matrix is used to model the difference to extract features.

    11. Merkle tree-based wormhole attack avoidance mechanism in low power and lossy network based networks (pages 1292–1309)

      Faraz Idris Khan, Taeshik Shon, Taekkyeun Lee and Ki-Hyung Kim

      Version of Record online: 13 MAY 2014 | DOI: 10.1002/sec.1023

      Thumbnail image of graphical abstract

      Wormhole attack is a devastating attack that haunts the network managers because of its severe effects. Lately, wormhole attack is been possible in low power and lossy network (LLN), because of the scarcity of resources in LLN-based networks. The effects of wormhole are more severe and lead to situations where it is difficult to diagnose the network. In order to tackle this, we propose a resilient Merkle tree based mechanism that avoids wormhole in the LLN-based networks. Simulation results suggest improvements in network performance and conservation of network resources, which is crucial for LLN-based networks.

SEARCH

SEARCH BY CITATION