Security and Communication Networks

Cover image for Vol. 5 Issue 7

July 2012

Volume 5, Issue 7

Pages 709–830

  1. Research Articles

    1. Top of page
    2. Research Articles
    1. SYN flooding attack detection by TCP handshake anomalies (pages 709–724)

      Martine Bellaïche and Jean-Charles Grégoire

      Version of Record online: 16 AUG 2011 | DOI: 10.1002/sec.365

      Thumbnail image of graphical abstract

      We present an original approach to identify SYN flooding attacks from the victim's side, based on a classification of the different forms TCP handshakes can take during a connection set-up between a client and a server. We first identify the unusual handshake sequences that result from an attack, and show how such observations can be used for attack detection. Finally, we analyze the effectiveness of such TCP handshake monitoring to identify the presence of attacks by applying it to real traffic traces.

    2. A private online system for executing wills based on a secret sharing mechanism (pages 725–737)

      Chin-Ling Chen, Cheng-Chi Lee, Yuh-Min Tseng and Teng-Tai Chou

      Version of Record online: 24 AUG 2011 | DOI: 10.1002/sec.367

      Thumbnail image of graphical abstract

      The proposed scheme combines the convenience of the Internet with cryptology technologies to solve the security problems of the online wills. It not only reduces cost and improves performance, but also prevents family infighting.

    3. Virtual network stacks: from theory to practice (pages 738–751)

      Alfredo Matos, Rui Ferreira, Susana Sargento and Rui L. Aguiar

      Version of Record online: 19 OCT 2011 | DOI: 10.1002/sec.368

      Thumbnail image of graphical abstract

      Different solutions have come to adopt pseudonyms as a privacy preserving mechanism. However, as the user resorts to different devices, connections and services, there is the impending risk of correlation between different pseudonyms. Therefore, pseudonymity must follow certain rules, both conceptual and practical, which we explore through an in-depth evaluation of pseudonymity mechanisms, resulting in a conceptual framework, instantiated in an experimental prototype.

    4. Secured hierarchical secret sharing using ECC based signcryption (pages 752–763)

      Atanu Basu, Indranil Sengupta and Jamuna Kanta Sing

      Version of Record online: 21 SEP 2011 | DOI: 10.1002/sec.370

      Thumbnail image of graphical abstract

      Most of the existing unconditionally secured hierarchical secret-sharing schemes cannot prevent cheating or malicious attacks from different types of adversaries particularly when the shares are transmitted through the wireless unsecured medium. In this scheme, a lightweight secured hierarchical secret-sharing scheme has been proposed using elliptic curve cryptography-based signcryption scheme where the shares are delegated to all levels qualitatively and the adversaries cannot reconstruct the secret key. The participants may use resource-constrained wireless mobile devices in this scheme.

    5. Practical round-optimal blind signatures without random oracles or non-interactive zero-knowledge proofs (pages 764–775)

      Yuan Zhou and Haifeng Qian

      Version of Record online: 1 SEP 2011 | DOI: 10.1002/sec.371

      Thumbnail image of graphical abstract

      Blind signature is the basis of many complex cryptographic systems including e-payment. The paper presents the first round-optimal blind signatures without random oracles or non-interactive zero-knowledge proofs. The proposed blind signature scheme achieves concurrent security and perfect blindness while preserving the efficiency of computation and communication.

    6. VeriEST: verification via primary user emulation signal-based test for secure distributed spectrum sensing in cognitive radio networks (pages 776–788)

      Mihui Kim, Min Young Chung and Hyunseung Choo

      Version of Record online: 21 SEP 2011 | DOI: 10.1002/sec.372

      Thumbnail image of graphical abstract

      This paper proposes a verification framework utilizing primary user emulation signals that can be applied to existing distributed spectrum sensing (DSS) schemes in cognitive radio networks. This will reinforce the robustness against forged sensing values. This paper develops a concrete verification scheme based on this framework and an existing secure DSS scheme, and then evaluates our approach via in-depth simulation and analysis compared with the existing scheme. Results show that our approach improves sensing accuracy and fusion speed in the cases of attack.

    7. Energy efficiency of encryption schemes applied to wireless sensor networks (pages 789–808)

      Xueying Zhang, Howard M. Heys and Cheng Li

      Version of Record online: 21 SEP 2011 | DOI: 10.1002/sec.375

      Thumbnail image of graphical abstract

      In this paper, we focus on the energy efficiency of secure communication in wireless sensor networks (WSNs). Our research considers link layer security of WSNs, investigating both the ciphers and the cryptographic implementation schemes, including aspects such as the cipher mode of operation and the establishment of initialization vectors (IVs). We evaluate the computational energy efficiency of different symmetric key ciphers considering both the algorithm characteristics and the effect of channel quality on cipher synchronization.

    8. CSP-DHIES: a new public-key encryption scheme from matrix conjugation (pages 809–822)

      Ping Pan, Lihua Wang, Licheng Wang, Lixiang Li and Yixian Yang

      Version of Record online: 3 OCT 2011 | DOI: 10.1002/sec.376

      Thumbnail image of graphical abstract

      We propose a new public-key cryptosystem named conjugacy search problem-based Diffie-Hellman integrated encryption scheme (CSP-DHIES), which can be viewed as the first non-communicative variant of the well-known DHIES cryptosystem. Under the assumption of the intractability of the CSP-based oracle Diffie-Hellman problem, our scheme is provably secure against chosen-ciphertext attacks in the standard model. We also discuss the possibility of implementing our proposal using braid groups.

    9. Secure and efficient dynamic program update in wireless sensor networks (pages 823–830)

      Daojing He, Sammy Chan, Chun Chen and Jiajun Bu

      Version of Record online: 3 OCT 2011 | DOI: 10.1002/sec.377

      Thumbnail image of graphical abstract

      The key findings presented in the paper are as follows: (1) One new attack that is general and makes the previous program update protocols even more vulnerable is reported. (2) As a remedy, two simple countermeasures are suggested to defend against all these attacks.