Research Article

Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries

Table 1

Summary of results in robust secret sharing scheme.

PaperShare sizeCommunication complexityRemark

[1]Corruption setting with
[16]——Give the lower bounds for RSS
[17]Secure against rushing adversaries
[18]For
[19]Secure against rushing adversaries
[20] with a third partySecure against rushing adversaries
[21]For
[24]Secure against rushing adversaries