Research Article

Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries

Table 2

Feature comparison of schemes.

Paper[1][17][18][19]This work

Share size
Rushing adversaryNoYesNoYesYes
FairnessNoNoNoNoYes
Communication complexity
Communication topology