Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications

ePrint Report: Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications

Nicolas Alhaddad, Mayank Varia, Ziling Yang

Asynchronous complete secret sharing (ACSS) is a foundational primitive in the design of distributed algorithms and cryptosystems that require secrecy. Dual-threshold ACSS permits a dealer to distribute a secret to a collection of $n$ servers so that everyone holds shares of a polynomial containing the dealer's secret.


This work contributes a new ACSS protocol, called Haven++, that uses packing and batching …

algorithms applications asynchronous design distributed eprint report report secrecy secret sharing threshold