The authors design a simple yet efficient Asynchronous Data Dissemination (ADD) protocol for 𝑛 parties that is information theoretically secure, tolerates up to one-third malicious nodes, and has a communication cost of 𝑂(𝑛|𝑀|+n² for replicating a message 𝑀. They then use this ADD protocol to improve many important primitives in cryptography and distributed computing.
Sourav Das, Zhuolun Xiang, and Ling Ren (all University of Illinois, Urbana Champaign)
The authors present an approach for compressing regular hash-based signatures using STARKs.
Irakliy Khaburzaniya, Konstantinos Chalkias, Kevin Lewi (all Novi / Facebook, USA), and Harjasleen Malvai (Cornell University / Novi / Facebook, USA)
The authors provide the first efficient construction for auditable MPC that has a one time universal setup.
Sanket Kanjalkar (Blockstream Research), Ye Zhang (New York University), Shreyas Gandlur (Princeton University), Andrew Miller (University of Illinois, Urbana Champaign)