Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as
Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS …

We show that equivocation, ie, making conflicting statements to others in a distributed
protocol, can be monetarily disincentivized by the use of crypto-currencies such as Bitcoin …

A credit network models trust between agents in a distributed environment and enables
payments between arbitrary pairs of agents. With their flexible design and robustness …

In a general secure multi-party computation (MPC) protocol, two or more participants who do
not trust each other, use their respective secret inputs to calculate a joint function in a …

Trusted hardware and new computing platforms such as RDMA naturally provide a non-
equivocation abstraction. Previous works have shown that non-equivocation allows us to …

In the setting of secure multiparty computation, a set of mutually distrusting parties wish to
securely compute a joint function. It is well known that if the communication model is …

Agreement protocols for partially synchronous or asynchronous networks tolerate fewer than
one-third Byzantine faults. If parties are equipped with trusted hardware that prevents …

Critical real-time systems like spacecraft and aircraft commonly use Byzantine fault-tolerant
(BFT) state machine replication (SMR) to mask faulty processors and sensors. Unfortunately …

We present a secure asynchronous multiparty computation (AMPC) protocol with optimal
resilience, involving n= 3t+ 1 parties and tolerating a computationally bounded static …

Agreement protocols for partially synchronous networks tolerate fewer than one-third
Byzantine faults. If parties are equipped with trusted hardware that prevents equivocation …