Now showing items 1-18 of 18

• #### APSS: Proactive Secret Sharing in Asynchronous Systems ﻿

(Cornell University, 2002-10-11)
APSS, a proactive secret sharing (PSS) protocol for asynchronous systems, is derived and proved correct. A PSS protocol enables a set of secret shares to be periodically refreshed with a new, independent set, thereby ...
• #### Building Adaptive Systems Using Ensemble ﻿

(Cornell University, 1997-07)
Trends in networking and distributed computing are creating a new generation of applications that must adapt as the environment within which they execute changes. Examples of adaptations include switching protocols to ...
• #### COCA: A Secure Distributed On-line Certification Authority ﻿

(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 ...
• #### Cryptographic Support for Fault-Tolerant Distributed Computing ﻿

(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. ...
• #### A Dynamic Light-Weight Group Service ﻿

(Cornell University, 1996-10)
The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. Implementations of virtual synchrony usually require the use of failure detectors and ...

(Cornell University, 2007-05-29)
Consensus is an important building block for building replicated systems, and many consensus protocols have been proposed. In this paper, we show that many consensus protocols can be derived from the same simple genes. We ...
• #### Formally Verifying Hybrid Protocols with the Nuprl Logical ProgrammingEnvironment ﻿

(Cornell University, 2001-05-09)
We describe a generic switching protocol for the construction of hybrid protocols and prove it correct with the Nuprl proof development system. We introduce the concept of meta-properties to characterize communication ...
• #### GSGC: An Efficient Gossip-Style Garbage Collection Scheme for ScalableReliable Multicast ﻿

(Cornell University, 1997-12)
To deliver multicast messages reliably in a group, each member maintains copies of all messages it sends and receives in a buffer for potential local retransmission. The storage of these messages is costly and buffers may ...
• #### The Hierarchical Daisy Architecture for Causal Delivery ﻿

(Cornell University, 1996-09)
In this paper, we propose the {\em hierarchical daisy architecture}\/, which provides causal delivery of messages sent to any subset of processes. The architecture provides fault tolerance and maintains the amount of ...
• #### Hierarchical Message Stability Tracking Protocols ﻿

(Cornell University, 1997-09)
Protocols which track message stability are an important part of reliable multicast protocols in fault-tolerant distributed systems. To reliably deliver multicast messages in a process group, each process maintains copies ...
• #### Packing Messages as a Tool for Boosting the Performance of TotalOrdering Protocols ﻿

(Cornell University, 1995-07)
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a technique that buffers application messages for ...
• #### Performance of the Horus Asynchronous Group Communication System under HighLoad ﻿

(Cornell University, 1996-02)
Horus is an asynchronous group communications system designed to support a variety of distributed and parallel applications. This paper reports the performance of continuous $n \times n$ multicasts for a Horus protocol ...
• #### A Probabilistically Correct Leader Election Protocol for Large Groups ﻿

(Cornell University, 2000-04-17)
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characterized by probabilistic failure rates of ...
• #### Safe Serializable Secure Scheduling: Transactions and the Trade-Off Between Security and Consistency (Technical Report) ﻿

(2016-08-16)
Modern applications often operate on data in multiple administrative domains. In this federated setting, participants may not fully trust each other. These distributed applications use transactions as a core mechanism ...
• #### Strong and Weak Virtual Synchrony in Horus ﻿

(Cornell University, 1995-08)
A formal definition of {\em strong virtual synchrony}, capturing the semantics of virtual synchrony as implemented in Horus, is presented. This definition has the nice property that every message is delivered within the ...