This paper studies dynamic BFT, where replicas can join and leave the system dynamically,
a primitive that is nowadays increasingly needed. We provide a formal treatment for dynamic …

Online social networks (OSNs) are immensely popular, but their centralized control of user
data raises important privacy concerns. This paper presents Vis-à-Vis, a decentralized …

Modern applications face new challenges in managing today's highly distributed and
heterogeneous environment. For example, they must stitch together code that crosses …

Distributed in-memory application data caches like memcached are a popular solution for
scaling database-driven web sites. These systems are easy to add to existing deployments …

A recent trend in stream processing is offloading the computation of decomposable
aggregation functions (DAF) from cloud nodes to geo-distributed fog/edge devices to …

This article describes MPSS, a new way to do proactive secret sharing. MPSS provides
mobility: The group of nodes holding the shares of the secret can change at each resharing …

Network coordinate (NC) systems provide a lightweight and scalable way for predicting the
distances, ie, round-trip latencies among Internet hosts. Most existing NC systems embed …

We present commensal cuckoo,* a secure group partitioning scheme for large-scale
systems that maintains the correctness of many small groups, despite a Byzantine adversary …

Ensuring the freshness of client data is a fundamental problem for applications that rely on
cloud infrastructure to store data and mediate sharing. Thialfi is a notification service …

Byzantine-fault-tolerant replication enhances the availability and reliability of Internet
services that store critical state and preserve it despite attacks or software errors. However …