By Topic

Security and Privacy, 2001. S&P 2001. Proceedings. 2001 IEEE Symposium on

Date 14-16 May 2000

Filter Results

Displaying Results 1 - 21 of 21
  • Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 263
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Data mining methods for detection of new malicious executables

    Publication Year: 2001, Page(s):38 - 49
    Cited by:  Papers (146)  |  Patents (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB) | HTML iconHTML

    A serious security threat today is malicious executables, especially new, unseen malicious executables often arriving as email attachments. These new malicious executables are created at the rate of thousands every year and pose a serious security threat. Current anti-virus systems attempt to detect these new malicious programs with heuristics generated by hand. This approach is costly and oftenti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protection of keys against modification attack

    Publication Year: 2001, Page(s):26 - 36
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB) | HTML iconHTML

    Anderson and Kuhn (1997) described an attack against tamper-resistant devices wherein a secret key stored in EEPROM is compromised using a simple and low-cost attack. The attack consists of setting bits in the EEPROM using low-cost probes and observing the effect on the output of the device. These attacks are extremely general, as they apply to virtually any cryptosystem. The objective of the pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trend analysis of exploitations

    Publication Year: 2001, Page(s):214 - 229
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1920 KB) | HTML iconHTML

    We have conducted an empirical study of a number of computer security exploits and determined that the rates at which incidents involving the exploit are reported to CERT can be modeled using a common mathematical framework. Data associated with three significant exploits involving vulnerabilities in phf, imap, and bind can all be modeled using the formula C=I+S×√M where C is the cumul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networked cryptographic devices resilient to capture

    Publication Year: 2001, Page(s):12 - 25
    Cited by:  Papers (14)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB) | HTML iconHTML

    We present a simple technique by which a device that performs private key operations (signatures or decryptions) in networked applications, and whose local private key is activated with a password or PIN, can be immunized to offline dictionary attacks in case the device is captured. Our techniques do not assume tamper resistance of the device, but rather exploit the networked nature of the device,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On confidentiality and algorithms: programming under the constraints of noninterference

    Publication Year: 2001, Page(s):64 - 77
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB) | HTML iconHTML

    Recent interest in methods for certifying programs for secure information flow (noninterference) have failed to raise a key question: can efficient algorithms be written so as to satisfy the requirements of secure information flow? We discuss how algorithms for searching and sorting can be adapted to work on collections of secret data without leaking any confidential information, either directly, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding trust management systems

    Publication Year: 2001, Page(s):94 - 105
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB) | HTML iconHTML

    We present a mathematical framework for expressing trust management systems. The framework makes it easier to understand existing systems and to compare them to one another as well as to design new systems. The framework defines the semantics of a trust management engine via a least fixpoint in a lattice, which, in some situations, leads to an efficient implementation. To demonstrate its flexibili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal treatment of certificate revocation under communal access control

    Publication Year: 2001, Page(s):116 - 127
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB) | HTML iconHTML

    The conventional approach to distributed access control (AC) tends to be server-centric. Under this approach, each server establishes its own policy regarding the use of its resources and services by its clients. The choice of this policy, and its implementation, are generally considered the prerogative of each individual server. This approach to access control may be appropriate for many current ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptographic key generation from voice

    Publication Year: 2001, Page(s):202 - 213
    Cited by:  Papers (85)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB) | HTML iconHTML

    We propose a technique to reliably generate a cryptographic key from a user's voice while speaking a password. The key resists cryptanalysis even against an attacker who captures all system information related to generating or verifying the cryptographic key. Moreover, the technique is sufficiently robust to enable the user to reliably regenerate the key by uttering her password again. We describe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptographic security for mobile code

    Publication Year: 2001, Page(s):2 - 11
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB) | HTML iconHTML

    We address the protection of mobile code against cheating and potentially malicious hosts. We point out that the recent approach based on computing with “encrypted functions” is limited to the case where only the code originator learns the result of the completion and the host running the code must not notice anything at all. We argue that if the host is to receive some output of the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of public-key-enabled Kerberos authentication in large networks

    Publication Year: 2001, Page(s):170 - 183
    Cited by:  Papers (8)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB) | HTML iconHTML

    Several proposals have been made to public-key-enable various stages of the secret-key-based Kerberos network authentication protocol. The computational requirements of public key cryptography are much higher than those of secret key cryptography, and the substitution of public key encryption algorithms for secret key algorithms impacts performance. This paper uses closed, class-switching queuing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of intrusion detectors: a decision theory approach

    Publication Year: 2001, Page(s):50 - 61
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB) | HTML iconHTML

    We present a method of analysis for evaluating intrusion detection systems. The method can be used to compare the performance of intrusion detectors, to evaluate performance goals for intrusion detectors, and to determine the best configuration of an intrusion detector for a given environment. The method uses a decision analysis that integrates and extends ROC (receiver operating characteristics) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph-based authentication of digital streams

    Publication Year: 2001, Page(s):232 - 246
    Cited by:  Papers (50)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1204 KB) | HTML iconHTML

    We consider the authentication of digital streams over a lossy network. The overall approach taken is graph-based, as this yields simple methods for controlling overhead, delay, and the ability to authenticate, while serving to unify many previously known hash- and MAC-based techniques. The loss pattern of the network is defined probabilistically, allowing both bursty and random packet loss to be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preserving information flow properties under refinement

    Publication Year: 2001, Page(s):78 - 91
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB) | HTML iconHTML

    In a stepwise development process, it is essential that system properties that have been already investigated in some phase need not be re-investigated in later phases. In formal developments, this corresponds to the requirement that properties are presented under refinement. While safety and liveness properties are indeed preserved under most standard forms of refinement, it is well known that th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SD3: a trust management system with certified evaluation

    Publication Year: 2001, Page(s):106 - 115
    Cited by:  Papers (55)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    We introduce SD3, a trust management system consisting of a high-level policy language, a local policy evaluation, and a certificate retrieval system. A unique feature of SD3 is its certified evaluator. As the evaluator computes the answer to a query, it also computes a proof that the answer follows from the security policy. Before the answer is returned, the proof is passed through a simple check... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-theoretic measures for anomaly detection

    Publication Year: 2001, Page(s):130 - 143
    Cited by:  Papers (72)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB) | HTML iconHTML

    Anomaly detection is an essential component of protection mechanisms against novel attacks. We propose to use several information-theoretic measures, namely, entropy, conditional entropy, relative conditional entropy, information gain, and information cost for anomaly detection. These measures can be used to describe the characteristics of an audit data set, suggest the appropriate anomaly detecti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for asynchronous reactive systems and its application to secure message transmission

    Publication Year: 2001, Page(s):184 - 200
    Cited by:  Papers (39)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1308 KB) | HTML iconHTML

    We present a rigorous model for secure reactive systems in asynchronous networks with a sound cryptographic semantics, supporting abstract specifications and the composition of secure systems. This enables modular proofs of security, which is essential in bridging the gap between the rigorous proof techniques of cryptography and tool-supported formal proof techniques. The model follows the general... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ELK, a new protocol for efficient large-group key distribution

    Publication Year: 2001, Page(s):247 - 262
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB) | HTML iconHTML

    Secure media broadcast over the Internet poses unique security challenges. One problem is access control to a large number of subscribers in a public broadcast. A common solution is to encrypt the broadcast data and to disclose the decryption key to legitimate receivers only. However, how do we securely and efficiently establish a shared secret among the legitimate receivers? And most importantly,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast automaton-based method for detecting anomalous program behaviors

    Publication Year: 2001, Page(s):144 - 155
    Cited by:  Papers (113)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    Anomaly detection on system call sequences has become perhaps the most successful approach for detecting novel intrusions. A natural way for learning sequences is to use a finite-state automaton (FSA). However previous research indicates that FSA-learning is computationally expensive, that it cannot be completely automated or that the space usage of the FSA may be excessive. We present a new appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intrusion detection via static analysis

    Publication Year: 2001, Page(s):156 - 168
    Cited by:  Papers (148)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB) | HTML iconHTML

    One of the primary challenges in intrusion detection is modelling typical application behavior so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The result is a host-based intrusion detection system with three advantages: a high degree of automation, prot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.