[Resource Topic] 2022/619: Asynchronous Dynamic Proactive Secret Sharing under Honest Majority: Refreshing Without a Consistent View on Shares

Welcome to the resource topic for 2022/619

Title:
Asynchronous Dynamic Proactive Secret Sharing under Honest Majority: Refreshing Without a Consistent View on Shares

Authors: Matthieu Rambaud, Antoine Urban

Abstract:

We present the first proactive secret sharing under honest majority which is purely over pairwise asynchronous channels. Moreover: - it has robust reconstruction. In addition, provided a single broadcast in the sharing phase, then it commits the dealer to a value; - it operates under a bare PKI and enables dynamic membership; - the standard version carries over the model known as \cst{receiver-anonymous (Yoso)} in which participants speak only once then erase their memories. Each refresh of a secret takes 2 actual message delays and a total of O(n^4) bits sent by the honest \players; - it allows an optimization in O(n^3) bits sent and latency of 5 messages.

ePrint: https://eprint.iacr.org/2022/619

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .