New answers tagged


It depends on how you make shares out of a polynomial. Consider for example Shamir secret sharing, using which a party can share a secret $s \in F$ (where $F$ is a finite field) with $n$ parties by doing the following: Construct a polynomial $f(x) = s + a_1x+a_2x^2+\dots + a_nx^t$, for some $t$, where $a_i \in_R F$ for all $1 \leq i \leq n$. Send the value ...

-2 This will answer your question.


Optimality is actually not a well-defined term for secret sharing, and can refer to a number of different issues. First, one issue that is often considered is the size of the share that each party holds in the scheme. If the size of a party's share equals the size of the secret itself, then the secret sharing scheme is called ideal. (Formally, we don't talk ...


A solution is given by Peter Ryan, Crypto Santa. In The New Codebreakers, vol. 9100 of Lecture Notes in Computer Science, pp. 543-549, Springer, 2016. An earlier version (with Sjouke Mauw and Sasa Radomirovic) can be found at (Open access), Security protocols for Secret Santa.

Top 50 recent answers are included