By Topic

IEEE Transactions on Dependable and Secure Computing

Issue 3 • Date May-June 2011

Filter Results

Displaying Results 1 - 15 of 15
  • [Front cover]

    Publication Year: 2011, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • A Policy Enforcing Mechanism for Trusted Ad Hoc Networks

    Publication Year: 2011, Page(s):321 - 336
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1929 KB) | HTML iconHTML

    To ensure fair and secure communication in Mobile Ad hoc Networks (MANETs), the applications running in these networks must be regulated by proper communication policies. However, enforcing policies in MANETs is challenging because they lack the infrastructure and trusted entities encountered in traditional distributed systems. This paper presents the design and implementation of a policy enforcin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CASTLE: Continuously Anonymizing Data Streams

    Publication Year: 2011, Page(s):337 - 352
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2627 KB) | HTML iconHTML Multimedia Media

    Most of the existing privacy-preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are continuous, transient, and usually unbounded. Moreover, in streaming applications, there is a need to offer strong guarantees on the maximum allowed delay between incoming data and the corresponding anonymized output. To cop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications

    Publication Year: 2011, Page(s):353 - 362
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2110 KB) | HTML iconHTML

    The classic problem of determining the diagnosability of a given network has been studied extensively. Under the PMC model, this paper addresses the problem of determining the diagnosability of a class of networks called (1,2)-Matching Composition Networks, each of which is constructed by connecting two graphs via one or two perfect matchings. By applying our results to multiprocessor systems, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-Energy Symmetric Key Distribution in Wireless Sensor Networks

    Publication Year: 2011, Page(s):363 - 376
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1402 KB) | HTML iconHTML

    In this work, a scheme for key distribution and network access in a Wireless Sensor Network (WSN) that utilizes Identity-Based Cryptography (IBC) is presented. The scheme is analyzed on the ARM920T processor and measurements were taken for the runtime and energy of its components. It was found that the Tate pairing component of the scheme consumes significant amounts of energy, and so should be po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Detection of Camouflaging Worm

    Publication Year: 2011, Page(s):377 - 390
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1486 KB) | HTML iconHTML

    Active worms pose major security threats to the Internet. This is due to the ability of active worms to propagate in an automated fashion as they continuously compromise computers on the Internet. Active worms evolve during their propagation, and thus, pose great challenges to defend against them. In this paper, we investigate a new class of active worms, referred to as Camouflaging Worm (C-Worm i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovery Device for Real-Time Dual-Redundant Computer Systems

    Publication Year: 2011, Page(s):391 - 403
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2200 KB) | HTML iconHTML

    This paper proposes the design of specialized hardware, called Recovery Device, for a dual-redundant computer system that operates in real-time. Recovery Device executes all fault-tolerant services including fault detection, fault type determination, fault localization, recovery of system after temporary (transient) fault, and reconfiguration of system after permanent fault. The paper also propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability for Networked Storage Nodes

    Publication Year: 2011, Page(s):404 - 418
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3705 KB) | HTML iconHTML

    High-end enterprise storage has traditionally consisted of monolithic systems with customized hardware, multiple redundant components and paths, and no single point of failure. Distributed storage systems realized through networked storage nodes offer several advantages over monolithic systems such as lower cost and increased scalability. In order to achieve reliability goals associated with enter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables

    Publication Year: 2011, Page(s):419 - 433
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2036 KB) | HTML iconHTML

    Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. We characterize tree-based routing DHTs and define MaxDisjoint, a replica placement that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking

    Publication Year: 2011, Page(s):434 - 449
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1207 KB) | HTML iconHTML

    Network-based intruders seldom attack their victims directly from their own computer. Often, they stage their attacks through intermediate “stepping stones” in order to conceal their identity and origin. To identify the source of the attack behind the stepping stone(s), it is necessary to correlate the incoming and outgoing flows or connections of a stepping stone. To resist attempts... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Securing Topology Maintenance Protocols for Sensor Networks

    Publication Year: 2011, Page(s):450 - 465
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1924 KB) | HTML iconHTML

    We analyze the security vulnerabilities of PEAS, ASCENT, and CCP, three well-known topology maintenance protocols (TMPs) for sensor networks. These protocols aim to increase the lifetime of the sensor network by only maintaining a subset of nodes in an active or awake state. The design of these protocols assumes that the sensor nodes will be deployed in a trusted, nonadversarial environment, and d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The F_f-Family of Protocols for RFID-Privacy and Authentication

    Publication Year: 2011, Page(s):466 - 480
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (790 KB) | HTML iconHTML

    In this paper, we present the design of the lightweight Ff family of privacy-preserving authentication protocols for RFID-systems. Ff results from a systematic design based on a new algebraic framework focusing on the security and privacy of RFID authentication protocols. Ff offers user-adjustable, strong authentication, and privacy against known algebraic attacks ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TDSC Information for authors

    Publication Year: 2011, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2011, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE

Aims & Scope

The purpose of TDSC is to publish papers in dependability and security, including the joint consideration of these issues and their interplay with system performance.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Elisa Bertino
CS Department
Purdue University