We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with
arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs …

In recent years, permisionless blockchains have received a lot of attention both from industry
and academia, where substantial effort has been spent to develop consensus protocols that …

Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms Siddhartha Visveswara Jayanti
సిదా్ధర్థ వి Page 1 Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms by …

In the almost-everywhere reliable message transmission problem, introduced by [Dwork,
Pippenger, Peleg, Upfal'86], the goal is to design a sparse communication network $ G …

For reaching efficient deterministic synchronous Byzantine agreement upon partially
connected networks, the traditional broadcast primitive is extended and integrated with a …

The authenticated broadcast is simulated in the bounded-degree networks to provide
efficient broadcast primitives for building efficient higher-layer Byzantine protocols. A …

To improve the overall efficiency and reliability of Byzantine protocols in large sparse
networks, we propose a new system assumption for developing multi-scale fault-tolerant …

In 2008 an alleged pseudonym “Satoshi Nakamoto” published a white paper entitled
“Bitcoin: A Peer-to-Peer Electronic Cash System”. The white paper is credited with …

Most existing work on secure multi-party computation (MPC) ignores a key idiosyncrasy of
modern communication networks, that there are a limited number of communication paths …

We devise information theoretically secure protocols that allow additional pairs of parties to
establish secure OT correlations using the help of other parties in the network in the …