Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions
The work investigates Reed-Solomon codes to build fully anonymous secret-sharing schemes that survive an adversary who permutes symbols and then performs insertions and deletions. The finding is that specific robust codes allow for a gap-threshold scheme where unauthorized shares reveal no information, yet a sufficient number of shares can perfectly reconstruct the secret without revealing participant identities.