IEEE Transactions on Dependable and Secure Computing

Issue 3 • July-Sept. 2007

Filter Results

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

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

    Publication Year: 2007, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (80 KB)
    Freely Available from IEEE
  • A New Biometric Technology Based on Mouse Dynamics

    Publication Year: 2007, Page(s):165 - 179
    Cited by:  Papers (107)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6346 KB) | HTML iconHTML

    In this paper, we introduce a new form of behavioral biometrics based on mouse dynamics, which can be used in different security applications. We develop a technique that can be used to model the behavioral characteristics from the captured data using artificial neural networks. In addition, we present an architecture and implementation for the detector, which cover all the phases of the biometric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock

    Publication Year: 2007, Page(s):180 - 190
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (777 KB) | HTML iconHTML

    A synchronizer with a phase counter (sometimes called asynchronous phase clock) is an asynchronous distributed algorithm, where each node maintains a local "pulse counter" that simulates the global clock in a synchronous network. In this paper, we present a time-optimal self-stabilizing scheme for such a synchronizer, assuming unbounded counters. We give a simple rule by which each node can comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keeping Denial-of-Service Attackers in the Dark

    Publication Year: 2007, Page(s):191 - 204
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1849 KB) | HTML iconHTML

    We consider the problem of overcoming (distributed) denial-of-service (DoS) attacks by realistic adversaries that have knowledge of their attack's successfulness, for example, by observing service performance degradation or by eavesdropping on messages or parts thereof. A solution for this problem in a high-speed network environment necessitates lightweight mechanisms for differentiating between v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing a Relative Priority for the Shared-Protection Schemes

    Publication Year: 2007, Page(s):205 - 215
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1210 KB) | HTML iconHTML

    One the of major challenges of optical network operators is ensuring the stringent levels of availability required by their highest class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the shared-protection paths. In this paper, we provide an analytical model for the proposed priority-enabled scheme. As a key distinguishi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One Picture Is Worth a Dozen Connectives: A Fault-Tree Representation of NPATRL Security Requirements

    Publication Year: 2007, Page(s):216 - 227
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2389 KB) | HTML iconHTML

    In this paper, we show how we can increase the ease of reading and writing security requirements for cryptographic protocols at the Dolev-Yao level of abstraction by developing a visual language based on fault trees. We develop such semantics for a subset of NRL protocol analyzer temporal requirements language (NPATRL), a temporal language used for expressing safety requirements for cryptographic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes

    Publication Year: 2007, Page(s):228 - 242
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2879 KB) | HTML iconHTML

    Although a contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications, the existing schemes have not achieved the performance lower bound in terms of time, communication, and computation costs. In this paper, we propose a contributory group key agreement that achieves the performance lower bound by utilizing a novel logical ke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join the IEEE Computer Society

    Publication Year: 2007, Page(s): 243
    Request permission for commercial reuse | PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • 180,000 aritlces in the IEEE Computer Society Digital Library [advertisement]

    Publication Year: 2007, Page(s): 244
    Request permission for commercial reuse | PDF file iconPDF (114 KB)
    Freely Available from IEEE
  • TDSC Information for authors

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

    Publication Year: 2007, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (98 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