With n parties, Shanrang tolerates n/4 Byzantine faults and maintains liveness as long as the messages are delivered. In contrast to prior work, Shanrang makes no assumptions on the network latency. Designing an asynchronous protocol is challenging because it is impossible to distinguish an adversary sending no messages from an honest party whose messages have not arrived yet. We evaluated Shanrang on geographically distributed machines and we found Shanrang achieved 200 seconds for handing off between 2 committees of 41 parties. Shanrang requires O(λn3 log n) messages and runs in expected O(log n) rounds for every handoff. To show Shanrang is robust even in a harsh network environ- ment, we test Shanrang on the Tor network and it shows robust performance.
Category / Keywords: cryptographic protocols / secret sharing, threshold cryptography Date: received 13 Feb 2022 Contact author: yanyz18 at mails tsinghua edu cn, yuxia at mit edu, devadas at mit edu Available format(s): PDF | BibTeX Citation Version: 20220220:200507 (All versions of this report) Short URL: ia.cr/2022/164