Security and Communication Networks

Cover image for Vol. 4 Issue 2

February 2011

Volume 4, Issue 2

Pages 109–238, e1–e3

  1. Research Articles

    1. Top of page
    2. Research Articles
    3. Call for Papers
    1. Combating key-swapping collusion attack on random pairwise key pre-distribution schemes for wireless sensor networks (pages 109–121)

      Dai Thanh Tran and Johnson I. Agbinya

      Version of Record online: 1 APR 2009 | DOI: 10.1002/sec.106

      Thumbnail image of graphical abstract

      A light-weight framework based on incremental sensor node deployment and a diversified one-way hash chain for countering key-swapping collusion attack is proposed in the light of two new node capture attack models: sporadic attack and continuous-time attack.

    2. SCCR: a generic approach to simultaneously achieve CCA security and collusion-resistance in proxy re-encryption (pages 122–135)

      Jun Shao, Zhenfu Cao and Peng Liu

      Version of Record online: 6 MAY 2009 | DOI: 10.1002/sec.109

      Thumbnail image of graphical abstract

      By using chosen ciphertext secure (2,2) (identity-based) threshold cryptosystem and the method of key management in identity-based encryption, we propose the first generic construction for chosen ciphertext secure and collusion resistant (identity-based) proxy re-encryption. Hence, we solves several problems in the field of proxy re-encryption.

    3. A potential low-rate DoS attack against network firewalls (pages 136–146)

      K. Salah, K. Sattar, M. Sqalli and Ehab Al-Shaer

      Version of Record online: 12 JUN 2009 | DOI: 10.1002/sec.118

      Thumbnail image of graphical abstract

      We identify a potential Denial of Service (DoS) attack that targets the last-matching rules of a network firewall. The last-matching rules are those rules that require the most processing time by the firewall. If these rules are discovered, an attacker can potentially launch a low-rate DoS attack against the network firewall. We implement a probing technique to remotely discover the last-matching rules of a firewall, and then we examine the impact of launching a low-rate DoS attack on firewall performance.

    4. Synthesis of attack actions using model checking for the verification of security protocols (pages 147–161)

      Stylianos Basagiannis, Panagiotis Katsaros and Andrew Pombortsis

      Version of Record online: 12 JUN 2009 | DOI: 10.1002/sec.119

      Thumbnail image of graphical abstract

      In this work, we propose an alternative intruder model, which is based on a thorough analysis of how potential attacks might proceed. We introduce an intruder model that provides an open-ended base for the integration of multiple basic attack tactics. Those attack tactics have the possibility to be combined, in a way to compose complex attack actions that require a number of procedural steps from the intruder's side, such as a Denial of Service attack.

    5. An efficient random key distribution scheme for large-scale distributed sensor networks (pages 162–180)

      Ashok Kumar Das

      Version of Record online: 30 JUN 2009 | DOI: 10.1002/sec.123

      Thumbnail image of graphical abstract

      In this paper, we propose a new random key pre-distribution scheme for large-scale distributed sensor networks. Our scheme makes use of two disjoint key pools, one is used for initial deployment phase and the other for dynamic node addition phase. Our scheme provides very high network connectivity and better security against node capture compared to that for the existing random key pre-distribution schemes.

    6. Swarm intelligence based key generation for stream cipher (pages 181–194)

      N. K. Sreelaja and G. A. Vijayalakshmi Pai

      Version of Record online: 20 AUG 2009 | DOI: 10.1002/sec.132

      Thumbnail image of graphical abstract

      Swarm intelligence is the emergent collective intelligence of groups of simple autonomous agents. This paper focuses on swarm intelligence based key generation for encryption of plain text using a stream cipher method. The novel technique termed Ant Colony Optimization Key Generation Algorithm (AKGA) employs a character code table for encoding the keys. The advantage of this approach is that it reduces the number of keys to be distributed.

    7. Achieving non-transferability in credential systems using hidden biometrics (pages 195–206)

      Carlisle Adams

      Version of Record online: 28 AUG 2009 | DOI: 10.1002/sec.136

      Thumbnail image of graphical abstract

      In credential systems, which allow the construction of privacy-preserving access control infrastructures in online environments, ‘credential transfer’ occurs when Alice gives her private key to another entity who can then freely use Alice's credentials as if it was his/her own. In this paper we propose a scheme to achieve non-transferability for any malicious, but computationally bounded, legitimate credential owner.

    8. A secure cryptosystem based on affine transformation (pages 207–215)

      Mohsen Toorani and Abolfazl Falahati

      Version of Record online: 14 SEP 2009 | DOI: 10.1002/sec.137

      Thumbnail image of graphical abstract

      A secure symmetric cryptosystem is introduced in this paper that includes a ciphering core and two cryptographic protocols. The ciphering core has an outer structure similar to the Affine Hill cipher but its inner manipulations are different. It is also proved that Lin et al.'s scheme that tried to strengthen the Hill cipher against the known-plaintext attack includes some flaws and is vulnerable to the chosen-ciphertext attack.

    9. Internet epidemiology: healthy, susceptible, infected, quarantined, and recovered (pages 216–238)

      Suleyman Kondakci and Cemali Dincer

      Version of Record online: 5 JAN 2011 | DOI: 10.1002/sec.287

      Thumbnail image of graphical abstract

      An essential work covering a broad analysis of infection propagation, population susceptibility, quarantine, and resource-dependent recovery processes. The article presents a novel theory on the formalization of the phases of infection propagation and recovery processes using a comprehensive stochastic model to describe states of victim nodes in a mathematically rigorous manner. With uniquely defined infection growth and extinction parameters, a recurrent stochastic model consisting of five independently analyzable states is developed in order to determine an overall analysis.

  2. Call for Papers

    1. Top of page
    2. Research Articles
    3. Call for Papers
    1. You have free access to this content
    2. You have free access to this content
    3. You have free access to this content

SEARCH

SEARCH BY CITATION