Now showing items 14-33 of 101

    • COCA: A Secure Distributed On-line Certification Authority 

      Zhou, Lidong; Schneider, Fred B.; van Renesse, Robbert (Cornell University, 2000-12-08)
      COCA is a fault-tolerant and secure on-line certification authority that has been built and deployed both in a local area network and in the Internet. Replication is used to achieve availability; proactive recovery with ...
    • CODEX: A Robust and Secure Secret Distribution System 

      Marsh, Michael A.; Schneider, Fred B. (Cornell University, 2004-07-28)
      CODEX (COrnell Data EXchange) stores secrets for subsequent access by authorized clients. It also is a vehicle for exploring the generality of a relatively new approach to building distributed services that are both ...
    • Completeness and Incompleteness of Trace-Based Network Proof Systems 

      Widom, Jennifer; Gries, David; Schneider, Fred B. (Cornell University, 1986-07)
      Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two ...
    • Computability Classes for Enforcement Mechanisms 

      Hamlen, Kevin W.; Morrisett, Greg; Schneider, Fred B. (Cornell University, 2003-08-26)
      A precise characterization of those security policies enforceable by program rewriting is given. This characterization exposes and rectifies problems in prior work on execution monitoring, yielding a more precise ...
    • Concepts and Notations for Concurrent Programming 

      Andrews, Gregory R.; Schneider, Fred B. (Cornell University, 1982-09)
      Much has been learned in the last decade about concurrent programming. This paper identifies the major concepts and describes some of the more important language notations for writing concurrent programs. The roles of ...
    • Constraints: A Uniform Approach to Aliasing and Typing 

      Lamport, Leslie; Schneider, Fred B. (Cornell University, 1984-09)
      No abstract supplied.
    • A Conversation with Fred Schneider 

      Schneider, Fred B.; Gries, David (Internet-First University Press, 2015-09-09)
      Fred Schneider, an expert in concurrent and distributed systems and in computer and cybersecurity, shares insights about how his professional interests evolved, and provides sweeping views about how his field and department ...
    • Critical (of) Issues in Real-Time Systems: A Position Paper 

      Schneider, Fred B. (Cornell University, 1988-05)
    • Critical Infrastructures You Can Trust: Where Telecommunications Fits 

      Schneider, Fred B.; Bellovin, Steven M.; Inouye, Alan S. (Cornell University, 1998-11)
      This paper discusses two NISs: the public telephone network (PTN) and the Internet. Being themselves large and complex NISs, they not only merit study in their own right but can help us to understand some of the technical ...
    • Cryptographic Support for Fault-Tolerant Distributed Computing 

      Minsky, Yaron; Johansen, Dag; van Renesse, Robbert; Schneider, Fred B. (Cornell University, 1996-07)
      In an open distributed system, agents comprising an application must not only survive (possibly malicious) failures of the hosts they visit, but they must also be resilient to the potentially hostile actions of other hosts. ...
    • Decomposing Properties into Safety and Liveness 

      Schneider, Fred B. (Cornell University, 1987-10)
      A new proof is given that every property can be expressed as a conjunction of safety and liveness properties. The proof is in terms of first-order predicate logic.
    • Defining Liveness 

      Alpern, Bowen; Schneider, Fred B. (Cornell University, 1985-10)
      A formal definition for liveness properties is proposed. It is argued that this definition captures the intuition that liveness properties stipulate that "something good" eventually happens during execution. A topological ...
    • Derivation of a Distributed Algorithm for Finding Paths in Directed Networks 

      McCurley, E. Robert; Schneider, Fred B. (Cornell University, 1983-12)
      A distributed algorithm is developed that can be used to compute the topology of a network, given that each site starts with information about sites it is adjacent to, the network is strongly connected, and communication ...
    • Derivation of Sequential, Real-Time, Process-Control Programs 

      Marzullo, Keith; Schneider, Fred B.; Budhiraja, Navin (Cornell University, 1991-07)
      The use of weakest-precondition predicate tranformers in the derivation of sequential, process-control software is discussed. Only one extension to Dijkstra's calculus for deriving ordinary sequential programs was found ...
    • Detecting Distributed Termination When Processors Can Fail 

      Lermen, C. W.; Schneider, Fred B. (Cornell University, 1980-12)
      A collection of protocols to facilitate detection of the termination of a computation on a distributed system are developed. Communication is assumed to be accomplished by use of asynchronous broadcasting. It is argued ...
    • Distributed Blinding for ElGamal Re-encryption 

      Zhou, Lidong; Marsh, Michael A.; Schneider, Fred B.; Redz, Anna (Cornell University, 2004-01-06)
      A protocol is given that allows a set of n servers to cooperate and produce an ElGamal ciphertext encrypted under one key from an ElGamal ciphertext encrypted under another, but without plaintext ever becoming available. ...
    • A Distributed Path Algorithm and Its Correctness Proof 

      Wright, David D.; Schneider, Fred B. (Cornell University, 1983-06)
      A distributed program is developed to allow a process in a network to determine a path from itself to any other process, assuming that the topology of the entire network is not known to any process and that each process ...
    • Distributed Trust: Supporting Fault-tolerance and Attack-tolerance 

      Schneider, Fred B.; Zhou, Lidong (Cornell University, 2004-01-23)
      Fault-tolerance and attack-tolerance are crucial for implementing a trustworthy service. An emerging thread of research investigates interactions between fault-tolerance and attack-tolerance---specifically, the coupling ...
    • Doctrine for Cybersecurity 

      Mulligan, Deirdre K.; Schneider, Fred B. (2011-04-19)
      A succession of doctrines have been advocated in the past for enhancing cybersecurity: prevention, risk management, and deterrence through accountability. None has proved effective, and their failings are discussed. Most ...
    • Documentation for the CHIP Computer System (Version 1.1) 

      Babaoglu, Ozalp; Bussan, Mimi; Drummond, Rogerio; Schneider, Fred B. (Cornell University, 1983-12)
      CHIP (Cornell Hypothetical Instructional Processor) is a computer system that was designed as an educational tool for teaching undergraduate courses in operating systems and machine architecture. This document constitutes ...