By Topic

Research in Security and Privacy, 1994. Proceedings., 1994 IEEE Computer Society Symposium on

Date 16-18 May 1994

Filter Results

Displaying Results 1 - 20 of 20
  • Prudent engineering practice for cryptographic protocols

    Publication Year: 1994, Page(s):122 - 136
    Cited by:  Papers (28)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1210 KB)

    We present principles for the design of cryptographic protocols. The principles are neither necessary nor sufficient for correctness. They are however helpful, in that adherence to them would have avoided a considerable number of published errors. Our principles are informal guidelines. They complement formal methods, but do not assume them. In order to demonstrate the actual applicability of thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • On unifying some cryptographic protocol logics

    Publication Year: 1994, Page(s):14 - 28
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    We present a logic for analyzing cryptographic protocols. This logic encompasses a unification of four of its predecessors in the BAN family of logics, namely those given by Li Gong et al. (1990); M. Abadi, M. Tuttle (1991); P.C. van Oorschot (1993); and BAN itself (M. Burrows et al., 1989). We also present a model-theoretic semantics with respect to which the logic is sound. The logic presented c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure group membership protocol

    Publication Year: 1994, Page(s):176 - 189
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    A group membership protocol enables processes in a distributed system to agree on a group of processes that are currently operational. Membership protocol are a core component of many distributed systems and have proved to be fundamental for maintaining availability and consistency in distributed applications. We present a membership protocol for asynchronous distributed systems that tolerates the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating formal flows in automated information flow analysis

    Publication Year: 1994, Page(s):30 - 38
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Automated flow tools for formal specification languages have the potential to increase assurance and productivity of covert channel analysts by automating much of the work, but they are not reaching that potential now. Perhaps the most serious flaw in existing flow tools is that they typically report large numbers of so-called formal flows. The paper examines the causes of formal flows and describ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity and composability of secure interoperation

    Publication Year: 1994, Page(s):190 - 200
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Advances in distributed systems and networking technology have made interoperation not only feasible but also increasingly popular. The authors define the interoperation of secure systems and its security, and prove complexity and composability results on obtaining optimal and secure interoperation. Most problems are NP-complete even for systems with very simple access control structures. Neverthe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inference channel-free integrity constraints in multilevel relational databases

    Publication Year: 1994, Page(s):158 - 167
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    A multilevel relational database with tuple-level labeling is a relational database together with a mapping, which associates a set of levels in a security lattice with every tuple in every relation in the database. Integrity constraints represent the invariant properties of data in a multilevel relational database. We study the relationship between integrity and secrecy, and show that they are no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mode security: an infrastructure for covert channel suppression

    Publication Year: 1994, Page(s):39 - 55
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    The paper discusses a theory of covert channels called mode security. The general idea is to organize the state transitions of a multilevel state machine into distinct sets called modes. Roughly speaking, each machine mode is totally secure when considered in isolation of all other modes. Covert channels can therefore only occur when the machine executes a mode change decision; thus the name, mode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous composition and required security conditions

    Publication Year: 1994, Page(s):68 - 78
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    We propose a general model of representation of systems which takes into account asynchronous systems. We show that, as non deducibility on strategies, the causality property is also a hook-up property and we generalize this result to the case of asynchronous machines. The two basic operations we use to represent hook-up-direct product and feedback-are generalizations of the classic operations alr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ensuring data security in interrelated tabular data

    Publication Year: 1994, Page(s):96 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Several service agencies including government organizations are engaged in publishing tabular economic data. On the one hand, it is desirable to publish as much data as possible, for use by the public. On the other hand, it is necessary to ensure that confidential data is not divulged. Cell suppression is a popular method that is used for this purpose. Earlier research has focused on cell suppress... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-nonself discrimination in a computer

    Publication Year: 1994, Page(s):202 - 212
    Cited by:  Papers (413)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The problem of protecting computer systems can be viewed generally as the problem of learning to distinguish self from other. The authors describe a method for change detection which is based on the generation of T cells in the immune system. Mathematical analysis reveals computational costs of the system, and preliminary experiments illustrate how the method might be applied to the problem of com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimality of testing for rights in transformation models

    Publication Year: 1994, Page(s):230 - 241
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    Defines and analyzes a family of access control models, called transformation models, which are based on the concept of transformation of rights. In these models, propagation of access rights is authorized entirely by existing rights for the object in question. Transformation models are useful for expressing various kinds of consistency, confidentiality, and integrity controls. These models also g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for secure protocols and their compositions

    Publication Year: 1994, Page(s):2 - 13
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    We give a formal model of protocol security. The model allows us to reason about the security of protocol, and considers issues of beliefs of agents, time, and secrecy. We prove a composition theorem which allows us to state sufficient conditions on two secure protocols A and B such that they may be combined to form a new secure protocol C. Moreover, we give counter-examples to show that when the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elimination of inference channels by optimal upgrading

    Publication Year: 1994, Page(s):168 - 174
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    An inference channel exists if it is possible for a low-clearance user to infer high-classification data from low-classification data. Inference channels can be blocked by upgrading the security classification of some of the low-level data. The task of eliminating inference channels is formulated for solution by the Davis-Putnam theorem-proving procedure. The procedure is augmented to search for s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low cost, high speed encryption system and method

    Publication Year: 1994, Page(s):147 - 154
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Multiple independent binary bit streams per clock cycle are produced from a single underlying shift register based keystream generator with multiple combining circuits. Logic designs are derived from de Bruijn functions. Multiplicity of keystream facilitates using just a single cryptographic device to support high speed, large quantity data transfers over networks. Low cost implementations are als... View full abstract»

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

    Publication Year: 1994, Page(s):56 - 64
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    We discuss the different ways of defining channel capacity for certain types of illicit communication channels. We also correct some errors from the literature, offer new proofs of some historical results, and give bounds for channel capacity. Special function techniques are employed to express the results in closed form. We are interested in a specific type of covert channel, a timing channel. A ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general theory of composition for trace sets closed under selective interleaving functions

    Publication Year: 1994, Page(s):79 - 93
    Cited by:  Papers (71)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    This paper presents a general theory of system composition for “possibilistic” security properties. We see that these properties fall outside of the Alpern-Schneider safety/liveness domain and hence, are not subject to the Abadi-Lamport composition principle. We then introduce a set of trace constructors called selective interleaving functions and show that possibilistic security prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collecting garbage in multilevel secure object stores

    Publication Year: 1994, Page(s):106 - 120
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    This paper addresses the problem of garbage collection in persistent object stores that are multilevel. The proposed approach is able to preserve referential integrity, while ensuring that security is not violated. we first discuss some general principles that should underlie any approach to garbage collection in secure environments. Then, we present a secure garbage collection algorithm, based on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the schematic protection model. I. Conditional tickets and authentication

    Publication Year: 1994, Page(s):213 - 229
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The Schematic Protection Model, SPM, allows us to specify the protection structure of a system and gives an algorithm to reason about the transmission of privileges in the system. This paper extends the SPM model to include for conditional tickets and to provide authentication. We also extend the decision algorithm of the safety problem to take into account these modifications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating formal cryptographic protocol specifications

    Publication Year: 1994, Page(s):137 - 146
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    This paper describes a tool which translates a cryptographic protocol specified in the semi-formal standard notation i. A→B:M into the formal language CKT5. We examine the standard notation syntax, and describe how it is exploited by the tool to infer protocol conditions which must hold for every principal, thereby obtaining a complete, formal specification of the protocol. The translation cr... View full abstract»

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