Secret Sharing and Secure Computation

Splitting a secret so that any t shares reveal it and any t−1 reveal nothing, and computing on data nobody is allowed to see.0/14 mastered

1 / 14

With

n = 5

parties and a malicious unbounded adversary but no broadcast channel, what is the largest tolerable

t

Your answer

#12974