Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols

(2021) Ran Cohen et al.   JOURNAL OF CRYPTOLOGY

Algorand: A secure and efficient distributed ledger

(2019) Jing Chen et al.   THEORETICAL COMPUTER SCIENCE

Probabilistic Termination and Composability of Cryptographic Protocols

(2018) Ran Cohen et al.   JOURNAL OF CRYPTOLOGY

Secure multi-party computation in large networks

(2016) Varsha Dani et al.   DISTRIBUTED COMPUTING

The Hunting of the SNARK

(2016) Nir Bitansky et al.   JOURNAL OF CRYPTOLOGY

Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares

(2016) Benoît Libert et al.   THEORETICAL COMPUTER SCIENCE

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles

(2012) Steve Lu et al.   JOURNAL OF CRYPTOLOGY

Breaking theO(n2) bit barrier

(2011) Valerie King et al.   JOURNAL OF THE ACM

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

(2010) Dafna Kidron et al.   JOURNAL OF CRYPTOLOGY

Lower bound for scalable Byzantine Agreement

(2008) Dan Holtby et al.   DISTRIBUTED COMPUTING

Universal Arguments and their Applications

(2008) Boaz Barak et al.   SIAM JOURNAL ON COMPUTING